close
1.

図書

図書
Helmut Alt, Afonso Ferreira (eds.)
出版情報: Berlin ; Tokyo : Springer, c2002  xiv, 660 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 2285
所蔵情報: loading…
目次情報: 続きを見る
Invited Papers
Hyper-Encryption and Everlasting Security / Y.Z. Ding ; M.O. Rabin
Models and Techniques for Communication in Dynamic Networks / C. Scheideler
What Is a Theory? / G. Dowek
Algorithms
A Space Lower Bound for Routing in Trees / P. Fraigniaud ; C. Gavoille
Labeling Schemes for Dynamic Tree Networks / A Korman ; D. Peleg ; Y. Rodeh
Tight Bounds for the Performance of Longest-in-System on DAGs / M. Adler ; A. Rosén
Approximate Strong Separation with Application in Fractional Graph Coloring and Preemptive Scheduling / K. Jansen
Balanced Coloring: Equally Easy for All Numbers of Colors? / B. Doerr
The Complexity of Graph Isomorphism for Colored Graphs with Color Classes of Size 2 and 3 / J. Köbler ; J. Torán
On the Complexity of Generating Maximal Frequent and Minimal Infrequent Sets / E. Boros ; V. Gurvich ; L. Khachiyan ; K. Makino
On Dualization in Products of Forests / K.M. Elbassioni
An Asymptotic <$>{\cal O}<$>(ln ρ/ ln ln ρ)-Approximation Algorithm for the Scheduling Problem with Duplication on Large Communication Delay Graphs / R. Lepere ; C. Rapine
Scheduling at Twilight the Easy Way / H. Bast
Complexity of Multi-dimensional Loop Alignment / A. Darte ; G. Huard
A Probabilistic 3-SAT Algorithm Further Improved / T. Hofmeister ; U. Schöning ; R. Schuler ; O. Watanabe
The Secret of Selective Game Tree Search, When Using Random-Error Evaluations / U. Lorenz ; B. Monien
Randomized Acceleration of Fundamental Matrix Computations / V.Y. Pan
Approximations for ATSP with Parametrized Triangle Inequality / L. Sunil Chandran ; L. Shankar Ram
A New Diagram from Disks in the Plane / J. Giesen ; M. John
Computing the Maximum Detour and Spanning Ratio of Planar Paths, Trees, and Cycles / S. Langerman ; P. Morin ; M. Soss
Current Challenges
On the Parameterized Intractability of Closest Substring and Related Problems / M.R. Fellows ; J. Gramm ; R. Niedermeier
On the Complexity of Protein Similarity Search under mRNA Structure Constraints / R. Backofen ; N.S. Narayanaswamy ; F. Swidan
Pure Dominance Constraints / M. Bodirsky ; M. Kutz
Improved Quantum Communication Complexity Bounds for Disjointness and Equality / P. Høyer ; R. de Wolf
On Quantum Computation with Some Restricted Amplitudes / H. Nishimura
A Quantum Goldreich-Levin Theorem with Cryptographic Applications / M. Adcock ; R. Cleve
On Quantum and Approximate Privacy / H. Klauck
On Quantum Versions of the Yao Principle / M. de Graaf
Computational and Structural Complexity
Describing Parameterized Complexity Classes / J. Flum ; M. Grohe
On the Computational Power of Boolean Decision Lists / M. Krause
How Many Missing Answers Can Be Tolerated by Query Learners? / H.U. Simon
Games with a Uniqueness Property / S. Aida ; M. Crasmaru ; K. Regan
Bi-Immunity Separates Strong NP-Completeness Notions / A. Pavan ; A.L. Selman
Complexity of Semi-algebraic Proofs / D. Grigoriev ; E.A. Hirsch ; D.V. Pasechnik
A Lower Bound Technique for Restricted Branching Programs and Applications / P. Woelfel
The Complexity of Constraints on Intervals and Lengths / A. Krokhin ; P. Jeavons ; P. Jonsson
Automata and Formal Languages
Nesting Until and Since in Linear Temporal Logic / D. Thérien ; T. Wilke
Comparing Verboseness for Finite Automata and Turing Machines / T. Tantau
On the Average Parallelism in Trace Monoids / D. Krob ; J. Mairesse ; I. Michos
A Further Step towards a Theory of Regular MSC Languages / D. Kuske
Existential and Positive Theories of Equations in Graph Products / V. Diekert ; M. Lohrey
The Membership Problem for Regular Expressions with Intersection Is Complete in LOGCFL / H. Petersen
Recognizable Sets of Message Sequence Charts / R. Morin
Strong Bisimilarity and Regularity of Basic Parallel Processes Is PSPACE-Hard / J. Srba
On the Enumerative Sequences of Regular Languages on k Symbols / M.-P. Béal ; D. Perrin
Logic in Computer Science
Ground Tree Rewriting Graphs of Bounded Tree Width / C. Löding
Timed Control Synthesis for External Specifications / D. D'Souza ; P. Madhusudan
Axiomatizing GSOS with Termination / J.C.M. Baeten ; E.P. de Vink
Axiomatising Tree-Interpretable Structures / A. Blumensath
EXPSPACE-Complete Variant of Guarded Fragment with Transitivity / E. Kieroński
A Parametric Analysis of the State Explosion Problem in Model Checking / S. Demri ; F. Laroussinie ; P. Schnoebelen
Generalized Model-Checking over Locally Tree-Decomposable Classes / M. Frick
Learnability and Definability in Trees and Similar Structures / G. Turán
Author Index
Invited Papers
Hyper-Encryption and Everlasting Security / Y.Z. Ding ; M.O. Rabin
Models and Techniques for Communication in Dynamic Networks / C. Scheideler
2.

図書

図書
Helmut Alt, Michel Habib (eds.)
出版情報: Berlin ; Tokyo : Springer, c2003  xvii, 700 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 2607
所蔵情報: loading…
3.

図書

図書
Volker Diekert, Bruno Durand (eds.)
出版情報: Berlin : Springer, c2005  xvi, 706 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 3404
所蔵情報: loading…
4.

図書

図書
Christoph Meinel, Sophie Tison (eds.)
出版情報: Berlin ; Tokyo : Springer, c1999  xiv, 582 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 1563
所蔵情報: loading…
5.

図書

図書
Michel Morvan, Christoph Meinel, Daniel Krob (eds.)
出版情報: Berlin ; New York : Springer, c1998  xv, 630 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 1373
所蔵情報: loading…
6.

図書

図書
Bruno Durand, Wolfgang Thomas (eds.)
出版情報: Berlin : Springer, c2006  xix, 714 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 3884
所蔵情報: loading…
7.

図書

図書
Afonso Ferreira, Horst Reichel (eds.)
出版情報: Berlin ; New York : Springer, c2001  xv, 576 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 2010
所蔵情報: loading…
目次情報: 続きを見る
Invited Presentations
Recurrence in Infinite Words (Extended Abstract) / Julien Cassaigne
Generalized Model-Checking Problems for First-Order Logic / Martin Grohe
Myhill-Nerode Relations on Automatic Systems and the Completeness of Kleene Algebra / Dexter Kozen
Contributions
2-Nested Simulation Is Not Finitely Equationally Axiomatizable / Luca Aceto ; Wan Fokkink ; Anna Ingólfsdóttir
On the Difference between Polynomial-Time Many-One and Truth-Table Reducibilities on Distributional Problems / Shin Aida ; Rainer Schuler ; Tatsuie Tsukiji ; Osamu Watanabe
Matching Polygonal Curves with Respect to the Fréchet Distance / Helmut Alt ; Christian Knauer ; Carola Wenk
On the Class of Languages Recognizable by 1-Way Quantum Finite Automata / Andris Ambainis ; Arnolds Kikusts ; M&amacron;ris Valdats
Star-Free Open Languages and Aperiodic Loops / Martin Beaudry ; Frangois Lemieux ; Denis Thérien
5\frac2n2-Lower Bound for the Multiplicative Complexity of n x n-Matrix Multiplication / Markus Bläser
Evasiveness of Subgraph Containment and Related Properties / Amit Chakrabarti ; Subhash Khot ; Yaoyun Shi
On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs / Andrea E.F. Clementi ; Pilu Crescenzi ; Paolo Penna ; Gianluca Rossi ; Paola Vocca
On Presburger Liveness of Discrete Timed Automata / Zhe Dang ; Pierluigi San Pietro ; Richard A. Kemmerer
Residual Finite State Automata / Fraçcois Denis ; Aurélien Lemay ; Alain Terlutte
Deterministic Radio Broadcasting at Low Cost / Anders Dessmark ; Andrzej Pelc
The Existential Theory of Equations with Rational Constraints in Free Groups is I'PSPACE Complete / Volker Diekert ; Claudio Gutiérrez ; Christian Hagenah
Recursive Randomized Coloring Beats Fair Dice Random Colorings / Benjamin Doerr ; Anand Srivastav
Randomness, Computability, and Density / Rod G. Downey ; Denis R. Hirschfeldt ; André Nies
On Multipartition Communication Complexity (Extended Abstract) / Pavol ĎDuriš ; Juraj Hromkovič ; Stasys Jukna ; Martin Sauerhoff ; Georg Schnitger
Scalable Sparse Topologies with Small Spectrum / Robert Elsäasser ; Rastilav Královič ; Burkhard Monien
Optimal Preemptive Scheduling on Uniform Processors with Non-decreasing Speed Ratios / Leah Epstein
The UPS Problem / Cristina G. Fernandes ; Till Nierhoff
Gathering of Asynchronous Oblivious Robots with Limited Visibility / Paola Flocchini ; Giuseppe Prencipe ; Nicola Santoro ; eter Widmayer
Generalized Langton's Ant: Dynamical Behavior and Complexity / Anahí Gajardo ; Eric Goles ; Andrés Moreira
Optimal and Approximate Station Placement in Networks (With Applications to Multicasting and Space Efficient Traversals) / Clemente Galdi ; Christos Kaklamanis ; Manuela Montangero ; Pino Persiano
Learning Expressions over Monoids (Extended Abstract) / Ricard Gavaldá
Efficient Recognition of Random Unsatisfiable fc-SAT Instances by Spectral Methods / Andreas Goerdt ; Michael Krivelevich
On the Circuit Complexity of Random Generation Problems for Regular and Context-Free Languages / Massimiliano Goldwurm ; Beatrice Palano ; Massimo Santini
Efficient Minimal Perfect Hashing in Nearly Minimal Space / Torben Hagerup ; Torsten Tholey
Small PCPs with Low Query Complexity / Prahladh Harsha ; Madhu Sudan
Space Efficient Algorithms for Series-Parallel Graphs / Andreas Jakoby ; Maciej Liśkiewicz ; Rudiger Reischuk
A Toolkit for First Order Extensions of Monadic Games / David Janin ; Jerzy Marcinkowski
Polynomial Time Approximation Schemes for MAX-BISECTION on Planar and Geometric Graphs / Klaus Jansen ; Marek Karpinski ; Andrzej Lingas ; Eike Seidel
Refining the Hierarchy of Blind Multicounter Languages / Matthias Jantzen ; Alexy Kurganskyy
A Simple Undecidable Problem: The Inclusion Problem for Finite Substitutions on abc / Juhani Karhumdki ; Leonid P. Lisovik
New Results on Alternating and Non-deterministic Two-Dimensional Finite-State Automata / Jarkko Kari ; Cristopher Moore
The Complexity of Minimal Satisfiability Problems / Lefteris M. Kirousis ; Phokion G. Kolaitis
On the Minimal Hardware Complexity of Pseudorandom Function Generators (Extended Abstract) / Matthias Krause ; Stefan Lucks
Approximation Algorithms for Minimum Size 2-Connectivity Problems / Piotr Krysta ; V.S. Anil Kumar
A Model Theoretic Proof of Buchi-Type Theorems and First-Order Logic for N-Free Pomsets / Dietrich Kuske
An Ehrenfeucht-Fraisse Approach to Collapse Results for First-Order Queries over Embedded Databases / Clemens Lautemann ; Nicole Schweikardt
A New Logical Characterization of Buuchi Automata / Giacomo Lenzi
A Primal-Dual Approximation Algorithm for the Survivable Network Design Problem in Hypergraph / Liang Zhao ; Hiroshi Nagamochi ; Toshihide Ibaraki
The Complexity of Copy Constant Detection in Parallel Programs / Markus Müller-Olm
Approximation Algorithms for the Bottleneck Stretch Factor Problem / Giri Narasimhan ; Michiel Smid
Semantical Principles in the Modal Logic of Coalgebras / Dirk Pattinson
The #a = #b Pictures Are Recognizable / Klaus Reinhardt
A Logical Approach to Decidability of Hierarchies of Regular Star-Free Languages / Victor L. Selivanov
Regular Languages Defined by Generalized First-Order Formulas with a Bounded Number of Bound Variables / Howard Straubing
New Bounds on the OBDD-Size of Integer Multiplication via Universal Hashing / Philipp Woelfel
Author Index
Invited Presentations
Recurrence in Infinite Words (Extended Abstract) / Julien Cassaigne
Generalized Model-Checking Problems for First-Order Logic / Martin Grohe
8.

図書

図書
Claude Puech, Rüdiger Reischuk (eds.)
出版情報: Berlin ; New York ; Tokyo : Springer, c1996  xii, 690 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 1046
所蔵情報: loading…
9.

図書

図書
Volker Diekert, Michel Habib (eds.)
出版情報: Berlin ; Tokyo : Springer, c2004  xvi, 658 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 2996
所蔵情報: loading…
10.

図書

図書
R. Cori, M. Wirsing (eds.)
出版情報: Berlin ; Tokyo : Springer-Verlag, c1988  ix, 404 p. ; 25 cm
シリーズ名: Lecture notes in computer science ; 294
所蔵情報: loading…
目次情報: 続きを見る
Complexity
Formal Languages
Rewriting Systems and Abstract Data Types
Graph Grammars
Distributed Algorithms
Geometrical Algorithms
Trace Languages
Semantics of Parallelism
Systems Demonstrations
Complexity
Formal Languages
Rewriting Systems and Abstract Data Types
文献の複写および貸借の依頼を行う
 文献複写・貸借依頼