Publications :: Search

Show venue

On this page you see the details of the selected venue.

Conference
Name:	STACS 98, 15th Annual Symposium on Theoretical Aspects of Computer Science, Paris, France, February 25-27, 1998, Proceedings 1998
DBLP:	db/conf/stacs/stacs98.html
Bookmark:

Below you find the publications assigned to this venue.

Show item 1 to 54 of 54  

Select a publication
Show	Title	Venue	Rating	Date
	Cristina Bazgan, Miklos Santha, Zsolt Tuza. On the Approximation of Finding A(nother) Hamilton Cycle in Cubic Hamilton Graphs (Extended Abstract).	STACS 98, 15th Annual Symposium on Theoretical Aspects of Computer Science, Paris, France, February 25-27, 1998, Proceedings 1998	(0)	1998
	Jan Behrens, Stephan Waack. Equivalence Test and Ordering Transformation for Parity-OBDDs of Different Variable Ordering.	STACS 98, 15th Annual Symposium on Theoretical Aspects of Computer Science, Paris, France, February 25-27, 1998, Proceedings 1998	(0)	1998
	Vikraman Arvind, Richard Beigel, Antoni Lozano. The Complexity of Modular Graph Automorphism.	STACS 98, 15th Annual Symposium on Theoretical Aspects of Computer Science, Paris, France, February 25-27, 1998, Proceedings 1998	(0)	1998
	Sergio De Agostino, Riccardo Silvestri. Bounded Size Dictionary Compression: SC	STACS 98, 15th Annual Symposium on Theoretical Aspects of Computer Science, Paris, France, February 25-27, 1998, Proceedings 1998	(0)	1998
	David A. Mix Barrington, Chi-Jen Lu, Peter Bro Miltersen, Sven Skyum. Searching Constant Width Mazes Captures the AC	STACS 98, 15th Annual Symposium on Theoretical Aspects of Computer Science, Paris, France, February 25-27, 1998, Proceedings 1998	(0)	1998
	Julian C. Bradfield. Simplifying the Modal Mu-Calculus Alternation Hierarchy.	STACS 98, 15th Annual Symposium on Theoretical Aspects of Computer Science, Paris, France, February 25-27, 1998, Proceedings 1998	(0)	1998
	Nader H. Bshouty, Lynn Burroughs. Massaging a Linear Programming Solution to Give a 2-Approximation for a Generalization of the Vertex Cover Problem.	STACS 98, 15th Annual Symposium on Theoretical Aspects of Computer Science, Paris, France, February 25-27, 1998, Proceedings 1998	(0)	1998
	Harry Buhrman, Dieter van Melkebeek, Kenneth W. Regan, D. Sivakumar, Martin Strauss. A Generalization of Resource-Bounded Measure, With an Application (Extended Abstract).	STACS 98, 15th Annual Symposium on Theoretical Aspects of Computer Science, Paris, France, February 25-27, 1998, Proceedings 1998	(0)	1998
	Peter Bürgisser. On the Structure of Valiant's Complexity Classes.	STACS 98, 15th Annual Symposium on Theoretical Aspects of Computer Science, Paris, France, February 25-27, 1998, Proceedings 1998	(0)	1998
	Cristian S. Calude, Peter Hertling, Bakhadyr Khoussainov, Yongge Wang. Recursively Enumerable Reals and Chaitin Omega Numbers.	STACS 98, 15th Annual Symposium on Theoretical Aspects of Computer Science, Paris, France, February 25-27, 1998, Proceedings 1998	(0)	1998
	Giovanni Di Crescenzo, Kouichi Sakurai, Moti Yung. Result-Indistinguishable Zero-Knowledge Proofs: Increased Power and Constant-Round Protocols.	STACS 98, 15th Annual Symposium on Theoretical Aspects of Computer Science, Paris, France, February 25-27, 1998, Proceedings 1998	(0)	1998
	Stéphane Demri, Ph. Schnoebelen. The Complexity of Propositional Linear Temporal Logics in Simple Cases (Extended Abstract).	STACS 98, 15th Annual Symposium on Theoretical Aspects of Computer Science, Paris, France, February 25-27, 1998, Proceedings 1998	(0)	1998
	Anders Dessmark, Andrzej Lingas, Hans Olsson, Hiroaki Yamamoto. Optimal Broadcasting in Almost Trees and Partial k-trees.	STACS 98, 15th Annual Symposium on Theoretical Aspects of Computer Science, Paris, France, February 25-27, 1998, Proceedings 1998	(0)	1998
	Mohamadou Diallo, Afonso Ferreira, Andrew Rau-Chaplin. Communication-Efficient Deterministic Parallel Algorithms for Planar Point Location and 2d Voronoi Diagram.	STACS 98, 15th Annual Symposium on Theoretical Aspects of Computer Science, Paris, France, February 25-27, 1998, Proceedings 1998	(0)	1998
	Marius Dorkenoo, Marie-Christine Eglin-Leclerc, Eric Rémila. Construction of Non-intersecting Colored Flows Through a Planar Cellular Figure.	STACS 98, 15th Annual Symposium on Theoretical Aspects of Computer Science, Paris, France, February 25-27, 1998, Proceedings 1998	(0)	1998
	Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino. On Disguised Double Horn Functions and Extensions.	STACS 98, 15th Annual Symposium on Theoretical Aspects of Computer Science, Paris, France, February 25-27, 1998, Proceedings 1998	(0)	1998
	Zoltán Ésik. Axiomatizing the Equational Theory of Regular Tree Languages (Extended Anstract).	STACS 98, 15th Annual Symposium on Theoretical Aspects of Computer Science, Paris, France, February 25-27, 1998, Proceedings 1998	(0)	1998
	Joan Feigenbaum, Sampath Kannan, Moshe Y. Vardi, Mahesh Viswanathan. Complexity of Problems on Graphs Represented as OBDDs (Extended Abstract).	STACS 98, 15th Annual Symposium on Theoretical Aspects of Computer Science, Paris, France, February 25-27, 1998, Proceedings 1998	(0)	1998
	Lance Fortnow, Sophie Laplante. Nearly Optimal Language Compression Using Extractors.	STACS 98, 15th Annual Symposium on Theoretical Aspects of Computer Science, Paris, France, February 25-27, 1998, Proceedings 1998	(0)	1998
	Anna E. Frid. On Uniform DOL Words.	STACS 98, 15th Annual Symposium on Theoretical Aspects of Computer Science, Paris, France, February 25-27, 1998, Proceedings 1998	(0)	1998
	Martin Charles Golumbic, Haim Kaplan. Cell Flipping in Permutation Diagrams.	STACS 98, 15th Annual Symposium on Theoretical Aspects of Computer Science, Paris, France, February 25-27, 1998, Proceedings 1998	(0)	1998
	Clemens Gröpl, Hans Jürgen Prömel, Anand Srivastav. Size and Structure of Random Ordered Binary Decision Diagrams (Extended Abstract).	STACS 98, 15th Annual Symposium on Theoretical Aspects of Computer Science, Paris, France, February 25-27, 1998, Proceedings 1998	(0)	1998
	Jens Gustedt. Minimum Spanning Trees for Minor-Closed Graph Classes in Parallel.	STACS 98, 15th Annual Symposium on Theoretical Aspects of Computer Science, Paris, France, February 25-27, 1998, Proceedings 1998	(0)	1998
	Michel Habib, Christophe Paul, Laurent Viennot. A Synthesis on Partition Refinement: A Useful Routine for Strings, Graphs, Boolean Matrices and Automata.	STACS 98, 15th Annual Symposium on Theoretical Aspects of Computer Science, Paris, France, February 25-27, 1998, Proceedings 1998	(0)	1998
	Torben Hagerup. Sorting and Searching on the Word RAM.	STACS 98, 15th Annual Symposium on Theoretical Aspects of Computer Science, Paris, France, February 25-27, 1998, Proceedings 1998	(0)	1998
	Sergei Ivanov, Michel de Rougemont. Interactive Protocols on the Reals.	STACS 98, 15th Annual Symposium on Theoretical Aspects of Computer Science, Paris, France, February 25-27, 1998, Proceedings 1998	(0)	1998
	Klaus Jansen. The Mutual Exclusion Scheduling Problem for Permutation and Comparability Graphs.	STACS 98, 15th Annual Symposium on Theoretical Aspects of Computer Science, Paris, France, February 25-27, 1998, Proceedings 1998	(0)	1998
	Jeannette C. M. Janssen, Danny Krizanc, Lata Narayanan, Sunil M. Shende. Distributed Online Frequency Assignment in Cellular Networks.	STACS 98, 15th Annual Symposium on Theoretical Aspects of Computer Science, Paris, France, February 25-27, 1998, Proceedings 1998	(0)	1998
	Matthias Jantzen. Hierarchies of Principal Twist-Closed Trios.	STACS 98, 15th Annual Symposium on Theoretical Aspects of Computer Science, Paris, France, February 25-27, 1998, Proceedings 1998	(0)	1998
	Richard M. Karp. Random Graphs, Random Walks, Differential Equations and the Probabilistic Analysis of Algorithms.	STACS 98, 15th Annual Symposium on Theoretical Aspects of Computer Science, Paris, France, February 25-27, 1998, Proceedings 1998	(0)	1998
	Rainer Kemp. On the Expected Number of Nodes at Level k in 0-balanced Trees.	STACS 98, 15th Annual Symposium on Theoretical Aspects of Computer Science, Paris, France, February 25-27, 1998, Proceedings 1998	(0)	1998
	Sven Kosub, Heinz Schmitz, Heribert Vollmer. Uniformly Defining Complexity Classes of Functions.	STACS 98, 15th Annual Symposium on Theoretical Aspects of Computer Science, Paris, France, February 25-27, 1998, Proceedings 1998	(0)	1998
	Denis Lapoire. Recognizability Equals Monadic Second-Order Definability for Sets of Graphs of Bounded Tree-Width.	STACS 98, 15th Annual Symposium on Theoretical Aspects of Computer Science, Paris, France, February 25-27, 1998, Proceedings 1998	(0)	1998
	Kim S. Larsen. Partially Persistent Search Trees with Transcript Operations.	STACS 98, 15th Annual Symposium on Theoretical Aspects of Computer Science, Paris, France, February 25-27, 1998, Proceedings 1998	(0)	1998
	Jacques Mazoyer, Ivan Rapaport. Inducing an Order on Cellular Automata by a Grouping Operation.	STACS 98, 15th Annual Symposium on Theoretical Aspects of Computer Science, Paris, France, February 25-27, 1998, Proceedings 1998	(0)	1998
	Leonid Libkin, Limsoon Wong. Unary Quantifiers, Transitive Closure, and Relations of Large Degree.	STACS 98, 15th Annual Symposium on Theoretical Aspects of Computer Science, Paris, France, February 25-27, 1998, Proceedings 1998	(0)	1998
	Carlo Mereghetti, Giovanni Pighizzini. Optimal Simulations Between Unary Automata.	STACS 98, 15th Annual Symposium on Theoretical Aspects of Computer Science, Paris, France, February 25-27, 1998, Proceedings 1998	(0)	1998
	Jochen Messner, Jacobo Torán. Optimal Proof Systems for Propositional Logic and Complete Sets.	STACS 98, 15th Annual Symposium on Theoretical Aspects of Computer Science, Paris, France, February 25-27, 1998, Proceedings 1998	(0)	1998
	Kamal Lodaya, Pascal Weil. Series-Parallel Posets: Algebra, Automata and Languages.	STACS 98, 15th Annual Symposium on Theoretical Aspects of Computer Science, Paris, France, February 25-27, 1998, Proceedings 1998	(0)	1998
	Raphaël Meyer, Antoine Petit. Expressive Completeness of LTrL on Finite Traces: An Algebraic Proof.	STACS 98, 15th Annual Symposium on Theoretical Aspects of Computer Science, Paris, France, February 25-27, 1998, Proceedings 1998	(0)	1998
	Christine Rüb. On Batcher's Merge Sorts as Parallel Sorting Algorithms.	STACS 98, 15th Annual Symposium on Theoretical Aspects of Computer Science, Paris, France, February 25-27, 1998, Proceedings 1998	(0)	1998
	Angelo Monti, Adriano Peron. A Logical Characterization of Systolic Languages.	STACS 98, 15th Annual Symposium on Theoretical Aspects of Computer Science, Paris, France, February 25-27, 1998, Proceedings 1998	(0)	1998
	Giovanni Manzini, Luciano Margara. Attractors of D-dimensional Linear Cellular Automata.	STACS 98, 15th Annual Symposium on Theoretical Aspects of Computer Science, Paris, France, February 25-27, 1998, Proceedings 1998	(0)	1998
	Alexandru Mateescu. Shuffle of omega-Words: Algebraic Aspects (Extended Abstract).	STACS 98, 15th Annual Symposium on Theoretical Aspects of Computer Science, Paris, France, February 25-27, 1998, Proceedings 1998	(0)	1998
	Damian Niwinski, Igor Walukiewicz. Relating Hierarchies of Word and Tree Automata.	STACS 98, 15th Annual Symposium on Theoretical Aspects of Computer Science, Paris, France, February 25-27, 1998, Proceedings 1998	(0)	1998
	Taoufik Safer. Radix Representations of Algebraic Number Fields and Finite Automata.	STACS 98, 15th Annual Symposium on Theoretical Aspects of Computer Science, Paris, France, February 25-27, 1998, Proceedings 1998	(0)	1998
	Thomas Schwentick, Klaus Barthelmann. Local Normal Forms for First-Order Logic with Applications to Games and Automata.	STACS 98, 15th Annual Symposium on Theoretical Aspects of Computer Science, Paris, France, February 25-27, 1998, Proceedings 1998	(0)	1998
	Martin Sauerhoff. Lower Bounds for Randomized Read-k-Times Branching Programs (Extended Abstract).	STACS 98, 15th Annual Symposium on Theoretical Aspects of Computer Science, Paris, France, February 25-27, 1998, Proceedings 1998	(0)	1998
	Maria J. Serna, Luca Trevisan, Fatos Xhafa. The (Parallel) Approximability of Non-Boolean Satisfiability Problems and Restricted Integer Programming.	STACS 98, 15th Annual Symposium on Theoretical Aspects of Computer Science, Paris, France, February 25-27, 1998, Proceedings 1998	(0)	1998
	Detlef Sieling. On the Existence of Polynomial Time Approximation Schemes for OBDD Minimization (Extended Abstract).	STACS 98, 15th Annual Symposium on Theoretical Aspects of Computer Science, Paris, France, February 25-27, 1998, Proceedings 1998	(0)	1998
	Joel H. Spencer, Katherine St. John. Random Sparse Bit Strings at the Threshold of Adjacency.	STACS 98, 15th Annual Symposium on Theoretical Aspects of Computer Science, Paris, France, February 25-27, 1998, Proceedings 1998	(0)	1998
	Howard Straubing. Languages Defined With Modular Counting Quantifiers (Extended Abstract).	STACS 98, 15th Annual Symposium on Theoretical Aspects of Computer Science, Paris, France, February 25-27, 1998, Proceedings 1998	(0)	1998
	Mikkel Thorup. Floats, Integers, and Single Source Shortest Paths.	STACS 98, 15th Annual Symposium on Theoretical Aspects of Computer Science, Paris, France, February 25-27, 1998, Proceedings 1998	(0)	1998
	Serge Vaudenay. Provable Security for Block Ciphers by Decorrelation.	STACS 98, 15th Annual Symposium on Theoretical Aspects of Computer Science, Paris, France, February 25-27, 1998, Proceedings 1998	(0)	1998

Your query returned 54 matches in the database.