Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=1200

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

Unifying models
Bernhard Steffen
Lecture Notes in Computer Science 1200, 1997, pp. 1-20
Predecessor queries in dynamic integer sets
Gert Stlting Brodal
Lecture Notes in Computer Science 1200, 1997, pp. 21-32
Semi-dynamic shortest paths and breadth-first search in digraphs
Paolo Giulio Franciosa, Daniele Frigioni, Roberto Giaccio
Lecture Notes in Computer Science 1200, 1997, pp. 33-46
Greibach normal form transformation, revisited
Robert Koch, Norbert Blum
Lecture Notes in Computer Science 1200, 1997, pp. 47-54
Translating regular expressions into small \varepsilon-free nondeterministic finite automata
Juraj Hromkovic̑, Sebastian Seibert, Thomas Wilke
Lecture Notes in Computer Science 1200, 1997, pp. 55-66
Memory management for Union-Find algorithms
Christophe Fiorio, Jens Gustedt
Lecture Notes in Computer Science 1200, 1997, pp. 67-79
Fast online multiplication of real numbers
Mathias Schröder
Lecture Notes in Computer Science 1200, 1997, pp. 81-92
The operators min and max on the polynomial hierarchy
Harald Hempel, Gerd Wechsung
Lecture Notes in Computer Science 1200, 1997, pp. 93-104
Resource-bounded Kolmogorov complexity revisited
Harry Buhrman, Lance Fortnow
Lecture Notes in Computer Science 1200, 1997, pp. 105-116
Las Vegas versus determinism for one-way communication complexity, finite automata, and polynomial-time computations
Pavol D̑uris̑, Juraj Hromkovic̑, José D.P. Rolim, Georg Schnitger
Lecture Notes in Computer Science 1200, 1997, pp. 117-128
Interactive proof systems with public coin: Lower space bounds and hierarchies of complexity classes
Maciej Liśkiewicz
Lecture Notes in Computer Science 1200, 1997, pp. 129-140
MOD_p-tests, almost independence and small probability spaces
Claudia Bertram-Kretzberg, Hanno Lefmann
Lecture Notes in Computer Science 1200, 1997, pp. 141-152
Hybrid diagrams: A deductive-algorithmic approach to hybrid system verification
Luca de Alfaro, Arjun Kapur, Zohar Manna
Lecture Notes in Computer Science 1200, 1997, pp. 153-164
Temporal logics for the specification of performance and reliability
Luca de Alfaro
Lecture Notes in Computer Science 1200, 1997, pp. 165-176
Efficient scaling-invariant checking of timed bisimulation
Carsten Weise, Dirk Lenzkes
Lecture Notes in Computer Science 1200, 1997, pp. 177-188
Gossiping and broadcasting versus computing functions in networks
Martin Dietzfelbinger
Lecture Notes in Computer Science 1200, 1997, pp. 189-200
On the descriptive and algorithmic power of parity ordered binary decision diagrams
Stephan Waack
Lecture Notes in Computer Science 1200, 1997, pp. 201-212
A reducibility concept for problems defined in terms of ordered binary decision diagrams
Christoph Meinel, Anna Slobodová
Lecture Notes in Computer Science 1200, 1997, pp. 213-224
On the classification of computable languages
John Case, Efim Kinber, Arun Sharma, Frank Stephan
Lecture Notes in Computer Science 1200, 1997, pp. 225-236
A conditional-logical approach to minimum cross-entropy
Gabriele Kern-Isberner
Lecture Notes in Computer Science 1200, 1997, pp. 237-248
Undecidability results on two-variable logics
Erich Grädel, Martin Otto, Eric Rosen
Lecture Notes in Computer Science 1200, 1997, pp. 249-260
Methods and applications of (max,+) linear algebra
Stéphane Gaubert, Max Plus
Lecture Notes in Computer Science 1200, 1997, pp. 261-282
Regular expressions and context-free grammars for picture languages
Oliver Matz
Lecture Notes in Computer Science 1200, 1997, pp. 283-294
Measuring nondeterminism in pushdown automata
Jonathan Goldstine, Hing Leung, Detlev Wotschke
Lecture Notes in Computer Science 1200, 1997, pp. 295-306
On polynomially D-verbose sets
Arfst Nickelsen
Lecture Notes in Computer Science 1200, 1997, pp. 307-318

Seiten 1 2 >