Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=5162

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

Reversal-bounded counter machines revisited
Alain Finkel, Arnaud Sangnier
Lecture Notes in Computer Science 5162, 2008, pp. 323-334
Iterative compression and exact algorithms
Fedor V. Fomin, Serge Gaspers, Dieter Kratsch, Mathieu Liedloff, Saket Saurabh
Lecture Notes in Computer Science 5162, 2008, pp. 335-346
Complexity and limiting ratio of Boolean functions over implication
Hervé Fournier, Danièle Gardy, Antoine Genitrini, Bernhard Gittenberger
Lecture Notes in Computer Science 5162, 2008, pp. 347-362
Succinctness of regular expressions with interleaving, intersection and counting
Wouter Gelade
Lecture Notes in Computer Science 5162, 2008, pp. 363-374
Nilpotency and limit sets of cellular automata
Pierre Guillon, Gaétan Richard
Lecture Notes in Computer Science 5162, 2008, pp. 375-386
A note on k-colorability of P_5-free graphs
Chính T. Hoàng, Marcin Kamiński, Vadim Lozin, Joe Sawada, Xiao Shu
Lecture Notes in Computer Science 5162, 2008, pp. 387-394
Combinatorial bounds and algorithmic aspects of image matching under projective transformations
Christian Hundt, Maciej Liśkiewicz
Lecture Notes in Computer Science 5162, 2008, pp. 395-406
Lower bounds for syntactically multilinear algebraic branching programs
Maurice T. Jansen
Lecture Notes in Computer Science 5162, 2008, pp. 407-418
Periodicity and immortality in reversible computing
Jarkko Kari, Nicolas Ollinger
Lecture Notes in Computer Science 5162, 2008, pp. 419-430
Step-out ring signatures
Marek Klonowski, Łukasz Krzywiecki, Mirosƚaw Kutyƚowski, Anna Lauks
Lecture Notes in Computer Science 5162, 2008, pp. 431-442
The height of factorization forests
Manfred Kufleitner
Lecture Notes in Computer Science 5162, 2008, pp. 443-454
Arithmetic circuits, syntactic multilinearity, and the limitations of skew formulae
Meena Mahajan, B.V. Raghavendra Rao
Lecture Notes in Computer Science 5162, 2008, pp. 455-466
Smoothed analysis of binary search trees and quicksort under additive noise
Bodo Manthey, Till Tantau
Lecture Notes in Computer Science 5162, 2008, pp. 467-478
From \lambda-calculus to universal algebra and back
Giulio Manzonetto, Antonino Salibra
Lecture Notes in Computer Science 5162, 2008, pp. 479-490
A complete axiomatic system for a process-based spatial logic
Radu Mardare, Alberto Policriti
Lecture Notes in Computer Science 5162, 2008, pp. 491-502
Voronoi games on cycle graphs
Marios Mavronicolas, Burkhard Monien, Vicky G. Papadopoulou, Florian Schoppmann
Lecture Notes in Computer Science 5162, 2008, pp. 503-514
Colouring random empire trees
Andrew R. McGrae, Michele Zito
Lecture Notes in Computer Science 5162, 2008, pp. 515-526
A random oracle does not help extract the mutual information
Andrei Muchnik, Andrei Romashchenko
Lecture Notes in Computer Science 5162, 2008, pp. 527-538
Approximating independent set and coloring in random uniform hypergraphs
Kai Plociennik
Lecture Notes in Computer Science 5162, 2008, pp. 539-550
A new upper bound for Max-2-SAT: A graph-theoretic approach
Daniel Raible, Henning Fernau
Lecture Notes in Computer Science 5162, 2008, pp. 551-562
Directed percolation arising in stochastic cellular automata analysis
Damien Regnault
Lecture Notes in Computer Science 5162, 2008, pp. 563-574
Resolution width and cutting plane rank are incomparable
Mark Rhodes
Lecture Notes in Computer Science 5162, 2008, pp. 575-587
On the decidability of bounded valuedness for transducers
Jacques Sakarovitch, Rodrigo de Souza
Lecture Notes in Computer Science 5162, 2008, pp. 588-600
Monadic second order logic on graphs with local cardinality constraints
Stefan Szeider
Lecture Notes in Computer Science 5162, 2008, pp. 601-612
Short proofs of strong normalization
Aleksander Wojdyga
Lecture Notes in Computer Science 5162, 2008, pp. 613-623

Seiten < 1 2