Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=969

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

Scheduling parallel communication: The h-relation problem
Micah Adler, John W. Byers, Richard M. Karp
Lecture Notes in Computer Science 969, 1995, pp. 1-20
Decomposable structures, Boolean function representations, and optimization
Stefan Arnborg
Lecture Notes in Computer Science 969, 1995, pp. 21-36
The complexity of interval routing on random graphs
Michele Flammini, Jan van Leeuwen, Alberto Marchetti-Spaccamela
Lecture Notes in Computer Science 969, 1995, pp. 37-49
Bridging across the \log(n) space frontier
Viliam Geffert
Lecture Notes in Computer Science 969, 1995, pp. 50-65
Second order logic and the weak exponential hierarchies
Georg Gottlob, Nicola Leone, Helmut Veith
Lecture Notes in Computer Science 969, 1995, pp. 66-81
On the computing paradigm and computational complexity
Juris Hartmanis
Lecture Notes in Computer Science 969, 1995, pp. 82-92
Ranked structures in nonmonotonic reasoning and belief revision
Daniel Lehmann
Lecture Notes in Computer Science 969, 1995, pp. 93-93
Symbolic dynamics and finite automata
Dominique Perrin
Lecture Notes in Computer Science 969, 1995, pp. 94-104
Lower bounds for propositional proofs and independence results in bounded arithmetic
Alexander A. Razborov
Lecture Notes in Computer Science 969, 1995, pp. 105-105
Physics and the new computation
Paul Vitányi
Lecture Notes in Computer Science 969, 1995, pp. 106-128
Measure on P: Robustness of the notion
Eric Allender, Martin Strauss
Lecture Notes in Computer Science 969, 1995, pp. 129-138
Comparing counting classes for logspace, one-way logspace, and first-order
Hans-Jörg Burtschick
Lecture Notes in Computer Science 969, 1995, pp. 139-148
Automata that take advice
Carsten Damm, Markus Holzer
Lecture Notes in Computer Science 969, 1995, pp. 149-158
Nonuniform lower bounds for exponential time classes
Steven Homer, Sarah Mocas
Lecture Notes in Computer Science 969, 1995, pp. 159-168
On a quantitative notion of uniformity
Susanne Kaufmann, Martin Kummer
Lecture Notes in Computer Science 969, 1995, pp. 169-178
Separations by random oracles and ``Almost'' classes for generalized reducibilities
Wolfgang Merkle, Yongge Wang
Lecture Notes in Computer Science 969, 1995, pp. 179-190
On the complexity of finite memory policies for Markov decision processes
Danièle Beauquier, Dima Burago, Anatol Slissenko
Lecture Notes in Computer Science 969, 1995, pp. 191-200
Derandomization for sparse approximations and independent sets
Thomas Hofmeister, Hanno Lefmann
Lecture Notes in Computer Science 969, 1995, pp. 201-210
Asymptotically efficient in-place merging
Jyriki Katajainen, Tomi Pasanen, George Titan
Lecture Notes in Computer Science 969, 1995, pp. 211-220
The complexity of the falsifiability problem for pure implicational formulas
Peter Heusch
Lecture Notes in Computer Science 969, 1995, pp. 221-226
Strong lower bounds on the approximability of some NPO PB-complete maximization problems
Viggo Kann
Lecture Notes in Computer Science 969, 1995, pp. 227-236
Some typical properties of large AND/OR Boolean formulas
Hanno Lefmann, Petr Savický
Lecture Notes in Computer Science 969, 1995, pp. 237-246
The hedge: An efficient storage device for Turing machines with one head
Martin Hühne
Lecture Notes in Computer Science 969, 1995, pp. 247-256
Graph inference from a walk for trees of bounded degree 3 is NP-complete
Osamu Maruyama, Satoru Miyano
Lecture Notes in Computer Science 969, 1995, pp. 257-266
Honeycomb networks
Ivan Stojmenović
Lecture Notes in Computer Science 969, 1995, pp. 267-276

Seiten 1 2 3 >