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 YEAR=2014

• Alternating parity Krivine automata
  Florian Bruse
  Lecture Notes in Computer Science 8634, 2014, pp. 111-122
• Advances in parametric real-time reasoning
  Daniel Bundala, Joël Ouaknine
  Lecture Notes in Computer Science 8634, 2014, pp. 123-134
• Universal Lyndon words
  Arturo Carpi, Gabriele Fici, S̑tȇpán Holub, Jakub Oprs̑al, Marinella Sciortino
  Lecture Notes in Computer Science 8634, 2014, pp. 135-146
• Subword complexity and decomposition of the set of factors
  Julien Cassaigne, Anna E. Frid, Svetlana Puzynina, Luca Q. Zamboni
  Lecture Notes in Computer Science 8634, 2014, pp. 147-158
• Cyclic complexity of words
  Julien Cassaigne, Gabriele Fici, Marinella Sciortino, Luca Q. Zamboni
  Lecture Notes in Computer Science 8634, 2014, pp. 159-170
• Classifying recognizable infinitary trace languages using word automata
  Namit Chaturvedi, Marcus Gelderie
  Lecture Notes in Computer Science 8634, 2014, pp. 171-182
• Bounded variable logic, parameterized logarithmic space, and Savitch's theorem
  Yijia Chen, Moritz Müller
  Lecture Notes in Computer Science 8634, 2014, pp. 183-195
• An algebraic characterization of unary two-way transducers
  Christian Choffrut, Bruno Guillon
  Lecture Notes in Computer Science 8634, 2014, pp. 196-207
• Size-change abstraction and max-plus automata
  Thomas Colcombet, Laure Daviaud, Florian Zuleger
  Lecture Notes in Computer Science 8634, 2014, pp. 208-219
• Alternating vector addition systems with states
  Jean-Baptiste Courtois, Sylvain Schmitz
  Lecture Notes in Computer Science 8634, 2014, pp. 220-231
• Information rate of some classes of non-regular languages: An automata-theoretic approach
  Cewei Cui, Zhe Dang, Thomas R. Fischer, Oscar H. Ibarra
  Lecture Notes in Computer Science 8634, 2014, pp. 232-243
• Relating nominal and higher-order rewriting
  Jesús Domínguez, Maribel Fernández
  Lecture Notes in Computer Science 8634, 2014, pp. 244-255
• Expressivity and succinctness of order-invariant logics on depth-bounded structures
  Kord Eickmeyer, Michael Elberfeld, Frederik Harwath
  Lecture Notes in Computer Science 8634, 2014, pp. 256-266
• Two recursively inseparable problems for probabilistic automata
  Nathanaël Fijalkow, Hugo Gimbert, Florian Horn, Youssouf Oualhadj
  Lecture Notes in Computer Science 8634, 2014, pp. 267-278
• Monadic second-order logic with arbitrary monadic predicates
  Nathanaël Fijalkow, Charles Paperman
  Lecture Notes in Computer Science 8634, 2014, pp. 279-290
• Sampling from dense streams without penalty: Improved bounds for frequency moments and heavy hitters
  Vladimir Braverman, Gregory Vorsanger
  Lecture Notes in Computer Science 8591, 2014, pp. 13-24
• Normal form expressions of propositional projection temporal logic
  Zhenhua Duan, Cong Tian, Nan Zhang
  Lecture Notes in Computer Science 8591, 2014, pp. 84-93
• The range 1 query (R1Q) problem
  Michael A. Bender, Rezaul A. Chowdhury, Pramod Ganapathi, Samuel McCauley, Yuan Tang
  Lecture Notes in Computer Science 8591, 2014, pp. 116-128
• Competitive cost-savings in data stream management systems
  Christine Chung, Shenoda Guirguis, Anastasia Kurdia
  Lecture Notes in Computer Science 8591, 2014, pp. 129-140
• On the kernelization complexity of string problems
  Manu Basavaraju, Fahad Panolan, Ashutosh Rai, M.S. Ramanujan, Saket Saurabh
  Lecture Notes in Computer Science 8591, 2014, pp. 141-153
• Vertex cover gets faster and harder on low degree graphs
  Akanksha Agrawal, Sathish Govindarajan, Neeldhara Misra
  Lecture Notes in Computer Science 8591, 2014, pp. 179-190
• Diffuse reflection radius in a simple polygon
  Eli Fox-Epstein, Csaba D. Tóth, Andrew Winslow
  Lecture Notes in Computer Science 8591, 2014, pp. 239-250
• Fixed parameter tractable algorithms in combinatorial topology
  Benjamin A. Burton, William Pettersson
  Lecture Notes in Computer Science 8591, 2014, pp. 300-311
• Approximability of the minimum weighted doubly resolving set problem
  Xujin Chen, Changjun Wang
  Lecture Notes in Computer Science 8591, 2014, pp. 357-368
• Back-up 2-center on a path/tree/cycle/unicycle
  Binay Bhattacharya, Minati De, Tsunehiko Kameda, Sasanka Roy, Vladyslav Sokol, Zhao Song
  Lecture Notes in Computer Science 8591, 2014, pp. 417-428