Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=5734

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

Four subareas of the theory of constraints, and their links
Albert Atserias
Lecture Notes in Computer Science 5734, 2009, pp. 1-1
Synchronization of regular automata
Didier Caucal
Lecture Notes in Computer Science 5734, 2009, pp. 2-23
Stochastic process creation
Javier Esparza
Lecture Notes in Computer Science 5734, 2009, pp. 24-33
Stochastic games with finitary objectives
Krishnendu Chatterjee, Thomas A. Henzinger, Florian Horn
Lecture Notes in Computer Science 5734, 2009, pp. 34-54
Stochastic data streams
S. Muthukrishnan
Lecture Notes in Computer Science 5734, 2009, pp. 55-55
Recent advances in population protocols
Ioannis Chatzigiannakis, Othon Michail, Paul G. Spirakis
Lecture Notes in Computer Science 5734, 2009, pp. 56-76
How to sort a train
Peter Widmayer
Lecture Notes in Computer Science 5734, 2009, pp. 77-77
Arithmetic circuits, monomial algebras and finite automata
Vikraman Arvind, Pushkar S. Joglekar
Lecture Notes in Computer Science 5734, 2009, pp. 78-89
An improved approximation bound for spanning star forest and color saving
Stavros Athanassopoulos, Ioannis Caragiannis, Christos Kaklamanis, Maria Kyropoulou
Lecture Notes in Computer Science 5734, 2009, pp. 90-101
Energy-efficient communication in multi-interface wireless networks
Stavros Athanassopoulos, Ioannis Caragiannis, Christos Kaklamanis, Evi Papaioannou
Lecture Notes in Computer Science 5734, 2009, pp. 102-111
Private capacities in mechanism design
Vincenzo Auletta, Paolo Penna, Giuseppe Persiano
Lecture Notes in Computer Science 5734, 2009, pp. 112-123
Towards a dichotomy of finding possible winners in elections based on scoring rules
Nadja Betzler, Britta Dorn
Lecture Notes in Computer Science 5734, 2009, pp. 124-136
Sampling edge covers in 3-regular graphs
Ivona Bezáková, William A. Rummler
Lecture Notes in Computer Science 5734, 2009, pp. 137-148
Balanced paths in colored graphs
Alessandro Bianco, Marco Faella, Fabio Mogavero, Aniello Murano
Lecture Notes in Computer Science 5734, 2009, pp. 149-161
Few product gates but many zeros
Bernd Borchert, Pierre McKenzie, Klaus Reinhardt
Lecture Notes in Computer Science 5734, 2009, pp. 162-174
Branching programs for tree evaluation
Mark Braverman, Stephen Cook, Pierre McKenzie, Rahul Santhanam, Dustin Wehr
Lecture Notes in Computer Science 5734, 2009, pp. 175-186
A dichotomy theorem for polynomial evaluation
Irénée Briquel, Pascal Koiran
Lecture Notes in Computer Science 5734, 2009, pp. 187-198
DP-complete problems derived from extremal NP-complete properties
Yi Cao, Joseph Culberson, Lorna Stewart
Lecture Notes in Computer Science 5734, 2009, pp. 199-210
The synchronization problem for locally strongly transitive automata
Arturo Carpi, Flavio DáAlessandro
Lecture Notes in Computer Science 5734, 2009, pp. 211-222
Constructing brambles
Mathieu Chapelle, Frédéric Mazoit, Ioan Todinca
Lecture Notes in Computer Science 5734, 2009, pp. 223-234
Self-indexed text compression using straight-line programs
Francisco Claude, Gonzalo Navarro
Lecture Notes in Computer Science 5734, 2009, pp. 235-246
Security and tradeoffs of the Akl-Taylor scheme and its variants
Paolo DáArco, Alfredo De Santis, Anna Lisa Ferrara, Barbara Masucci
Lecture Notes in Computer Science 5734, 2009, pp. 247-257
Parameterized complexity classes under logical reductions
Anuj Dawar, Yuguo He
Lecture Notes in Computer Science 5734, 2009, pp. 258-269
The communication complexity of non-signaling distributions
Julien Degorre, Marc Kaplan, Sophie Laplante, Jérémie Roland
Lecture Notes in Computer Science 5734, 2009, pp. 270-281
How to use spanning trees to navigate in graphs
Feodor F. Dragan, Yang Xiang
Lecture Notes in Computer Science 5734, 2009, pp. 282-294

Seiten 1 2 3 >