Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=1279

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

The complexity class \Theta^p_2: Recent results and applications in AI and modal logic
Thomas Eiter, Georg Gottlob
Lecture Notes in Computer Science 1279, 1997, pp. 1-18
Proof systems for structured algebraic specifications: An overview
Rolf Hennicker, Martin Wirsing
Lecture Notes in Computer Science 1279, 1997, pp. 19-37
Average-case analysis via incompressibility
Ming Li, Paul Vitányi
Lecture Notes in Computer Science 1279, 1997, pp. 38-50
Locally computable enumerations
Antoni Mazurkiewicz
Lecture Notes in Computer Science 1279, 1997, pp. 51-66
The complexity of error-correcting codes
Daniel A. Spielman
Lecture Notes in Computer Science 1279, 1997, pp. 67-84
Stochastic analysis of dynamic processes
Eli Upfal
Lecture Notes in Computer Science 1279, 1997, pp. 85-92
k-k-sorting on the multi-mesh
Alfons Avermiddig, Manfred Kunde, Andre Osterloh
Lecture Notes in Computer Science 1279, 1997, pp. 93-104
Refinement of coloured Petri nets
Eike Best, Thomas Thielke
Lecture Notes in Computer Science 1279, 1997, pp. 105-116
Stratified Petri nets
Eric Badouel, Philippe Darondeau
Lecture Notes in Computer Science 1279, 1997, pp. 117-128
Distributed acyclic orientation of asynchronous anonymous networks
Antonio Calabrese
Lecture Notes in Computer Science 1279, 1997, pp. 129-137
Generalized rational relations and their logical difinability
Christian Choffrut, Leucio Guerra
Lecture Notes in Computer Science 1279, 1997, pp. 138-149
A note on broadcasting with linearly bounded transmission faults in constant degree networks
Krzysztof Ciebiera, Adam Malinowski
Lecture Notes in Computer Science 1279, 1997, pp. 150-156
Logics which capture complexity classes over the reals
Felipe Cucker, Klaus Meer
Lecture Notes in Computer Science 1279, 1997, pp. 157-167
Criteria to disprove context-freeness of collage languages
Frank Drewes, Hans-Jörg Kreowski, Denis Lapoire
Lecture Notes in Computer Science 1279, 1997, pp. 169-178
The subword complexity of fixed points of binary uniform morphisms
Anna E. Frid
Lecture Notes in Computer Science 1279, 1997, pp. 179-187
Efficient parallel computing with memory faults
Leszek Ga̧sieniec, Piotr Indyk
Lecture Notes in Computer Science 1279, 1997, pp. 188-197
Bounded concurrency
Damas P. Gruska
Lecture Notes in Computer Science 1279, 1997, pp. 198-209
Concerning the time bounds of existing shortest watchman route algortihms
Mikael Hammar, Bengt J. Nilsson
Lecture Notes in Computer Science 1279, 1997, pp. 210-221
Query order in the polynomial hierarchy
Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
Lecture Notes in Computer Science 1279, 1997, pp. 222-232
Polynomial time machines equipped with word problems over algebraic strutctures as their acceptance criteria
Ulrich Hertrampf
Lecture Notes in Computer Science 1279, 1997, pp. 233-244
Pattern-matching problems for 2-dimensional images described by finite automata
Juhani Karhumäki, Wojciech Plandowski, Wojciech Rytter
Lecture Notes in Computer Science 1279, 1997, pp. 245-256
The complexity of the coverability, the containment, and the equivalence problems for commutative semigroups
Ulla Koppenhagen, Ernst W. Mayr
Lecture Notes in Computer Science 1279, 1997, pp. 257-268
Contextual grammars with distributed catenation and shuffle
Manfred Kudlek, Solomon Marcus, Alexandru Mateescu
Lecture Notes in Computer Science 1279, 1997, pp. 269-280
A two-dimensional hierarchy for attributed tree transducers
Armin Kühnemann
Lecture Notes in Computer Science 1279, 1997, pp. 281-292
Synchronization of 1-way connected processors
Salvatore la Torre, Margherita Napoli, Mimmo Parente
Lecture Notes in Computer Science 1279, 1997, pp. 293-304

Seiten 1 2 >