close
1.

図書

図書
Peter Widmayer ... [et al.] (eds.)
出版情報: Berlin : Springer, c2002  xxi, 1069 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 2380
所蔵情報: loading…
目次情報: 続きを見る
Invited Talks
Molecular Assembly and Computation: From Theory to Experimental Demonstrations / John H. Reif
Towards a Predictive Computational Complexity Theory / Madhav V. Marathe
Equivariant Syntax and Semantics / Andrew M. Pitts
L(A) = L(B)? Decidability Results from Complete Formal Systems / Géraud Sénizergues (Gödel Prize 2002)
Discrete Tomography: Reconstruction under Periodicity Constraints / Alberto Del Lungo ; Andrea Frosini ; Maurice Nivat ; Laurent Vuillon
Local and Global Methods in Data Mining: Basic Techniques and Open Problems / Heikki Mannila
Program Debugging and Validation Using Semantic Approximations and Partial Specifications / M. Hermenegildo ; G. Puebla ; F. Bueno ; P. López García
Best Papers
Inapproximability Results for Equations over Finite Groups / Lars Engebretsen ; Jonas Holmerin ; Alexander Russell
A Faster All-Pairs Shortest Path Algorithm for Real-Weighted Sparse Graphs / Seth Pettie
On Families of Graphs Having a Decidable First Order Theory with Reachability / Thomas Colcombet
Contributions
Heuristically Optimized Trade-Offs: A New Paradigm for Power Laws in the Internet / Alex Fabrikant ; Elias Koutsoupias ; Christos H. Papadimitriou
The Structure and Complexity of Nash Equilibria for a Selfish Routing Game / Dimitris Fotakis ; Spyros Kontogiannis ; Marios Mavronicolas ; Paul Spirakis
Control Message Aggregation in Group Communication Protocols / Sanjeev Khanna ; Joseph (Seffi) Naor ; Dan Raz
Church-Rosser Languages vs. UCFL / Tomasz Jurdziński ; Krzysztof Loryś
Intersection of Regular Languages and Star Hierarchy / Sebastian Bala
On the Construction of Reversible Automata for Reversible Languages / Sylvain Lombardy
Priority Queues, Pairing, and Adaptive Sorting / Amr Elmasry
Exponential Structures for Efficient Cache-Oblivious Algorithms / Michael A. Bender ; Richard Cole ; Rajeev Raman
Bounded-Depth Frege Systems with Counting Axioms Polynomially Simulate Nullstellensatz Refutations / Russell Impagliazzo ; Nathan Segerlind
On the Complexity of Resolution with Bounded Conjunctions / Juan Luis Esteban ; Nicola Galesi ; Jochen Messner
Cryptographic Hardness Based on the Decoding of Reed-Solomon Codes / Aggelos Kiayias ; Moti Yung
Perfect Constant-Round Secure Computation via Perfect Randomizing Polynomials / Yuval Ishai ; Eyal Kushilevitz
Exponential Lower Bound for Static Semi-algebraic Proofs / Dima Grigoriev ; Edward A. Hirsch ; Dmitrii V. Pasechnik
Paths Problems in Symmetric Logarithmic Space / Andreas Jakoby ; Maciej Liśkiewicz
Scheduling Search Procedures / Peter Damaschke
Removable Online Knapsack Problems / Kazuo Iwama ; Shiro Taketomi
New Bounds for Variable-Sized and Resource Augmented Online Bin Packing / Leah Epstein ; Steve Seiden ; Rob van Stee
The Quest for Small Universal Cellular Automata / Nicolas Ollinger
Hyperbolic Recognition by Graph Automata / Christophe Papazian ; Eric Rémila
Quantum and Stochastic Branching Programs of Bounded Width / Farid Ablayev ; Cristopher Moore ; Christopher Pollett
Spanning Trees with Bounded Number of Branch Vertices / Luisa Gargano ; Pavol Hell ; Ladislav Stacho ; Ugo Vaccaro
Energy Optimal Routing in Radio Networks Using Geometric Data Structures / René Beier ; Peter Sanders ; Naveen Sivadasan
Gossiping with Bounded Size Messages in ad hoc Radio Networks / Malin Christersson ; Leszek G&acedil;sieniec ; Andrzej Lingas
The Kolmogorov-Loveland Stochastic Sequences Are Not Closed under Selecting Subsequences / Wolfgang Merkle
The Nondeterministic Constraint Logic Model of Computation: Reductions and Applications / Robert A. Hearn ; Erik D. Demaine
Constraint Satisfaction Problems in Non-deterministic Logarithmic Space / Víctor Dalmau
Cache Oblivious Distribution Sweeping / Gerth Stølting Brodal ; Rolf Fagerberg
One-Probe Search / Anna Östlin ; Rasmus Pagh
New Algorithms for Subset Query, Partial Match, Orthogonal Range Searching, and Related Problems / Moses Charikar ; Piotr Indyk ; Rina Panigrahy
Measuring the Probabilistic Powerdomain / Keye Martin ; Michael Mislove ; James Worrell
Games Characterizing Levy-Longo Trees / C.-H.L. Ong ; P. Di Gianantonio
Comparing Functional Paradigms for Exact Real-Number Computation / Andrej Bauer ; Martín Hötzel Escardó ; Alex Simpson
Random Sampling from Boltzmann Principles / Philippe Duchon ; Philippe Flajolet ; Guy Louchard ; Gilles Schaeffer
On the Average Performance of Orthogonal Range Search in Multidimensional Data Structures / Amalia Duch ; Conrado Martínez
Bialgebraic Modelling of Timed Processes / Marco Kick
Testing Labelled Markov Processes / Franck van Breugel ; Steven Shalit
Why Computational Complexity Requires Stricter Martingales / John M. Hitchcock ; Jack H. Lutz
Correspondence Principles for Effective Dimensions
A Total Approach to Partial Algebraic Specification / José Meseguer ; Grigore Roşu
Axiomatising Divergence / Markus Lohrey ; Pedro R. D'Argenio ; Holger Hermanns
A Spatial Logic for Querying Graphs / Luca Cardelli ; Philippa Gardner ; Giorgio Ghelli
Improving Time Bounds on Maximum Generalised Flow Computations by Contracting the Network / Tomasz Radzik
Approximation Hardness of Bounded Degree MIN-CSP and MIN-BISECTION / Piotr Berman ; Marek Karpinski
Improved Bounds and New Trade-Offs for Dynamic All Pairs Shortest Paths / Camil Demetrescu ; Giuseppe F. Italiano
Synthesis of Uninitialized Systems / Thomas A. Henzinger ; Sriram C. Krishnan ; Orna Kupferman ; Freddy Y.C. Mang
Infinite-State High-Level MSCs: Model-Checking and Realizability / Blaise Genest ; Anca Muscholl ; Helmut Seidl ; Marc Zeitoun
Universal Inherence of Cycle-Free Context-Free Ambiguity Functions / Klaus Wich
Histogramming Data Streams with Fast Per-Item Processing / Sudipto Guha ; S. Muthukrishnan ; Martin J. Strauss
Finding Frequent Items in Data Streams / Kevin Chen ; Martin Farach-Colton
Symbolic Strategy Synthesis for Games on Pushdown Graphs / Thierry Cachat
Strong Bisimilarity and Regularity of Basic Process Algebra Is PSPACE-Hard / Jiří Srba
Solving the String Statistics Problem in Time <$>{\cal O}<$>(n log n) / Rune B. Lyngsø ; Christian N.S. Pedersen
A PTAS for Distinguishing (Sub)string Selection / Xiaotie Deng ; Guojun Li ; Zimao Li ; Bin Ma ; Lusheng Wang
On the Theory of One-Step Rewriting in Trace Monoids / Dietrich Kuske
Navigating with a Browser / Michail Bielecki ; Jan Hidders ; Jan Paredaens ; Jerzy Tyszkiewicz ; Jan Van den Bussche
Improved Results for Stackelberg Scheduling Strategies / V.S. Anil Kumar
Call Control in Rings / Udo Adamy ; Christoph Ambuehl ; R. Sai Anand ; Thomas Erlebach
Preemptive Scheduling in Overloaded Systems / Marek Chrobak ; John Noga ; Jiří Sgall ; Tomáš Tichý ; Nodari Vakhania
The Equivalence Problem of Finite Substitutions on ab*c, with Applications / J. Karhumäki ; L.P. Lisovik
Deciding DPDA Equivalence Is Primitive Recursive / Colin Stirling
Two-Way Alternating Automata and Finite Models / Mikolaj Bojańczyk
Approximating Huffman Codes in Parallel / Yakov Nekrich
Seamless Integration of Parallelism and Memory Hierarchy / Carlo Fantozzi ; Andrea Pietracaprina ; Geppino Pucci
The Communication Complexity of Approximate Set Packing and Covering / Noam Nisan
Antirandomizing the Wrong Game / Benjamin Doerr
Fast Universalization of Investment Strategies with Provably Good Relative Returns / Karhan Akcoglu ; Petros Drineas ; Ming-Yang Kao
Randomized Pursuit-Evasion in Graphs / Micah Adler ; Harald Räcke ; Christian Sohler ; Berthold Vöcking
The Essence of Principal Typings / J. B. Wells
Complete and Tractable Local Linear Time Temporal Logics over Traces / Bharat Adsul ; Milind Sohoni
An Elementary Expressively Complete Temporal Logic for Mazurkiewicz Traces / Paul Gastin ; Madhavan Mukund
Random Numbers and an Incomplete Immune Recursive Set / Vasco Brattka
A Banach-Mazur Computable But Not Markov Computable Function on the Computable Real Numbers / Peter Hertling
Polynomial-Time Approximation Schemes for the Euclidean Survivable Network Design Problem / Artur Czumaj ; Hairong Zhao
Finding a Path of Superlogarithmic Length / Andreas Björklund ; Thore Husfeldt
Linear Time Algorithms on Chordal Bipartite and Strongly Chordal Graphs / Ryuhei Uehara
Improved Inapproximability Results for Vertex Cover on k-Uniform Hypergraphs
Efficient Testing of Hypergraphs / Yoshiharu Kohayakawa ; Brendan Nagle ; Vojtěch Rödl
Optimal Net Surface Problems with Applications / Xiaodong Wu ; Danny Z. Chen
Wagner's Theorem on Realizers / Nicolas Bonichon ; Bertrand Le Saëc ; Mohamed Mosbah
Circular Arrangements / Vincenzo Liberatore
Author Index
Invited Talks
Molecular Assembly and Computation: From Theory to Experimental Demonstrations / John H. Reif
Towards a Predictive Computational Complexity Theory / Madhav V. Marathe
2.

図書

図書
Fernando Orejas, Paul G. Spirakis, Jan van Leeuwen (eds.)
出版情報: Berlin : Springer, c2001  xiv, 1083 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 2076
所蔵情報: loading…
3.

図書

図書
Luís Caires ... [et al.] (eds.)
出版情報: Berlin : Springer, c2005  xxv, 1477 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 3580
所蔵情報: loading…
4.

図書

図書
Josep Díaz ... [et al.] (eds.)
出版情報: Berlin ; Tokyo : Springer, c2004  xix, 1253 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 3142
所蔵情報: loading…
5.

図書

図書
Michele Bugliesi ... [et al.] (eds.)
出版情報: Berlin : Springer, c2006  2 v. ; 24 cm
シリーズ名: Lecture notes in computer science ; 4051-4052
所蔵情報: loading…
目次情報: 続きを見る
Invited Lectures
Additive Approximation for Edge-Deletion Problems / Noga Alon ; Asaf Shapira ; Benny Sudakov
Graph Theory I
Testing Graph Isomorphism in Parallel by Playing a Game / Martin Grohe ; Oleg Verbitsky
The Spectral Gap of Random Graphs with Given Expected Degrees / Amin Coja-Oghlan ; Andre Lanka
Embedding Bounded Bandwidth Graphs into l[subscript 1] / Douglas E. Carroll ; Ashish Goel ; Adam Meyerson
On Counting Homomorphisms to Directed Acyclic Graphs / Martin Dyer ; Leslie Ann Goldberg ; Mike Paterson
Quantum Computing
Fault-Tolerance Threshold for a Distance-Three Quantum Code / Ben W. Reichardt
Lower Bounds on Matrix Rigidity Via a Quantum Argument / Ronald de Wolf
Self-testing of Quantum Circuits / Frederic Magniez ; Dominic Mayers ; Michele Mosca ; Harold Ollivier
Randomness
Deterministic Extractors for Independent-Symbol Sources / Chia-Jung Lee ; Chi-Jen Lu ; Shi-Chun Tsai
Gap Amplification in PCPs Using Lazy Random Walks / Jaikumar Radhakrishnan
Stopping Times, Metrics and Approximate Counting / Magnus Bordewich ; Marek Karpinski
Formal Languages
Algebraic Characterization of the Finite Power Property / Michal Kunc
P-completeness of Cellular Automaton Rule 110 / Turlough Neary ; Damien Woods
Small Sweeping 2NFAs Are Not Closed Under Complement / Christos A. Kapoutsis
Expressive Power of Pebble Automata / Mikotaj Bojanczyk ; Mathias Samuelides ; Thomas Schwentick ; Luc Segoufin
Delegate and Conquer: An LP-Based Approximation Algorithm for Minimum Degree MSTs / R. Ravi ; Mohit SinghApproximation Algorithms I:
Better Algorithms for Minimizing Average Flow-Time on Related Machines / Naveen Garg ; Amit Kumar
A Push-Relabel Algorithm for Approximating Degree Bounded MSTs / Kamalika Chaudhuri ; Satish Rao ; Samantha Riesenfeld ; Kunal Talwar
Edge Disjoint Paths in Moderately Connected Graphs / Shuheng Zhou
A Robust APTAS for the Classical Bin Packing Problem / Leah Epstein ; Asaf LevinApproximation Algorithms II:
Better Inapproximability Results for MaxClique, Chromatic Number and Min-3Lin-Deletion / Subhash Khot ; Ashok Kumar Ponnuswami
Approximating the Orthogonal Knapsack Problem for Hypercubes / Rolf Harren
A Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs / Ramesh Hariharan ; Telikepalli Kavitha ; Kurt MehlhornGraph Algorithms I:
Finding the Smallest H-Subgraph in Real Weighted Graphs and Related Problems / Virginia Vassilevska ; Ryan Williams ; Raphael Yuster
Weighted Bipartite Matching in Matrix Multiplication Time / Piotr Sankowski
Optimal Resilient Sorting and Searching in the Presence of Memory Faults / Irene Finocchi ; Fabrizio Grandoni ; Giuseppe F. ItalianoAlgorithms I:
Reliable and Efficient Computational Geometry Via Controlled Perturbation / Ralf Osbild ; Michael Sagraloff
Tight Bounds for Selfish and Greedy Load Balancing / Ioannis Caragiannis ; Michele Flammini ; Christos Kaklamanis ; Panagiotis Kanellopoulos ; Luca Moscardelli
Lower Bounds of Static Lovasz-Schrijver Calculus Proofs for Tseitin Tautologies / Arist Kojevnikov ; Dmitry ItsyksonComplexity I:
Extracting Kolmogorov Complexity with Applications to Dimension Zero-One Laws / Lance Fortnow ; John M. Hitchcock ; A. Pavan ; N. V. Vinodchandran ; Fengming Wang
The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies / Parikshit Gopalan ; Phokion G. Kolaitis ; Elitza N. Maneva ; Christos H. Papadimitriou
Data Structures and Linear Algebra
Suffix Trays and Suffix Trists: Structures for Faster Text Indexing / Richard Cole ; Tsvi Kopelowitz ; Moshe Lewenstein
Optimal Lower Bounds for Rank and Select Indexes / Alexander Golynski
Dynamic Interpolation Search Revisited / Alexis Kaporis ; Christos Makris ; Spyros Sioutas ; Athanasios Tsakalidis ; Kostas Tsichlas ; Christos Zaroliagis
Dynamic Matrix Rank / Gudmund Skovbjerg Frandsen ; Peter Frands Frandsen
Graphs
Nearly Optimal Visibility Representations of Plane Graphs / Xin He ; Huaming Zhang
Planar Crossing Numbers of Genus g Graphs / Hristo Djidjev ; Imrich Vrt'o
How to Trim an MST: A 2-Approximation Algorithm for Minimum Cost Tree Cover / Toshihiro Fujito
Tight Approximation Algorithm for Connectivity Augmentation Problems / Guy Kortsarz ; Zeev Nutov
On the Bipartite Unique Perfect Matching Problem / Thanh Minh Hoang ; Meena Mahajan ; Thomas ThieraufComplexity II:
Comparing Reductions to NP-Complete Sets
Design Is as Easy as Optimization / Deeparnab Chakrabarty ; Aranyak Mehta ; Vijay V. Vazirani
On the Complexity of 2D Discrete Fixed Point Problem / Xi Chen ; Xiaotie Deng
Routing (Un-) Splittable Flow in Games with Player-Specific Linear Latency Functions / Martin Gairing ; Burkhard Monien ; Karsten TiemannGame Theory I:
The Game World Is Flat: The Complexity of Nash Equilibria in Succinct Games / Constantinos Daskalakis ; Alex Fabrikant
Network Games with Atomic Players / Roberto Cominetti ; Jose R. Correa ; Nicolas E. Stier-Moses
Finite-State Dimension and Real Arithmetic / David Doty ; Jack H. Lutz ; Satyadev NandakumarAlgorithms II:
Exact Algorithms for Exact Satisfiability and Number of Perfect Matchings / Andreas Bjorklund ; Thore Husfeldt
The Myriad Virtues of Wavelet Trees / Paolo Ferragina ; Raffaele Giancarlo ; Giovanni Manzini
Atomic Congestion Games Among Coalitions / Dimitris Fotakis ; Spyros Kontogiannis ; Paul SpirakisGame Theory II:
Computing Equilibrium Prices in Exchange Economies with Tax Distortions / Bruno Codenotti ; Luis Rademacher ; Kasturi Varadarajan
New Constructions of Mechanisms with Verification / Vincenzo Auletta ; Roberto De Prisco ; Paolo Penna ; Giuseppe Persiano ; Carmine Ventre
Networks, Circuits and Regular Expressions
On the Price of Stability for Designing Undirected Networks with Fair Cost Allocations / Amos Fiat ; Haim Kaplan ; Meital Levy ; Svetlana Olonetsky ; Ronen Shabo
Dynamic Routing Schemes for General Graphs / Amos Korman ; David Peleg
Energy Complexity and Entropy of Threshold Circuits / Kei Uchizawa ; Rodney Douglas ; Wolfgang Maass
New Algorithms for Regular Expression Matching / Philip Bille
Fixed Parameter Complexity and Approximation Algorithms
A Parameterized View on Matroid Optimization Problems / Daniel Marx
Fixed Parameter Tractability of Binary Near-Perfect Phylogenetic Tree Reconstruction / Guy E. Blelloch ; Kedar Dhamdhere ; Eran Halperin ; Russell Schwartz ; Srinath Sridhar
Length-Bounded Cuts and Flows / Georg Baier ; Thomas Erlebach ; Alexander Hall ; Ekkehard Kohler ; Heiko Schilling ; Martin Skutella
An Adaptive Spectral Heuristic for Partitioning Random Graphs / Graph Algorithms II:
Some Results on Matchgates and Holographic Algorithms / Jin- Yi Cai ; Vinay Choudhary
Weighted Popular Matchings / Julian Mestre
Author Index
Invited Papers
Differential Privacy / Cynthia Dwork
The One Way to Quantum Computation / Vincent Danos ; Elham Kashefi ; Prakash Panangaden
Zero-Knowledge and Signatures
Efficient Zero Knowledge on the Internet / Ivan Visconti
Independent Zero-Knowledge Sets / Rosario Gennaro ; Silvio Micali
An Efficient Compiler from [Sigma]-Protocol to 2-Move Deniable Zero-Knowledge / Jun Furukawa ; Kaoru Kurosawa ; Hideki Imai
New Extensions of Pairing-Based Signatures into Universal Designated Verifier Signatures / Damien Vergnaud
Cryptographic Protocols
Corrupting One vs. Corrupting Many: The Case of Broadcast and Multicast Encryption / Daniele Micciancio ; Saurabh Panjwani
Cryptographically Sound Implementations for Communicating Processes / Pedro Adao ; Cedric Fournet
A Dolev-Yao-Based Definition of Abuse-Free Protocols / Detlef Kahler ; Ralf Kusters ; Thomas Wilke
Secrecy and Protocol Analysis
Preserving Secrecy Under Refinement / Rajeev Alur ; Pavol Cerny ; Steve Zdancewic
Quantifying Information Leakage in Process Calculi / Michele Boreale
Symbolic Protocol Analysis in Presence of a Homomorphism Operator and Exclusive Or / Stephanie Delaune ; Pascal Lafourcade ; Denis Lugiez ; Ralf Treinen
Cryptographic Primitives
Generalized Compact Knapsacks Are Collision Resistant / Vadim Lyubashevsky
An Efficient Provable Distinguisher for HFE / Vivien Dubois ; Louis Granboulan ; Jacques Stern
A Tight Bound for EMAC / Krzysztof Pietrzak
Constructing Single- and Multi-output Boolean Functions with Maximal Algebraic Immunity / Frederik Armknecht ; Matthias Krause
Bounded Storage and Quantum Models
On Everlasting Security in the Hybrid Bounded Storage Model / Danny Harnik ; Moni Naor
On the Impossibility of Extracting Classical Randomness Using a Quantum Computer / Yevgeniy Dodis ; Renato Renner
Quantum Hardcore Functions by Complexity-Theoretical Quantum List Decoding / Akinori Kawachi ; Tomoyuki Yamakami
Foundations
Efficient Pseudorandom Generators from Exponentially Hard One-Way Functions / Iftach Haitner ; Omer Reingold
Hardness of Distinguishing the MSB or LSB of Secret Keys in Diffle-Hellman Schemes / Pierre-Alain Fouque ; David Pointcheval ; Sebastien Zimmer
A Probabilistic Hoare-style Logic for Game-Based Cryptographic Proofs / Ricardo Corin ; Jerry den Hartog
Multi-party Protocols
Generic Construction of Hybrid Public Key Traitor Tracing with Full-Public-Traceability / Duong Hieu Phan ; Reihaneh Safavi-Naini ; Dongvu Tonien
An Adaptively Secure Mix-Net Without Erasures / Douglas Wikstrom ; Jens Groth
Multipartite Secret Sharing by Bivariate Interpolation / Tamir Tassa ; Nira Dyn
Identity-Based Encryption Gone Wild / Michel Abdalla ; Dario Catalano ; Alexander W. Dent ; John Malone-Lee ; Gregory Neven ; Nigel P. Smart
Games
Deterministic Priority Mean-Payoff Games as Limits of Discounted Games / Hugo Gimbert ; Wieslaw Zielonka
Recursive Concurrent Stochastic Games / Kousha Etessami ; Mihalis Yannakakis
Half-Positional Determinacy of Infinite Games / Eryk Kopczyriski
A Game-Theoretic Approach to Deciding Higher-Order Matching / Colin Stirling
Semantics
Descriptive and Relative Completeness of Logics for Higher-Order Functions / Kohei Honda ; Martin Berger ; Nobuko Yoshida
Interpreting Polymorphic FPC into Domain Theoretic Models of Parametric Polymorphism / Rasmus Ejlers Mogelberg
Typed GoI for Exponentials / Esfandiar Haghverdi
Commutative Locative Quantifiers for Multiplicative Linear Logic / Stefano Guerrini ; Patrizia Marzuoli
The Wadge Hierarchy of Deterministic Tree Languages / Filip MurlakAutomata I:
Timed Petri Nets and Timed Automata: On the Discriminating Power of Zeno Sequences / Patricia Bouyer ; Serge Haddad ; Pierre-Alain Reynier
On Complexity of Grammars Related to the Safety Problem / Tomasz Jurdzinski
Models
Jumbo [lambda]-Calculus / Paul Blain Levy
[lambda]-RBAC: Programming with Role-Based Access Control / Radha Jagadeesan ; Alan Jeffrey ; Corin Pitcher ; James Riely
Communication of Two Stacks and Rewriting / Juhani Karhumaki ; Alexander Okhotin
Equations
On the Axiomatizability of Priority / Luca Aceto ; Taolue Chen ; Wan Fokkink ; Anna Ingolfsdottir
A Finite Equational Base for CCS with Left Merge and Communication Merge / Bas Luttik
Theories of HNN-Extensions and Amalgamated Products / Markus Lohrey ; Geraud Senizergues
On Intersection Problems for Polynomially Generated Sets / Wong Karianto ; Aloys Krieg ; Wolfgang Thomas
Logics
Invisible Safety of Distributed Protocols / Ittai Balaban ; Amir Pnueli ; Lenore D. Zuck
The Complexity of Enriched [mu]-Calculi / Piero A. Bonatti ; Carsten Lutz ; Aniello Murano ; Moshe Y. Vardi
Interpreting Tree-to-Tree Queries / Michael Benedikt ; Christoph Koch
Constructing Exponential-Size Deterministic Zielonka Automata / Blaise Genest ; Anca MuschollAutomata II:
Flat Parametric Counter Automata / Marius Bozga ; Radu Iosif ; Yassine Lakhnech
Lower Bounds for Complementation of [omega]-Automata Via the Full Automata Technique / Qiqi Yan
Invited Lectures
Additive Approximation for Edge-Deletion Problems / Noga Alon ; Asaf Shapira ; Benny Sudakov
Graph Theory I
6.

図書

図書
Kim G. Larsen, Sven Skyum, Glynn Winskel (eds.)
出版情報: Berlin ; Tokyo : Springer, c1998  xvi, 932 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 1443
所蔵情報: loading…
7.

図書

図書
Jiří Wiedermann, Peter van Emde Boas, Mogens Nielsen (eds.)
出版情報: Berlin ; Tokyo : Springer, c1999  xiv, 720 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 1644
所蔵情報: loading…
8.

図書

図書
Ugo Montanari, José D.P. Rolim, Emo Welzl (eds.)
出版情報: Berlin : Springer, c2000  xvi, 941 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 1853
所蔵情報: loading…
9.

図書

図書
Jos C.M. Baeten ... [et al.] (eds.)
出版情報: Berlin ; Tokyo : Springer, c2003  xviii, 1199 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 2719
所蔵情報: loading…
10.

図書

図書
Thomas Ottmann, (ed.)
出版情報: Berlin ; Tokyo : Springer-Verlag, c1987  x, 565 p. ; 25 cm
シリーズ名: Lecture notes in computer science ; 267
所蔵情報: loading…
文献の複写および貸借の依頼を行う
 文献複写・貸借依頼