19. FSTTCS 1999: Chennai, India
C. Pandu Rangan,
Venkatesh Raman,
Ramaswamy Ramanujam:
Foundations of Software Technology and Theoretical Computer Science, 19th Conference, Chennai, India, December 13-15, 1999, Proceedings. Lecture Notes in Computer Science 1738,
Springer 1999, ISBN
3-540-66836-5
Micha Sharir:
Recent Developments in the Theory of Arrangements of Surfaces. 1-20
Rolf Fagerberg:
The Complexity of Rebalancing a Binary Search Tree. 72-83
Christof Löding:
Optimal Bounds for Transformations of omega-Automata. 97-109 Thomas Wilke:
CTL+ is Exponentially more Succinct than CTL. 110-121
L. Sunil Chandran:
A High Girth Graph Construction and a Lower Bound for Hitting Set Size for Combinatorial Rectangles. 283-290
Seinosuke Toda:
Graph Isomorphism: Its Complexity and Algorithms (Abstract). 341
Martin Sauerhoff:
Computing with Restricted Nondeterminism: The Dependence of the OBDD Size on the Number of Nondeterministic Variables. 342-355 Detlef Sieling:
Lower Bounds for Linear Transformed OBDDs and FBDDs (Extende Abstract). 356-368
Michael Huth:
A Unifying Framework for Model Checking Labeled Kripke Structures, Modal Transition Systems and Interval Transition Systems. 369-380
FST&TCS - ISAAC Joint Session Talks
Kurt Mehlhorn:
The Engineering of some Bipartite Matching Programs. 446-449
maintained by

, founded at
