Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=5162

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

One useful logic that defines its own truth
Andreas Blass, Yuri Gurevich
Lecture Notes in Computer Science 5162, 2008, pp. 1-15
On synchronous and asynchronous interaction in distributed systems
Rob van Glabbeek, Ursula Goltz, Jens-Wolfhard Schicke
Lecture Notes in Computer Science 5162, 2008, pp. 16-35
A robust class of regular languages
Antonio Cano Gómez, Jean-Éric Pin
Lecture Notes in Computer Science 5162, 2008, pp. 36-51
Deterministic models of communication faults
Rastislav Královic̑, Richard Královic̑
Lecture Notes in Computer Science 5162, 2008, pp. 52-67
Algebraic graph algorithms
Piotr Sankowski
Lecture Notes in Computer Science 5162, 2008, pp. 68-82
Question/answer games on towers and pyramids
Sarmad Abbasi, Numan Sheikh
Lecture Notes in Computer Science 5162, 2008, pp. 83-95
The maximum independent set problem in planar graphs
Vladimir Alekseev, Vadim Lozin, Dmitriy Malyshev, Martin Milanic̑
Lecture Notes in Computer Science 5162, 2008, pp. 96-107
When ignorance helps: Graphical multicast cost sharing games
Vittorio Bilò, Angelo Fanelli, Michele Flammini, Luca Moscardelli
Lecture Notes in Computer Science 5162, 2008, pp. 108-119
Shortest synchronizing strings for Huffman codes
Marek Tomasz Biskup
Lecture Notes in Computer Science 5162, 2008, pp. 120-131
Optimizing conjunctive queries over trees using schema information
Henrik Björklund, Wim Martens, Thomas Schwentick
Lecture Notes in Computer Science 5162, 2008, pp. 132-143
Clustering with partial information
Hans L. Bodlaender, Michael R. Fellows, Pinar Heggernes, Federico Mancini, Charis Papadopoulos, Frances Rosamond
Lecture Notes in Computer Science 5162, 2008, pp. 144-155
Reoptimization of the metric deadline TSP
Hans-Joachim Böckenhauer, Dennis Komm
Lecture Notes in Computer Science 5162, 2008, pp. 156-167
On the shortest linear straight-line program for computing linear forms
Joan Boyar, Philip Matthews, René Peralta
Lecture Notes in Computer Science 5162, 2008, pp. 168-179
Flip algorithm for segment triangulations
Mathieu Brévilliers, Nicolas Chevallier, Dominique Schmitt
Lecture Notes in Computer Science 5162, 2008, pp. 180-192
Computing sharp 2-factors in claw-free graphs
Hajo Broersma, Daniël Paulusma
Lecture Notes in Computer Science 5162, 2008, pp. 193-204
A 6/5-approximation algorithm for the maximum 3-cover problem
Ioannis Caragiannis, Gianpiero Monaco
Lecture Notes in Computer Science 5162, 2008, pp. 205-216
Positional strategies for higher-order pushdown parity games
Arnaud Carayol, Michaela Slaats
Lecture Notes in Computer Science 5162, 2008, pp. 217-228
Arthur and Merlin as oracles
Venkatesan T. Chakaravarthy, Sambuddha Roy
Lecture Notes in Computer Science 5162, 2008, pp. 229-240
A decision problem for ultimately periodic sets in non-standard numeration systems
Emilie Charlier, Michel Rigo
Lecture Notes in Computer Science 5162, 2008, pp. 241-252
Regional languages and tiling: A unifying approach to picture grammars
Alessandra Cherubini, Stefano Crespi Reghizzi, Matteo Pradella
Lecture Notes in Computer Science 5162, 2008, pp. 253-264
On a special class of primitive words
Elena Czeizler, Lila Kari, Shinnosuke Seki
Lecture Notes in Computer Science 5162, 2008, pp. 265-277
Complexity of data tree patterns over XML documents
Claire David
Lecture Notes in Computer Science 5162, 2008, pp. 278-289
A PTAS for the Sparsest Spanners problem on apex-minor-free graphs
Feodor F. Dragan, Fedor V. Fomin, Petr A. Golovach
Lecture Notes in Computer Science 5162, 2008, pp. 290-298
Computational complexity of perfect-phylogeny-related haplotyping problems
Michael Elberfeld, Till Tantau
Lecture Notes in Computer Science 5162, 2008, pp. 299-310
Sincere-strategy preference-based approval voting broadly resists control
Gábor Erdélyi, Markus Nowak, Jörg Rothe
Lecture Notes in Computer Science 5162, 2008, pp. 311-322

Seiten 1 2 >