Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=1563

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

Algorithms for selfish agents - Mechanism design for distributed computation
Noam Nisan
Lecture Notes in Computer Science 1563, 1999, pp. 1-15
The reduced genus of a multigraph
Patrice Ossona de Mendez
Lecture Notes in Computer Science 1563, 1999, pp. 16-31
Classifying discrete temporal properties
Thomas Wilke
Lecture Notes in Computer Science 1563, 1999, pp. 32-46
Circuit complexity of testing square-free numbers
Anna Bernasconi, Igor Shparlinski
Lecture Notes in Computer Science 1563, 1999, pp. 47-56
Relating branching program size and formula size over the full binary basis
Martin Sauerhoff, Ingo Wegener, Ralph Werchner
Lecture Notes in Computer Science 1563, 1999, pp. 57-67
Memory organization schemes for large shared data: A randomized solution for distributed memory machines
Alexander E. Andreev, Andrea E.F. Clementi, Paolo Penna, José D.P. Rolim
Lecture Notes in Computer Science 1563, 1999, pp. 68-77
The average time complexity to compute prefix functions in processor networks
Andreas Jakoby
Lecture Notes in Computer Science 1563, 1999, pp. 78-89
On the hardness of permanent
Jin-Yi Cai, A. Pavan, D. Sivakumar
Lecture Notes in Computer Science 1563, 1999, pp. 90-99
One-sided versus two-sided error in probabilistic computation
Harry Buhrman, Lance Fortnow
Lecture Notes in Computer Science 1563, 1999, pp. 100-109
An optimal competitive strategy for walking in streets
Christian Icking, Rolf Klein, Elmar Langetepe
Lecture Notes in Computer Science 1563, 1999, pp. 110-120
An optimal strategy for searching in unknown streets
Sven Schuierer, Ines Semrau
Lecture Notes in Computer Science 1563, 1999, pp. 121-131
Parallel searching on m rays
Mikael Hammar, Bengt J. Nilsson, Sven Schuierer
Lecture Notes in Computer Science 1563, 1999, pp. 132-142
A logical characterisation of linear time on nondeterministic Turing machines
Clemens Lautemann, Nicole Schweikardt, Thomas Schwentick
Lecture Notes in Computer Science 1563, 1999, pp. 143-152
Descriptive complexity of computable sequences
Bruno Durand, Alexander Shen, Nikolai Vereshagin
Lecture Notes in Computer Science 1563, 1999, pp. 153-162
Complexity of some problems in universal algebra
Clifford Bergman, Giora Slutzki
Lecture Notes in Computer Science 1563, 1999, pp. 163-172
New branchwidth territories
Ton Kloks, Jan Kratochvíl, Haiko Müller
Lecture Notes in Computer Science 1563, 1999, pp. 173-183
Balanced randomized tree splitting with applications to evolutionary tree constructions
Ming-Yang Kao, Andrzej Lingas, Anna Östlin
Lecture Notes in Computer Science 1563, 1999, pp. 184-196
Treewidth and minimum fill-in of weakly triangulated graphs
Vincent Bouchitté, Ioan Todinca
Lecture Notes in Computer Science 1563, 1999, pp. 197-206
Decidability and undecidability of marked PCP
Vesa Halava, Mika Hirvensalo, Ronald de Wolf
Lecture Notes in Computer Science 1563, 1999, pp. 207-216
On quadratic word equations
John Michael Robson, Volker Diekert
Lecture Notes in Computer Science 1563, 1999, pp. 217-226
Some undecidability results related to the star problem in trace monoids
Daniel Kirsten
Lecture Notes in Computer Science 1563, 1999, pp. 227-236
An approximation algorithm for Max p-Section
Gunnar Andersson
Lecture Notes in Computer Science 1563, 1999, pp. 237-247
Approximating bandwidth by mixing layouts of interval graphs
Dieter Kratsch, Lorna Stewart
Lecture Notes in Computer Science 1563, 1999, pp. 248-258
Linear time \frac{1}{2}-approximation algorithm for maximum weighted matching in general graphs
Robert Preis
Lecture Notes in Computer Science 1563, 1999, pp. 259-269
Extending downward collapse from 1-versus-2 queries to j-versus-j+1 queries
Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
Lecture Notes in Computer Science 1563, 1999, pp. 270-280

Seiten 1 2 3 >