Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=2607

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

Randomized jumplists: A jump-and-walk dictionary data structure
Hervé Brönnimann, Frédéric Cacals, Marianne Durand
Lecture Notes in Computer Science 2607, 2003, pp. 283-294
Complexity theoretical results on nondeterministic graph-driven read-once branching programs
Beate Bollig
Lecture Notes in Computer Science 2607, 2003, pp. 295-306
Randomness versus nondeterminism for read-once and read-k branching programs
Martin Sauerhoff
Lecture Notes in Computer Science 2607, 2003, pp. 307-318
Branch-width, parse trees, and monadic second-order logic for matroids
Petr Hlinȇný
Lecture Notes in Computer Science 2607, 2003, pp. 319-330
Algebraic characterizations of small classes of Boolean functions
Ricard Gavaldà, Denis Thérien
Lecture Notes in Computer Science 2607, 2003, pp. 331-342
On the difficulty of some shortest path problems
John Hershberger, Subhash Suri, Amit Bhosle
Lecture Notes in Computer Science 2607, 2003, pp. 343-354
Representing graph metrics with fewest edges
Tomas Feder, Adam Meyerson, Rajeev Motwani, Loc O'Callaghan, Rinap Panigrahy
Lecture Notes in Computer Science 2607, 2003, pp. 355-366
Computing shortest paths with uncertainty
T. Feder, R. Motwani, L. O'Callaghan, C. Olston, R. Panigrahy
Lecture Notes in Computer Science 2607, 2003, pp. 367-378
Solving order constraints in logarithmic space
Andrei Krokhin, Benoit Larose
Lecture Notes in Computer Science 2607, 2003, pp. 379-390
The inversion problem for computable linear operators
Vasco Brattka
Lecture Notes in Computer Science 2607, 2003, pp. 391-402
Algebras of minimal rank over arbitrary fields
Markus Bläser
Lecture Notes in Computer Science 2607, 2003, pp. 403-414
Evolutionary algorithms and the maximum matching problem
Oliver Giel, Ingo Wegener
Lecture Notes in Computer Science 2607, 2003, pp. 415-426
Alternative algorithms for counting all matchings in graphs
Piotr Sankowski
Lecture Notes in Computer Science 2607, 2003, pp. 427-438
Strong stability in the hospitals/residents problem
Robert W. Irving, David F. Manlove, Sandy Scott
Lecture Notes in Computer Science 2607, 2003, pp. 439-450
The inference problem for propositional circumscription of affine formulas is coNP-complete
Arnaud Durand, Miki Hermann
Lecture Notes in Computer Science 2607, 2003, pp. 451-462
Decidable theories of Cayley-graphs
Dietrich Kuske, Markus Lohrey
Lecture Notes in Computer Science 2607, 2003, pp. 463-474
The complexity of resolution with generalized symmetry rules
Stefan Szeider
Lecture Notes in Computer Science 2607, 2003, pp. 475-486
Colouring random graphs in expected polynomial time
Amin Coja-Oghlan, Anusch Taraz
Lecture Notes in Computer Science 2607, 2003, pp. 487-498
An information-theoretic upper bound of planar graphs using triangulation
Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse
Lecture Notes in Computer Science 2607, 2003, pp. 499-510
Finding large independent sets in polynomial expected time
Amin Coja-Oghlan
Lecture Notes in Computer Science 2607, 2003, pp. 511-522
Distributed soft path coloring
Peter Damaschke
Lecture Notes in Computer Science 2607, 2003, pp. 523-534
Competing provers yield improved Karp-Lipton collapse results
Jin-Yi Cai, Venkatesan T. Chakaravarthy, Lane A. Hemaspaandra, Mitsunori Ogihara
Lecture Notes in Computer Science 2607, 2003, pp. 535-546
One bit of advice
Harry Buhrman, Richard Chang, Lance Fortnow
Lecture Notes in Computer Science 2607, 2003, pp. 547-558
Strong reductions and immunity for exponential time
Marcus Schaefer, Frank Stephan
Lecture Notes in Computer Science 2607, 2003, pp. 559-570
The complexity of membership problems for circuits over sets of natural numbers
Pierre McKenzie, Klaus W. Wagner
Lecture Notes in Computer Science 2607, 2003, pp. 571-582

Seiten < 1 2 3 >