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=3153

• On NC^1 Boolean circuit composition of non-interactive perfect zero-knowledge
  Alfredo De Santis, Giovanni Di Crescenzo, Giuseppe Persiano
  Lecture Notes in Computer Science 3153, 2004, pp. 356-367
• All superlinear inverse schemes are coNP-hard
  Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
  Lecture Notes in Computer Science 3153, 2004, pp. 368-379
• The complexity of equivalence and isomorphism of systems of equations over finite groups
  Gustav Nordh
  Lecture Notes in Computer Science 3153, 2004, pp. 380-391
• Generation problems
  Elmar Böhler, Christian Glaßer, Bernhard Schwarz, Klaus Wagner
  Lecture Notes in Computer Science 3153, 2004, pp. 392-403
• One query reducibilities between partial information classes
  Sebastian Bab, Arfst Nickelsen
  Lecture Notes in Computer Science 3153, 2004, pp. 404-415
• A new dimension sensitive property for cellular automata
  Vincent Bernardi, Bruno Durand, Enrico Formenti, Jarkko Kari
  Lecture Notes in Computer Science 3153, 2004, pp. 416-426
• Captive cellular automata
  Guillaume Theyssier
  Lecture Notes in Computer Science 3153, 2004, pp. 427-438
• Simulating 3D cellular automata with 2D cellular automata
  Victor Poupet
  Lecture Notes in Computer Science 3153, 2004, pp. 439-450
• Graph exploration by a finite automaton
  Pierre Fraigniaud, David Ilcinkas, Guy Peer, Andrzej Pelc, David Peleg
  Lecture Notes in Computer Science 3153, 2004, pp. 451-462
• On polynomially time bounded symmetry of information
  Troy Lee, Andrei Romashchenko
  Lecture Notes in Computer Science 3153, 2004, pp. 463-475
• Scaled dimension and the Kolmogorov complexity of Turing-hard sets
  John M. Hitchcock, María López-Valdés, Elvira Mayordomo
  Lecture Notes in Computer Science 3153, 2004, pp. 476-487
• A geometric approach to parameterized algorithms for domination problems on planar graphs
  Henning Fernau, David Juedes
  Lecture Notes in Computer Science 3153, 2004, pp. 488-499
• Polynomial time approximation schemes and parameterized complexity
  Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia
  Lecture Notes in Computer Science 3153, 2004, pp. 500-512
• Epistemic foundation of the well-founded semantics over bilattices
  Yann Loyer, Umberto Straccia
  Lecture Notes in Computer Science 3153, 2004, pp. 513-524
• Structural model checking for communicating hierarchical machines
  Ruggero Lanotte, Andrea Maggiolo-Schettini, Adriano Peron
  Lecture Notes in Computer Science 3153, 2004, pp. 525-536
• Compositional verification: Decidability issues using graph substitutions
  Olivier Ly
  Lecture Notes in Computer Science 3153, 2004, pp. 537-549
• Event structures for resolvable conflict
  Rob van Glabbeek, Gordon Plotkin
  Lecture Notes in Computer Science 3153, 2004, pp. 550-561
• Optimal preemptive scheduling for general target functions
  Leah Epstein, Tamir Tassa
  Lecture Notes in Computer Science 3153, 2004, pp. 562-573
• The price of anarchy for polynomial social cost
  Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien
  Lecture Notes in Computer Science 3153, 2004, pp. 574-585
• Agent-based information handling in large networks
  Robert Elsässer, Ulf Lorenz, Thomas Sauerwald
  Lecture Notes in Computer Science 3153, 2004, pp. 586-598
• Approximating earliest arrival flows with flow-dependent transit times
  Nadine Baumann, Ekkehard Köhler
  Lecture Notes in Computer Science 3153, 2004, pp. 599-610
• A hierarchy of irreducible sofic shifts
  Marie-Pierre Béal, Francesca Fiorenzi, Dominique Perrin
  Lecture Notes in Computer Science 3153, 2004, pp. 611-622
• Membership and reachability problems for row-monomial transformations
  Alexei Lisitsa, Igor Potapov
  Lecture Notes in Computer Science 3153, 2004, pp. 623-634
• On pseudovarieties of semiring homomorphisms
  Libor Polák
  Lecture Notes in Computer Science 3153, 2004, pp. 635-647
• An algebraic generalization of \omega-regular languages
  Zoltán Ésik, Werner Kuich
  Lecture Notes in Computer Science 3153, 2004, pp. 648-659