Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=3404

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

Automorphisms of finite rings and applications to complexity of problems
Manindra Agrawal, Nitin Saxena
Lecture Notes in Computer Science 3404, 2005, pp. 1-17
Algebraic generating functions in enumerative combinatorics and context-free languages
Mireille Bousquet-Mélou
Lecture Notes in Computer Science 3404, 2005, pp. 18-35
Algorithmics in exponential time
Uwe Schöning
Lecture Notes in Computer Science 3404, 2005, pp. 36-43
Worst-case and average-case approximations by simple randomized search heuristics
Carsten Witt
Lecture Notes in Computer Science 3404, 2005, pp. 44-56
Sampling sub-problems of heterogeneous max-cut problems and approximation algorithms
Petros Drineas, Ravi Kannan, Michael W. Mahoney
Lecture Notes in Computer Science 3404, 2005, pp. 57-68
Truthful approximation mechanisms for scheduling selfish related machines
Nir Andelman, Yossi Azar, Motti Sorani
Lecture Notes in Computer Science 3404, 2005, pp. 69-82
Counting in the two variable guarded logic with transitivity
Lidia Tendera
Lecture Notes in Computer Science 3404, 2005, pp. 83-96
The variable hierarchy of the \mu-calculus is strict
Dietmar Berwanger, Giacomo Lenzi
Lecture Notes in Computer Science 3404, 2005, pp. 97-109
The core of a countably categorical structure
Manuel Bodirsky
Lecture Notes in Computer Science 3404, 2005, pp. 110-120
How common can be universality for cellular automata?
Guillaume Theyssier
Lecture Notes in Computer Science 3404, 2005, pp. 121-132
Cellular automata: Real-time equivalence between one-dimensional neighborhoods
Victor Poupet
Lecture Notes in Computer Science 3404, 2005, pp. 133-144
On the decidability of temporal properties of probabilistic pushdown automata
Tomás̑ Brázdil, Antonín Kuc̑era, Oldȓich Straz̑ovský
Lecture Notes in Computer Science 3404, 2005, pp. 145-157
Deciding properties of contract-signing protocols
Detlef Kähler, Ralf Küsters, Thomas Wilke
Lecture Notes in Computer Science 3404, 2005, pp. 158-169
Polylog-time reductions decrease dot-depth
Christian Glaßer
Lecture Notes in Computer Science 3404, 2005, pp. 170-181
On the computational complexity of the forcing chromatic number
Frank Harary, Wolfgang Slany, Oleg Verbitsky
Lecture Notes in Computer Science 3404, 2005, pp. 182-193
More efficient queries in PCPs for NP and improved approximation hardness of maximum CSP
Lars Engebretsen, Jonas Holmerin
Lecture Notes in Computer Science 3404, 2005, pp. 194-205
Three optimal algorithms for balls of three colors
Zdenk Dvoȓák, Vít Jelínek, Daniel Král', Jan Kync̑l, Michael Saks
Lecture Notes in Computer Science 3404, 2005, pp. 206-217
Cost sharing and strategyproof mechanisms for set cover games
Xiang-Yang Li, Zheng Sun, Weizhao Wang
Lecture Notes in Computer Science 3404, 2005, pp. 218-230
On weighted balls-into-bins games
Petra Berenbrink, Tom Friedetzky, Zengjian Hu, Russell Martin
Lecture Notes in Computer Science 3404, 2005, pp. 231-243
Computing minimal multi-homogeneous Bézout numbers is hard
Gregorio Malajovich, Klaus Meer
Lecture Notes in Computer Science 3404, 2005, pp. 244-255
Dynamic complexity theory revisited
Volker Weber, Thomas Schwentick
Lecture Notes in Computer Science 3404, 2005, pp. 256-268
Parametric duality and kernelization: Lower bounds and upper bounds on kernel size
Jianer Chen, Henning Fernau, Iyad A. Kanj, Ge Xia
Lecture Notes in Computer Science 3404, 2005, pp. 269-280
Shortest monotone descent path problem in polyhedral terrain
Sasanka Roy, Sandip Das, Subhas C. Nandy
Lecture Notes in Computer Science 3404, 2005, pp. 281-292
Packet buffering: Randomization beats deterministic algorithms
Markus Schmidt
Lecture Notes in Computer Science 3404, 2005, pp. 293-304
Solving medium-density subset sum problems in expected polynomial time
Abraham D. Flaxman, Bartosz Przydatek
Lecture Notes in Computer Science 3404, 2005, pp. 305-314

Seiten 1 2 3 >