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 [2]	Hilfe

Suche: Series=LNCS AND Volume=4162

• Systems of equations over finite semigroups and the \#CSP dichotomy conjecture
  Ondȓej Klíma, Benoît Larose, Pascal Tesson
  Lecture Notes in Computer Science 4162, 2006, pp. 584-595
• Valiant's model: From exponential sums to exponential products
  Pascal Koiran, Sylvain Perifel
  Lecture Notes in Computer Science 4162, 2006, pp. 596-607
• A reachability algorithm for general Petri nets based on transition invariants
  Alexander E. Kostin
  Lecture Notes in Computer Science 4162, 2006, pp. 608-621
• Approximability of bounded occurrence Max Ones
  Fredrik Kuivinen
  Lecture Notes in Computer Science 4162, 2006, pp. 622-633
• Fast iterative arrays with restricted inter-cell communication: Constructions and decidability
  Martin Kutrib, Andreas Malcher
  Lecture Notes in Computer Science 4162, 2006, pp. 634-645
• Faster algorithm for bisimulation equivalence of normed context-free processes
  Sƚawomir Lasota, Wojciech Rytter
  Lecture Notes in Computer Science 4162, 2006, pp. 646-657
• Quantum weakly nondeterministic communication complexity
  François Le Gall
  Lecture Notes in Computer Science 4162, 2006, pp. 658-669
• Minimal chordal sense of direction and circulant graphs
  Rodrigo S.C. Leão, Valmir C. Barbosa
  Lecture Notes in Computer Science 4162, 2006, pp. 670-680
• Querying and embedding compressed texts
  Yury Lifshits, Markus Lohrey
  Lecture Notes in Computer Science 4162, 2006, pp. 681-692
• Lempel-Ziv dimension for Lempel-Ziv compression
  Maria Lopez-Valdes
  Lecture Notes in Computer Science 4162, 2006, pp. 693-703
• Characterizing Valiant's algebraic complexity classes
  Guillaume Malod, Natacha Portier
  Lecture Notes in Computer Science 4162, 2006, pp. 704-716
• The price of defense
  Marios Mavronicolas, Loizos Michael, Vicky Papadopoulou, Anna Philippou, Paul Spirakis
  Lecture Notes in Computer Science 4162, 2006, pp. 717-728
• The data complexity of MDatalog in basic modal logics
  Linh Anh Nguyen
  Lecture Notes in Computer Science 4162, 2006, pp. 729-740
• The complexity of counting functions with easy decision version
  Aris Pagourtzis, Stathis Zachos
  Lecture Notes in Computer Science 4162, 2006, pp. 741-752
• On non-interactive zero-knowledge proofs of knowledge in the shared random string model
  Giuseppe Persiano, Ivan Visconti
  Lecture Notes in Computer Science 4162, 2006, pp. 753-764
• Constrained minimum enclosing circle with center on a query line segment
  Sasanka Roy, Arindam Karmakar, Sandip Das, Subhas C. Nandy
  Lecture Notes in Computer Science 4162, 2006, pp. 765-776
• Hierarchical unambiguity
  Holger Spakowski, Rahul Tripathi
  Lecture Notes in Computer Science 4162, 2006, pp. 777-788
• An efficient algorithm finds noticeable trends and examples concerning the C̑erny conjecture
  A.N. Trahtman
  Lecture Notes in Computer Science 4162, 2006, pp. 789-800
• On genome evolution with innovation
  Damian Wójtowicz, Jerzy Tiuryn
  Lecture Notes in Computer Science 4162, 2006, pp. 801-811