Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=6199

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

Informative labeling schemes
Pierre Fraigniaud
Lecture Notes in Computer Science 6199, 2010, pp. 1-1
Noetherian spaces in verification
Jean Goubault-Larrecq
Lecture Notes in Computer Science 6199, 2010, pp. 2-21
Towards a theory of time-bounded verification
Joël Ouaknine, James Worrell
Lecture Notes in Computer Science 6199, 2010, pp. 22-37
Physical algorithms
Roger Wattenhofer
Lecture Notes in Computer Science 6199, 2010, pp. 38-51
Optimal Zielonka-type construction of deterministic asynchronous automata
Blaise Genest, Hugo Gimbert, Anca Muscholl, Igor Walukiewicz
Lecture Notes in Computer Science 6199, 2010, pp. 52-63
Pumping and counting on the regular post embedding problem
Pierre Chambart, Philippe Schnoebelen
Lecture Notes in Computer Science 6199, 2010, pp. 64-75
Alternation removal in Büchi automata
Udi Boker, Orna Kupferman, Adin Rosenberg
Lecture Notes in Computer Science 6199, 2010, pp. 76-87
Linear orders in the pushdown hierarchy
Laurent Braud, Arnaud Carayol
Lecture Notes in Computer Science 6199, 2010, pp. 88-99
The serializability of network codes
Anna Blasiak, Robert Kleinberg
Lecture Notes in Computer Science 6199, 2010, pp. 100-114
How efficient can gossip be? (On the cost of resilient information exchange)
Dan Alistarh, Seth Gilbert, Rachid Guerraoui, Morteza Zadimoghaddam
Lecture Notes in Computer Science 6199, 2010, pp. 115-126
Efficient information exchange in the random phone-call model
Petra Berenbrink, Jurek Czyzowicz, Robert Elsässer, Leszek Ga̧sieniec
Lecture Notes in Computer Science 6199, 2010, pp. 127-138
An O(\log n)-competitive online centralized randomized packet-routing algorithm for lines
Guy Even, Moti Medina
Lecture Notes in Computer Science 6199, 2010, pp. 139-150
A topological approach to recognition
Mai Gehrke, Serge Grigorieff, Jean-Éric Pin
Lecture Notes in Computer Science 6199, 2010, pp. 151-162
On LR(k)-parsers of polynomial size
Norbert Blum
Lecture Notes in Computer Science 6199, 2010, pp. 163-174
On erasing productions in random context grammars
Georg Zetzsche
Lecture Notes in Computer Science 6199, 2010, pp. 175-186
Game semantics for call-by-value polymorphism
James Laird
Lecture Notes in Computer Science 6199, 2010, pp. 187-198
What is a pure functional?
Martin Hofmann, Aleksandr Karbyshev, Helmut Seidl
Lecture Notes in Computer Science 6199, 2010, pp. 199-210
Example-guided abstraction simplification
Roberto Giacobazzi, Francesco Ranzato
Lecture Notes in Computer Science 6199, 2010, pp. 211-222
Compositional closure for Bayes risk in probabilistic noninterference
Annabelle McIver, Larissa Meinicke, Carroll Morgan
Lecture Notes in Computer Science 6199, 2010, pp. 223-235
Asynchronous throughput-optimal routing in malicious networks
Paul Bunn, Rafail Ostrovsky
Lecture Notes in Computer Science 6199, 2010, pp. 236-248
Improved fault tolerance and secure computation on sparse networks
Nishanth Chandran, Juan Garay, Rafail Ostrovsky
Lecture Notes in Computer Science 6199, 2010, pp. 249-260
Sparse reliable graph backbones
Shiri Chechik, Yuval Emek, Boaz Patt-Shamir, David Peleg
Lecture Notes in Computer Science 6199, 2010, pp. 261-272
Approximation algorithms for diversified search ranking
Nikhil Bansal, Kamal Jain, Anna Kazeykina, Joseph (Seffi) Naor
Lecture Notes in Computer Science 6199, 2010, pp. 273-284
Rewriting measurement-based quantum computations with generalised flow
Ross Duncan, Simon Perdrix
Lecture Notes in Computer Science 6199, 2010, pp. 285-296
The compositional structure of multipartite quantum entanglement
Bob Coecke, Aleks Kissinger
Lecture Notes in Computer Science 6199, 2010, pp. 297-308

Seiten 1 2 >