Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=4708

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

How to be fickle
Vas̑ek Chvátal
Lecture Notes in Computer Science 4708, 2007, pp. 1-1
Finite model theory on tame classes of structures
Anuj Dawar
Lecture Notes in Computer Science 4708, 2007, pp. 2-12
Minimum cycle bases in graphs algorithms and applications
Kurt Mehlhorn
Lecture Notes in Computer Science 4708, 2007, pp. 13-14
Hierarchies of infinite structures generated by pushdown automata and recursion schemes
C.-H.L. Ong
Lecture Notes in Computer Science 4708, 2007, pp. 15-21
Evolvability
Leslie G. Valiant
Lecture Notes in Computer Science 4708, 2007, pp. 22-43
Expander properties and the cover time of random intersection graphs
Sotiris E. Nikoletseas, Christoforos Raptopoulos, Paul G. Spirakis
Lecture Notes in Computer Science 4708, 2007, pp. 44-55
Uncover low degree vertices and minimise the mess: Independent sets in random regular graphs
William Duckworth, Michele Zito
Lecture Notes in Computer Science 4708, 2007, pp. 56-66
Transition graphs of rewriting systems over unranked trees
Christof Löding, Alex Spelten
Lecture Notes in Computer Science 4708, 2007, pp. 67-77
Rewriting conjunctive queries determined by views
Foto Afrati
Lecture Notes in Computer Science 4708, 2007, pp. 78-89
Approximation algorithms for the maximum internal spanning tree problem
Gábor Salamon
Lecture Notes in Computer Science 4708, 2007, pp. 90-102
New approximability results for 2-dimensional packing problems
Klaus Jansen, Roberto Solis-Oba
Lecture Notes in Computer Science 4708, 2007, pp. 103-114
On approximation of bookmark assignments
Yuichi Asahiro, Eiji Miyano, Toshihide Murata, Hirotaka Ono
Lecture Notes in Computer Science 4708, 2007, pp. 115-124
Height-deterministic pushdown automata
Dirk Nowotka, Jiȓí Srba
Lecture Notes in Computer Science 4708, 2007, pp. 125-134
Minimizing variants of visibly pushdown automata
Patrick Chervet, Igor Walukiewicz
Lecture Notes in Computer Science 4708, 2007, pp. 135-146
Linear circuits, two-variable logic and weakly blocked monoids
Christoph Behle, Andreas Krebs, Mark Mercer
Lecture Notes in Computer Science 4708, 2007, pp. 147-158
Combinatorial proof that subprojective constraint satisfaction problems are NP-complete
Jaroslav Nes̑etȓil, Mark Siggers
Lecture Notes in Computer Science 4708, 2007, pp. 159-170
NP by means of lifts and shadows
Gábor Kun, Jaroslav Nes̑etȓil
Lecture Notes in Computer Science 4708, 2007, pp. 171-181
The complexity of solitaire
Luc Longpré, Pierre McKenzie
Lecture Notes in Computer Science 4708, 2007, pp. 182-193
Adapting parallel algorithms to the W-stream model, with applications to graph problems
Camil Demetrescu, Bruno Escoffier, Gabriel Moruz, Andrea Ribichini
Lecture Notes in Computer Science 4708, 2007, pp. 194-205
Space-conscious compression
Travis Gagie, Giovanni Manzini
Lecture Notes in Computer Science 4708, 2007, pp. 206-217
Small alliances in graphs
Rodolfo Carvajal, Martín Matamala, Ivan Rapaport, Nicolas Schabanel
Lecture Notes in Computer Science 4708, 2007, pp. 218-227
The maximum solution problem on graphs
Peter Jonsson, Gustav Nordh, Johan Thapper
Lecture Notes in Computer Science 4708, 2007, pp. 228-239
What are iteration theories?
Jiȓí Adámek, Stefan Milius, Jiȓí Velebil
Lecture Notes in Computer Science 4708, 2007, pp. 240-252
Properties complementary to program self-reference
John Case, Samuel E. Moelius III
Lecture Notes in Computer Science 4708, 2007, pp. 253-263
Dobrushin conditions for systematic scan with block dynamics
Kasper Pedersen
Lecture Notes in Computer Science 4708, 2007, pp. 264-275

Seiten 1 2 3 >