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: Booktitle=Proceedings of the 31st International Symposium on Mathematical Foundations of Computer Science, MFCS'2006 (Star{\'a} Lesn{\'a}, Slovakia, August 28 - September 1, 2006)

• A core calculus for Scala type checking
  Vincent Cremet, François Garillot, Sergueï Lenglet, Martin Odersky
  Lecture Notes in Computer Science 4162, 2006, pp. 1-23
• Tree exploration with an oracle
  Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc
  Lecture Notes in Computer Science 4162, 2006, pp. 24-37
• Distributed data structures: A survey on informative labeling schemes
  Cyril Gavoille
  Lecture Notes in Computer Science 4162, 2006, pp. 38-38
• From deduction graphs to proof nets: Boxes and sharing in the graphical presentation of deductions
  Herman Geuvers, Iris Loeb
  Lecture Notes in Computer Science 4162, 2006, pp. 39-57
• The structure of tractable constraint satisfaction problems
  Martin Grohe
  Lecture Notes in Computer Science 4162, 2006, pp. 58-72
• On the representation of Kleene algebras with tests
  Dexter Kozen
  Lecture Notes in Computer Science 4162, 2006, pp. 73-83
• From three ideas in TCS to three applications in bioinformatics
  Ming Li
  Lecture Notes in Computer Science 4162, 2006, pp. 84-85
• Decompositions, partitions, and coverings with convex polygons and pseudo-triangles
  O. Aichholzer, C. Huemer, S. Kappes, B. Speckmann, C.D. Tóth
  Lecture Notes in Computer Science 4162, 2006, pp. 86-97
• Approximate shortest path queries on weighted polyhedral surfaces
  Lyudmil Aleksandrov, Hristo N. Djidjev, Hua Guo, Anil Maheshwari, Doron Nussbaum, Jörg-Rüdiger Sack
  Lecture Notes in Computer Science 4162, 2006, pp. 98-109
• A unified construction of the Glushkov, Follow, and Antimirov automata
  Cyril Allauzen, Mehryar Mohri
  Lecture Notes in Computer Science 4162, 2006, pp. 110-121
• Algebraic characterizations of unitary linear quantum cellular automata
  Pablo Arrighi
  Lecture Notes in Computer Science 4162, 2006, pp. 122-133
• A polynomial time Nilpotence test for Galois groups and related results
  V. Arvind, Piyush P. Kurur
  Lecture Notes in Computer Science 4162, 2006, pp. 134-145
• The multiparty communication complexity of exact-T: Improved bounds and new problems
  Richard Beigel, William Gasarch, James Glenn
  Lecture Notes in Computer Science 4162, 2006, pp. 146-156
• Crochemore factorization of Sturmian and other infinite words
  Jean Berstel, Alessandra Savelli
  Lecture Notes in Computer Science 4162, 2006, pp. 157-166
• Equations on partial words
  F. Blanchet-Sadri, D. Dakota Blair, Rebeca V. Lewis
  Lecture Notes in Computer Science 4162, 2006, pp. 167-178
• Concrete multiplicative complexity of symmetric functions
  Joan Boyar, René Peralta
  Lecture Notes in Computer Science 4162, 2006, pp. 179-189
• On the complexity of limit sets of cellular automata associated with probability measures
  Laurent Boyer, Victor Poupet, Guillaume Theyssier
  Lecture Notes in Computer Science 4162, 2006, pp. 190-201
• Coloring random 3-colorable graphs with non-uniform edge probabilities
  Ulrik Brandes, Jürgen Lerner
  Lecture Notes in Computer Science 4162, 2006, pp. 202-213
• The Kleene equality for graphs
  Arnaud Carayol, Didier Caucal
  Lecture Notes in Computer Science 4162, 2006, pp. 214-225
• On the repetition threshold for large alphabets
  Arturo Carpi
  Lecture Notes in Computer Science 4162, 2006, pp. 226-237
• Improved parameterized upper bounds for vertex cover
  Jianer Chen, Iyad A. Kanj, Ge Xia
  Lecture Notes in Computer Science 4162, 2006, pp. 238-249
• On comparing sums of square roots of small integers
  Qi Cheng
  Lecture Notes in Computer Science 4162, 2006, pp. 250-255
• A combinatorial approach to collapsing words
  A. Cherubini, P. Gawrychowski, A. Kisielewicz, B. Piochi
  Lecture Notes in Computer Science 4162, 2006, pp. 256-266
• Optimal linear arrangement of interval graphs
  Johanne Cohen, Fedor Fomin, Pinar Heggernes, Dieter Kratsch, Gregory Kucherov
  Lecture Notes in Computer Science 4162, 2006, pp. 267-279
• The Lempel-Ziv complexity of fixed points of morphisms
  Sorin Constantinescu, Lucian Ilie
  Lecture Notes in Computer Science 4162, 2006, pp. 280-291