share record
persistent URL:
Bernd Gärtner , Emo Welzl : Linear Programming - Randomization and Abstract Frameworks. STACS 1996 : 669-687 share record
persistent URL:
Roberto Giacobazzi : "Optimal" Collecting Semantics for Analysis in a Hierarchy of Logic Program Semantics. STACS 1996 : 503-514 share record
persistent URL:
Arvind Gupta , Naomi Nishimura : Characterizing the Complexity of Subgraph Isomorphism for Graphs of Bounded Path-Width. STACS 1996 : 453-464 share record
persistent URL:
Tero Harju , Juhani Karhumäki , Daniel Krob : Remarks on Generalized Post Correspondence Problem. STACS 1996 : 39-48 share record
persistent URL:
Volker Heun , Ernst W. Mayr : Embedding Graphs with Bounded Treewidth into Optimal Hypercubes. STACS 1996 : 157-168 share record
persistent URL:
Thomas Hofmeister , Hanno Lefmann : A Combinatorial Design Approach to MAXCUT. STACS 1996 : 441-452 share record
persistent URL:
Piotr Indyk : On Word-Level Parallelism in Fault-Tolerant Computing. STACS 1996 : 193-204 share record
persistent URL:
Andreas Jakoby , Christian Schindelhauer : On the Complexity of Worst Case and Expected Time in a Circuit. STACS 1996 : 295-306 share record
persistent URL:
Pierre Kelsen : Ranking and Unranking Trees Using Regular Reductions. STACS 1996 : 581-592 share record
persistent URL:
Evangelos Kranakis , Danny Krizanc : Lower Bounds for Compact Routing (Extended Abstract). STACS 1996 : 529-540 share record
persistent URL:
Martin Kummer : On the Complexity of Random Strings (Extended Abstract). STACS 1996 : 25-36 share record
persistent URL:
Jens Lagergren : Hypothesis Testing in Perfect Phylogeny for a Bounded Number of Characters. STACS 1996 : 605-616 share record
persistent URL:
Jack H. Lutz : Observations on Measure and Lowness for DeltaP_2. STACS 1996 : 87-97 export record
dblp key:
conf/stacs/Marcinkowski96 share record
persistent URL:
Jerzy Marcinkowski : The 3 Frenchmen Method Proves Undecidability of the Uniform Boundedness for Single Recursive Rule Ternary DATALOG Programs. STACS 1996 : 427-438 share record
persistent URL:
Ueli M. Maurer : A Unified and Generalized Treatment of Authentification Theory. STACS 1996 : 387-398 share record
persistent URL:
Christoph Meinel , Stephan Waack : The "log Rank" Conjecture for Modular Communication Complexity. STACS 1996 : 619-630 share record
persistent URL:
Guy Melançon : Lyndon Factorization of Infinite Words. STACS 1996 : 147-154 share record
persistent URL:
Scott A. Mitchell : A Characterization of the Quadrilateral Meshes of a Surface Which Admit a Compatible Hexahedral Mesh of the Enclosed Volume. STACS 1996 : 465-476 share record
persistent URL:
Michel Morvan , Laurent Viennot : Parallel Comparability Graph Recognition and Modular Decomposition. STACS 1996 : 169-180 share record
persistent URL:
Vincent Schmitt : Flip-Flop Nets. STACS 1996 : 517-528 share record
persistent URL:
Thomas Schwentick : On Bijections vs. Unary Functions. STACS 1996 : 415-426 share record
persistent URL:
Joseph Sifakis , Sergio Yovine : Compositional Specification of Timed Systems (Extended Abstract). STACS 1996 : 347-359 share record
persistent URL:
Erika Tateishi , Osamu Maruyama , Satoru Miyano : Extracting Best Consensus Motifs from Positive and Negative Examples. STACS 1996 : 219-230 share record
persistent URL:
Igor Walukiewicz : Monadic Second Order Logic on Tree-Like Structures. STACS 1996 : 401-413 share record
persistent URL:
Claude Puech , Rüdiger Reischuk : STACS 96, 13th Annual Symposium on Theoretical Aspects of Computer Science, Grenoble, France, February 22-24, 1996, Proceedings. Lecture Notes in Computer Science 1046, Springer 1996 , ISBN 3-540-60922-9 [contents]