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	Hilfe

Suche: Series=LNCS AND Volume=8634

• Measure properties of game tree languages
  Tomasz Gogacz, Henryk Michalewski, Matteo Mio, Michaƚ Skrzypczak
  Lecture Notes in Computer Science 8634, 2014, pp. 303-314
• On upper and lower bounds on the length of alternating towers
  S̑tȇpán Holub, Galina Jirásková, Tomás̑ Masopust
  Lecture Notes in Computer Science 8634, 2014, pp. 315-326
• {\sf L\textsuperscript {ax}F}: Side conditions and external evidence as monads
  Furio Honsell, Luigi Liquori, Ivan Scagnetto
  Lecture Notes in Computer Science 8634, 2014, pp. 327-339
• The monoid of queue actions
  Martin Huschenbett, Dietrich Kuske, Georg Zetzsche
  Lecture Notes in Computer Science 8634, 2014, pp. 340-351
• Undecidable properties of self-affine sets and multi-tape automata
  Timo Jolivet, Jarkko Kari
  Lecture Notes in Computer Science 8634, 2014, pp. 352-364
• Complexity and expressivity of uniform one-dimensional fragment with equality
  Emanuel Kieroński, Antti Kuusisto
  Lecture Notes in Computer Science 8634, 2014, pp. 365-376
• A unifying approach for multistack pushdown automata
  Salvatore La Torre, Margherita Napoli, Gennaro Parlato
  Lecture Notes in Computer Science 8634, 2014, pp. 377-389
• Definability and transformations for cost logics and automatic structures
  Martin Lang, Christof Löding, Amaldev Manuel
  Lecture Notes in Computer Science 8634, 2014, pp. 390-401
• Generalised Lyndon-Schützenberger equations
  Florin Manea, Mike Müller, Dirk Nowotka, Shinnosuke Seki
  Lecture Notes in Computer Science 8634, 2014, pp. 402-413
• Complexity of equivalence and learning for multiplicity tree automata
  Ines Marusic, James Worrell
  Lecture Notes in Computer Science 8634, 2014, pp. 414-425
• Monadic datalog and regular tree pattern queries
  Filip Mazowiecki, Filip Murlak, Adam Witkowski
  Lecture Notes in Computer Science 8634, 2014, pp. 426-437
• Model checking concurrent recursive programs using temporal logics
  Roy Mennicke
  Lecture Notes in Computer Science 8634, 2014, pp. 438-450
• Decidability of the interval temporal logic \mathsf{A\bar{A}B\bar{B}} over the rationals
  Angelo Montanari, Gabriele Puppis, Pietro Sala
  Lecture Notes in Computer Science 8634, 2014, pp. 451-463
• Reachability in pushdown register automata
  Andrzej S. Murawski, Steven J. Ramsay, Nikos Tzevelekos
  Lecture Notes in Computer Science 8634, 2014, pp. 464-473
• A generalization of the Łoś-Tarski preservation theorem over classes of finite structures
  Abhisekh Sankaran, Bharat Adsul, Supratik Chakraborty
  Lecture Notes in Computer Science 8634, 2014, pp. 474-485
• Determinising parity automata
  Sven Schewe, Thomas Varghese
  Lecture Notes in Computer Science 8634, 2014, pp. 486-498
• Tight bounds for complementing parity automata
  Sven Schewe, Thomas Varghese
  Lecture Notes in Computer Science 8634, 2014, pp. 499-510
• On infinite words determined by indexed languages
  Tim Smith
  Lecture Notes in Computer Science 8634, 2014, pp. 511-522
• A pumping lemma for two-way finite transducers
  Tim Smith
  Lecture Notes in Computer Science 8634, 2014, pp. 523-534
• Tractability frontier for dually-closed Ord-Horn quantified constraint satisfaction problems
  Michaƚ Wrona
  Lecture Notes in Computer Science 8634, 2014, pp. 535-546
• The dynamic descriptive complexity of k-clique
  Thomas Zeume
  Lecture Notes in Computer Science 8634, 2014, pp. 547-558