Die bibliographische Datenbank LEABib

Suchen • Liste der Journale • Liste der Serien • Liste der Konferenzen • Ausgewählte Publikationen	Hilfe

Suche: Series=LNCS AND Volume=820

Als [bib] [pdf] [ps] [dvi] [xml] herunterladen.

Unexpected upper bounds on the complexity of some communication games
Pavel Pudlák
Lecture Notes in Computer Science 820, 1994, pp. 1-10
Valuations and unambiguity of languages, with applications to fractal geometry
Henning Fernau, Ludwig Staiger
Lecture Notes in Computer Science 820, 1994, pp. 11-22
On the computational power of probabilistic and faulty neural networks
Hava T. Siegelmann
Lecture Notes in Computer Science 820, 1994, pp. 23-34
Deciding properties of integral relational automata
Kārlis C̑erāns
Lecture Notes in Computer Science 820, 1994, pp. 35-46
On the cost of recomputing: Tight bounds on pebbling with faults
Yonatan Aumann, Judit Bar-Ilan, Uriel Feige
Lecture Notes in Computer Science 820, 1994, pp. 47-58
On some relations between dynamical systems and transition systems
Eugene Asarin, Oded Maler
Lecture Notes in Computer Science 820, 1994, pp. 59-72
Complexity results for multi-pebble automata and their logics
Noa Globerman, David Harel
Lecture Notes in Computer Science 820, 1994, pp. 73-82
An analysis of the Core-ML language: Expressive power and type reconstruction
Paris C. Kanellakis, Gerd G. Hillebrand, Harry G. Mairson
Lecture Notes in Computer Science 820, 1994, pp. 83-105
Expressiveness of efficient semi-deterministic choice constructs
Marc Gyssens, Jan Van den Bussche, Dirk van Gucht
Lecture Notes in Computer Science 820, 1994, pp. 106-117
Tailoring recursion for complexity
Erich Grädel, Yuri Gurevich
Lecture Notes in Computer Science 820, 1994, pp. 118-129
Determinizing asynchronous automata
Nils Klarlund, Madhavan Mukund, Milind Sohoni
Lecture Notes in Computer Science 820, 1994, pp. 130-141
On the complementation of Büchi asynchronous cellular automata
Anca Muscholl
Lecture Notes in Computer Science 820, 1994, pp. 142-153
Distribution and locality of concurrent systems
Flavio Corradini, Rocco de Nicola
Lecture Notes in Computer Science 820, 1994, pp. 154-165
Liveness in timed and untimed systems
Rainer Gawlick, Roberto Segala, Jorgen Sgaard-Andersen, Nancy Lynch
Lecture Notes in Computer Science 820, 1994, pp. 166-177
Average-case analysis of pattern-matching in trees under the BST probability model
José-Ramón Sánchez-Couso, María-Inés Fernández-Camacho
Lecture Notes in Computer Science 820, 1994, pp. 178-190
On the approximation of shortest common supersequences and longest common subsequences
Tao Jiang, Ming Li
Lecture Notes in Computer Science 820, 1994, pp. 191-202
Optimal parallel algorithms for prefix matching
Ramesh Hariharan, S. Muthukrishnan
Lecture Notes in Computer Science 820, 1994, pp. 203-214
Optimal two-dimensional compressed matching
Amihood Amir, Gary Benson, Martin Farach
Lecture Notes in Computer Science 820, 1994, pp. 215-226
Maintaining spanning trees of small diameter
Giuseppe F. Italiano, Rajiv Ramaswami
Lecture Notes in Computer Science 820, 1994, pp. 227-238
Simple fast parallel hashing
Joseph Gil, Yossi Matias
Lecture Notes in Computer Science 820, 1994, pp. 239-250
The optimal alphabetic tree problem revisited
Teresa M. Przytycka, Lawrence L. Larmore
Lecture Notes in Computer Science 820, 1994, pp. 251-262
On the cutting edge of relativization: The resource bounded injury method
Harry Buhrman, Leen Torenvliet
Lecture Notes in Computer Science 820, 1994, pp. 263-273
PSPACE-completeness of certain algorithmic problems on the subgroups of free groups
J.-C. Birget, S. Margolis, J. Meakin, P. Weil
Lecture Notes in Computer Science 820, 1994, pp. 274-285
Higher-order processes and their models
M. Hennessy
Lecture Notes in Computer Science 820, 1994, pp. 286-303
Efficient local correctness checking for single and alternating Boolean equation systems
B. Vergauwen, J. Lewi
Lecture Notes in Computer Science 820, 1994, pp. 304-315

Seiten 1 2 3 >