Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=2285

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

Hyper-encryption and everlasting security
Yan Zong Ding, Michael O. Rabin
Lecture Notes in Computer Science 2285, 2002, pp. 1-26
Models and techniques for communication in dynamic networks
Christian Scheideler
Lecture Notes in Computer Science 2285, 2002, pp. 27-49
What is a theory?
Gilles Dowek
Lecture Notes in Computer Science 2285, 2002, pp. 50-64
A space lower bound for routing in trees
Pierre Fraigniaud, Cyril Gavoille
Lecture Notes in Computer Science 2285, 2002, pp. 65-75
Labeling schemes for dynamic tree networks
Amos Korman, David Peleg, Yoav Rodeh
Lecture Notes in Computer Science 2285, 2002, pp. 76-87
Tight bounds for the performance of Longest-in-System on DAGs
Micah Adler, Adi Rosén
Lecture Notes in Computer Science 2285, 2002, pp. 88-99
Approximate strong separation with application in fractional graph coloring and preemptive scheduling
Klaus Jansen
Lecture Notes in Computer Science 2285, 2002, pp. 100-111
Balanced coloring: Equally easy for all numbers of colors?
Benjamin Doerr
Lecture Notes in Computer Science 2285, 2002, pp. 112-120
The complexity of graph isomorphism for colored graphs with color classes of size 2 and 3
Johannes Köbler, Jacobo Torán
Lecture Notes in Computer Science 2285, 2002, pp. 121-132
On the complexity of generating maximal frequent and minimal infrequent sets
E. Boros, V. Gurvich, L. Khachiyan, K. Makono
Lecture Notes in Computer Science 2285, 2002, pp. 133-141
On dualization in products of forests
Khaled M. Elbassioni
Lecture Notes in Computer Science 2285, 2002, pp. 142-153
An asymptotic O(ln p/ln ln p)-approximation algorithm for the scheduling problem with duplication on large communication delay graphs
R. Lepere, C. Rapine
Lecture Notes in Computer Science 2285, 2002, pp. 154-165
Scheduling at twilight the easy way
Hannah Bast
Lecture Notes in Computer Science 2285, 2002, pp. 166-178
Complexity of multi-dimensional loop alignment
Alain Darte, Guillaume Huard
Lecture Notes in Computer Science 2285, 2002, pp. 179-191
A probabilistic 3-SAT algorithm further improved
Thomas Hofmeister, Uwe Schöning, Rainer Schuler, Osamu Watanabe
Lecture Notes in Computer Science 2285, 2002, pp. 192-202
The secret of selective game tree search, when using random-error evaluations
U. Lorenz, B. Monien
Lecture Notes in Computer Science 2285, 2002, pp. 203-214
Randomized acceleration of fundamental matrix computations
Victor Y. Pan
Lecture Notes in Computer Science 2285, 2002, pp. 215-226
Approximations for ATSP with parametrized triangle inequality
L. Sunil Chandran, L. Shankar Ram
Lecture Notes in Computer Science 2285, 2002, pp. 227-237
A new diagram from disks in the plane
Joachim Giesen, Matthias John
Lecture Notes in Computer Science 2285, 2002, pp. 238-249
Computing the maximum detour and spanning ratio of planar paths, trees, and cycles
Stefan Langerman, Pat Morin, Michael Soss
Lecture Notes in Computer Science 2285, 2002, pp. 250-261
On the parameterized intractability of Closest Substring and related problems
Michael R. Fellows, Jens Gramm, Rolf Niedermeier
Lecture Notes in Computer Science 2285, 2002, pp. 262-273
On the complexity of protein similarity search under mRNA structure constraints
Ralf Backofen, N.S. Narayanaswamyy, Firas Swidan
Lecture Notes in Computer Science 2285, 2002, pp. 274-286
Pure dominance constraints
Manuel Bodirsky, Martin Kutz
Lecture Notes in Computer Science 2285, 2002, pp. 287-298
Improved quantum communication complexity bounds for disjointness and equality
Peter Hyer, Ronald de Wolf
Lecture Notes in Computer Science 2285, 2002, pp. 299-310
On quantum computation with some restricted amplitudes
Harumichi Nishimura
Lecture Notes in Computer Science 2285, 2002, pp. 311-322

Seiten 1 2 3 >