Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=1450

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

Hypergraph traversal revisited: Cost measures and dynamic algorithms
Giorgio Ausiello, Giuseppe F. Italiano, Umberto Nanni
Lecture Notes in Computer Science 1450, 1998, pp. 1-16
Defining the Java virtual machine as platform for provably correct Java compilation
Egon Börger, Wolfram Schulte
Lecture Notes in Computer Science 1450, 1998, pp. 17-35
Towards a theory of recursive structures
David Harel
Lecture Notes in Computer Science 1450, 1998, pp. 36-53
Modularization and abstraction: The keys to practical formal verification
Yonit Kesten, Amir Pnueli
Lecture Notes in Computer Science 1450, 1998, pp. 54-71
On the role of time and space in neural computation
Wolfgang Maass
Lecture Notes in Computer Science 1450, 1998, pp. 72-83
From algorithms to working programs: On the use of program checking in LEDA
Kurt Mehlhorn, Stefan Näher
Lecture Notes in Computer Science 1450, 1998, pp. 84-93
Computationally-sound checkers
Silvio Micali
Lecture Notes in Computer Science 1450, 1998, pp. 94-116
Reasoning about the past
Mogens Nielsen
Lecture Notes in Computer Science 1450, 1998, pp. 117-128
Satisfiability - Algorithms and logic
Pavel Pudlák
Lecture Notes in Computer Science 1450, 1998, pp. 129-141
The joys of bisimulation
Colin Stirling
Lecture Notes in Computer Science 1450, 1998, pp. 142-151
Towards algorithmic explanation of mind evolution and functioning
Jiȓí Wiedermann
Lecture Notes in Computer Science 1450, 1998, pp. 152-166
Combinatorial hardness proofs for polynomial evaluation
Mikel Aldaz, Joos Heintz, Guillermo Matera, José L. Montaña, Luis M. Pardo
Lecture Notes in Computer Science 1450, 1998, pp. 167-175
Minimum propositional proof length is NP-hard to linearly approximate
Michael Alekhnovich, Sam Buss, Shlomo Moran, Toniann Pitassi
Lecture Notes in Computer Science 1450, 1998, pp. 176-184
Reconstructing polyatomic structures from discrete X-rays: NP-completeness proof for three atoms
Marek Chrobak, Christoph Dürr
Lecture Notes in Computer Science 1450, 1998, pp. 185-193
Locally explicit construction of Rödl's asymptotically good packings
Nikolai N. Kuzjurin
Lecture Notes in Computer Science 1450, 1998, pp. 194-202
Proof theory of fuzzy logics: Urquhart's C and related logics
Matthias Baaz, Agata Ciabattoni, Christian Fermüller, Helmut Veith
Lecture Notes in Computer Science 1450, 1998, pp. 203-212
Nonstochastic languages as projections of 2-tape quasideterministic languages
Richard Bonner, Rūsiņs̆ Freivalds, Jānis Lapiņs̆, Antra Lukjanska
Lecture Notes in Computer Science 1450, 1998, pp. 213-219
Flow logic for imperative objects
Flemming Nielson, Hanne Riis Nielson
Lecture Notes in Computer Science 1450, 1998, pp. 220-228
Expressive completeness of temporal logic of action
Alexander Rabinovich
Lecture Notes in Computer Science 1450, 1998, pp. 229-238
Reducing AC-termination to termination
Maria C.F. Ferreira, Delia Kesner, Laurence Puel
Lecture Notes in Computer Science 1450, 1998, pp. 239-247
On one-pass term rewriting
Zoltán Fülöp, Eija Jurvanen, Magnus Steinby, Sándor Vágvölgyi
Lecture Notes in Computer Science 1450, 1998, pp. 248-256
On the word, subsumption, and complement problem for recurrent term schematizations
Miki Hermann, Gernot Salzer
Lecture Notes in Computer Science 1450, 1998, pp. 257-266
Encoding the hydra battle as a rewrite system
Hélène Touzet
Lecture Notes in Computer Science 1450, 1998, pp. 267-276
Computing \epsilon-free NFA from regular expressions in O(n\log^2(n)) time
Christian Hagenah, Anca Muscholl
Lecture Notes in Computer Science 1450, 1998, pp. 277-285
Iterated length-preserving rational transductions
Michel Latteux, David Simplot, Alain Terlutte
Lecture Notes in Computer Science 1450, 1998, pp. 286-295

Seiten 1 2 3 4 >