Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Series=LNCS AND Volume=6199
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Compositionality in graph transformation
Arend Rensink
Lecture Notes in Computer Science
6199
, 2010, pp. 309-320
On
p
-optimal proof systems and logics for PTIME
Yijia Chen
,
Jörg Flum
Lecture Notes in Computer Science
6199
, 2010, pp. 321-332
Placing regenerators in optical networks to satisfy multiple sets of requests
George B. Mertzios
,
Ignasi Sau
,
Mordechai Shalom
,
Shmuel Zaks
Lecture Notes in Computer Science
6199
, 2010, pp. 333-344
Maximal decidable fragments of Halpern and Shoham's modal logic of intervals
Angelo Montanari
,
Gabriele Puppis
,
Pietro Sala
Lecture Notes in Computer Science
6199
, 2010, pp. 345-356
B and D are enough to make the Halpern-Shoham logic undecidable
Jerzy Marcinkowski
,
Jakub Michaliszyn
,
Emanuel Kieroński
Lecture Notes in Computer Science
6199
, 2010, pp. 357-368
Parameterized modal satisfiability
Antonis Achilleos
,
Michael Lampis
,
Valia Mitsou
Lecture Notes in Computer Science
6199
, 2010, pp. 369-380
Automata for coalgebras: An approach using predicate liftings
Gaëlle Fontaine
,
Raul Leal
,
Yde Venema
Lecture Notes in Computer Science
6199
, 2010, pp. 381-392
Resolving the complexity of some data privacy problems
Jeremiah Blocki
,
Ryan Williams
Lecture Notes in Computer Science
6199
, 2010, pp. 393-404
Private and continual release of statistics
T.-H. Hubert Chan
,
Elaine Shi
,
Dawn Song
Lecture Notes in Computer Science
6199
, 2010, pp. 405-417
Envy-free pricing in multi-item markets
Ning Chen
,
Xiaotie Deng
Lecture Notes in Computer Science
6199
, 2010, pp. 418-429
Contention resolution under selfishness
George Christodoulou
,
Katrina Ligett
,
Evangelia Pyrga
Lecture Notes in Computer Science
6199
, 2010, pp. 430-441
On the expressiveness of polyadic and synchronous communication in higher-order process calculi
Ivan Lanese
,
Jorge A. Pérez
,
Davide Sangiorgi
,
Alan Schmitt
Lecture Notes in Computer Science
6199
, 2010, pp. 442-453
On bisimilarity and substitution in presence of replication
Daniel Hirschkoff
,
Damien Pous
Lecture Notes in Computer Science
6199
, 2010, pp. 454-465
The downward-closure of Petri net languages
Peter Habermehl
,
Roland Meyer
,
Harro Wimmel
Lecture Notes in Computer Science
6199
, 2010, pp. 466-477
Reachability games on extended vector addition systems with states
Tomás̑ Brázdil
,
Petr Janc̑ar
,
Antonín Kuc̑era
Lecture Notes in Computer Science
6199
, 2010, pp. 478-489
Modelling mobility: A {\sl Discrete} revolution
Andrea E.F. Clementi
,
Angelo Monti
,
Riccardo Silvestri
Lecture Notes in Computer Science
6199
, 2010, pp. 490-501
Tell me where I am so I can meet you sooner - (Asynchronous rendezvous with location information)
Andrew Collins
,
Jurek Czyzowicz
,
Leszek Ga̧sieniec
,
Arnaud Labourel
Lecture Notes in Computer Science
6199
, 2010, pp. 502-514
Rendezvous of mobile agents without agreement on local orientation
Jérémie Chalopin
,
Shantanu Das
Lecture Notes in Computer Science
6199
, 2010, pp. 515-526
Probabilistic automata on finite words: Decidable and undecidable problems
Hugo Gimbert
,
Youssouf Oualhadj
Lecture Notes in Computer Science
6199
, 2010, pp. 527-538
Space-efficient scheduling of stochastically generated tasks
Tomás̑ Brázdil
,
Javier Esparza
,
Stefan Kiefer
,
Michael Luttenberger
Lecture Notes in Computer Science
6199
, 2010, pp. 539-550
Exponential lower bounds for policy iteration
John Fearnley
Lecture Notes in Computer Science
6199
, 2010, pp. 551-562
Regular temporal cost functions
Thomas Colcombet
,
Denis Kuperberg
,
Sylvain Lombardy
Lecture Notes in Computer Science
6199
, 2010, pp. 563-574
Model checking succinct and parametric one-counter automata
Stefan Göller
,
Christoph Haase
,
Joël Ouaknine
,
James Worrell
Lecture Notes in Computer Science
6199
, 2010, pp. 575-586
Pebble weighted automata and transitive closure logics
Benedikt Bollig
,
Paul Gastin
,
Benjamin Monmege
,
Marc Zeitoun
Lecture Notes in Computer Science
6199
, 2010, pp. 587-598
Energy parity games
Krishnendu Chatterjee
,
Laurent Doyen
Lecture Notes in Computer Science
6199
, 2010, pp. 599-610
Seiten
<
1
2