Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=6756

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

Nondeterministic streaming string transducers
Rajeev Alur, Jyotirmoy V. Deshmukh
Lecture Notes in Computer Science 6756, 2011, pp. 1-20
An introduction to randomness extractors
Ronen Shaltiel
Lecture Notes in Computer Science 6756, 2011, pp. 21-41
Invitation to algorithmic uses of inclusion-exclusion
Thore Husfeldt
Lecture Notes in Computer Science 6756, 2011, pp. 42-59
On the relation between differential privacy and quantitative information flow
Mário S. Alvim, Miguel E. Andrés, Konstantinos Chatzikokolakis, Catuscia Palamidessi
Lecture Notes in Computer Science 6756, 2011, pp. 60-76
A 1.488 approximation algorithm for the uncapacitated facility location problem
Shi Li
Lecture Notes in Computer Science 6756, 2011, pp. 77-88
Rice's theorem for \mu-limit sets of cellular automata
Martin Delacourt
Lecture Notes in Computer Science 6756, 2011, pp. 89-100
Fault-tolerant compact routing schemes for general graphs
Shiri Chechik
Lecture Notes in Computer Science 6756, 2011, pp. 101-112
Local matching dynamics in social networks
Martin Hoefer
Lecture Notes in Computer Science 6756, 2011, pp. 113-124
Regular languages of words over countable linear orderings
Olivier Carton, Thomas Colcombet, Gabriele Puppis
Lecture Notes in Computer Science 6756, 2011, pp. 125-136
Algebraic independence and blackbox identity testing
Malte Beecken, Johannes Mittmann, Nitin Saxena
Lecture Notes in Computer Science 6756, 2011, pp. 137-148
A fragment of ML decidable by visibly pushdown automata
David Hopkins, Andrzej S. Murawski, C.-H. Luke Ong
Lecture Notes in Computer Science 6756, 2011, pp. 149-161
Krivine machines and higher-order schemes
S. Salvati, I. Walukiewicz
Lecture Notes in Computer Science 6756, 2011, pp. 162-173
Relating computational effects by \top\top-lifting
Shin-ya Katsumata
Lecture Notes in Computer Science 6756, 2011, pp. 174-185
Constructing differential categories and deconstructing categories of games
Jim Laird, Giulio Manzonetto, Guy McCusker
Lecture Notes in Computer Science 6756, 2011, pp. 186-197
Nondeterminism is essential in small 2FAs with few reversals
Christos A. Kapoutsis
Lecture Notes in Computer Science 6756, 2011, pp. 198-209
Isomorphism of regular trees and words
Markus Lohrey, Christian Mathissen
Lecture Notes in Computer Science 6756, 2011, pp. 210-221
On the capabilities of grammars, automata, and transducers controlled by monoids
Georg Zetzsche
Lecture Notes in Computer Science 6756, 2011, pp. 222-233
The cost of traveling between languages
Michael Benedikt, Gabriele Puppis, Cristian Riveros
Lecture Notes in Computer Science 6756, 2011, pp. 234-245
Emptiness and universality problems in timed automata with positive frequency
Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Amélie Stainer
Lecture Notes in Computer Science 6756, 2011, pp. 246-257
Büchi automata can have smaller quotients
Lorenzo Clemente
Lecture Notes in Computer Science 6756, 2011, pp. 258-270
Automata-based CSL model checking
Lijun Zhang, David N. Jansen, Flemming Nielson, Holger Hermanns
Lecture Notes in Computer Science 6756, 2011, pp. 271-282
A progress measure for explicit-state probabilistic model-checkers
Xin Zhang, Franck van Breugel
Lecture Notes in Computer Science 6756, 2011, pp. 283-294
Probabilistic bisimulation and simulation algorithms by abstract interpretation
Silvia Crafa, Francesco Ranzato
Lecture Notes in Computer Science 6756, 2011, pp. 295-306
On the semantics of Markov automata
Yuxin Deng, Matthew Hennessy
Lecture Notes in Computer Science 6756, 2011, pp. 307-318
Runtime analysis of probabilistic programs with unbounded recursion
Tomás̑ Brázdil, Stefan Kiefer, Antonín Kuc̑era, Ivana Hutaȓová Vaȓeková
Lecture Notes in Computer Science 6756, 2011, pp. 319-331

Seiten 1 2 3 >