Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=8573

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

Symmetric groups and quotient complexity of Boolean operations
Jason Bell, Janusz Brzozowski, Nelma Moreira, Rogério Reis
Lecture Notes in Computer Science 8573, 2014, pp. 1-12
Handling infinitely branching WSTS
Michael Blondin, Alain Finkel, Pierre McKenzie
Lecture Notes in Computer Science 8573, 2014, pp. 13-25
Transducers with origin information
Mikoƚaj Bojańczyk
Lecture Notes in Computer Science 8573, 2014, pp. 26-37
Weak MSO+U with path quantifiers over infinite trees
Mikoƚaj Bojańczyk
Lecture Notes in Computer Science 8573, 2014, pp. 38-49
On the decidability of MSO+U on infinite trees
Mikoƚaj Bojańczyk, Tomasz Gogacz, Henryk Michalewski, Michaƚ Skrzypczak
Lecture Notes in Computer Science 8573, 2014, pp. 50-61
A coalgebraic foundation for coinductive union types
Marcello Bonsangue, Jurriaan Rot, Davide Ancona, Frank de Boer, Jan Rutten
Lecture Notes in Computer Science 8573, 2014, pp. 62-73
Turing degrees of limit sets of cellular automata
Alex Borello, Julien Cervelle, Pascal Vanier
Lecture Notes in Computer Science 8573, 2014, pp. 74-85
On the complexity of temporal-logic path checking
Daniel Bundala, Joël Ouaknine
Lecture Notes in Computer Science 8573, 2014, pp. 86-97
Parameterised linearisability
Andrea Cerone, Alexey Gotsman, Hongseok Yang
Lecture Notes in Computer Science 8573, 2014, pp. 98-109
Games with a weak adversary
Krishnendu Chatterjee, Laurent Doyen
Lecture Notes in Computer Science 8573, 2014, pp. 110-121
The complexity of ergodic mean-payoff games
Krishnendu Chatterjee, Rasmus Ibsen-Jensen
Lecture Notes in Computer Science 8573, 2014, pp. 122-133
Toward a structure theory of regular infinitary trace languages
Namit Chaturvedi
Lecture Notes in Computer Science 8573, 2014, pp. 134-145
Unary pushdown automata and straight-line programs
Dmitry Chistikov, Rupak Majumdar
Lecture Notes in Computer Science 8573, 2014, pp. 146-157
Robustness against power is PSpace-complete
Egor Derevenetc, Roland Meyer
Lecture Notes in Computer Science 8573, 2014, pp. 158-170
A Nivat theorem for weighted timed automata and weighted relative distance logic
Manfred Droste, Vitaly Perevoshchikov
Lecture Notes in Computer Science 8573, 2014, pp. 171-182
Computability in anonymous networks: Revocable vs. irrecovable outputs
Yuval Emek, Jochen Seidel, Roger Wattenhofer
Lecture Notes in Computer Science 8573, 2014, pp. 183-195
Coalgebraic weak bisimulation from recursive equations over monads
Sergey Goncharov, Dirk Pattinson
Lecture Notes in Computer Science 8573, 2014, pp. 196-207
Piecewise Boolean algebras and their domains
Chris Heunen
Lecture Notes in Computer Science 8573, 2014, pp. 208-219
Between linearizability and quiescent consistency: Quantitative quiescent consistency
Radha Jagadeesan, James Riely
Lecture Notes in Computer Science 8573, 2014, pp. 220-231
Bisimulation equivalence of first-order grammars
Petr Janc̑ar
Lecture Notes in Computer Science 8573, 2014, pp. 232-243
Context unification is in PSPACE
Artur Jeż
Lecture Notes in Computer Science 8573, 2014, pp. 244-255
Monodic fragments of probabilistic first-order logic
Jean Christoph Jung, Carsten Lutz, Sergey Goncharov, Lutz Schröder
Lecture Notes in Computer Science 8573, 2014, pp. 256-267
Stability and complexity of minimising probabilistic automata
Stefan Kiefer, Björn Wachter
Lecture Notes in Computer Science 8573, 2014, pp. 268-279
Kleene algebra with equations
Dexter Kozen, Konstantinos Mamouras
Lecture Notes in Computer Science 8573, 2014, pp. 280-292
All-instances termination of chase is undecidable
Tomasz Gogacz, Jerzy Marcinkowski
Lecture Notes in Computer Science 8573, 2014, pp. 293-304

Seiten 1 2 >