


default search action
17th FSTTCS 1997: Kharagpur, India
- S. Ramesh, G. Sivakumar:

Foundations of Software Technology and Theoretical Computer Science, 17th Conference, Kharagpur, India, December 18-20, 1997, Proceedings. Lecture Notes in Computer Science 1346, Springer 1997, ISBN 3-540-63876-8
Invited Talk 1
- Vijaya Ramachandran:

QSM: A General Purpose Shared-Memory Model for Parallel Computation. 1-5
Contributed Paper Session 1
- Tamal K. Dey, Arunabha Roy, Nimish R. Shah:

Approximating Geometric Domains through Topological Triangulations. 6-21 - Sanjeev Mahajan, Edgar A. Ramos, K. V. Subrahmanyam

:
Solving Some Discrepancy Problems in NC. 22-36 - K. Cirino, S. Muthukrishnan, N. S. Narayanaswamy, H. Ramesh:

Graph Editing to Bipartite Interval Graphs: Exact and Asymtotic Bounds. 37-53
Invited Talk 2
- Edmund M. Clarke:

Model Cheking. 54-56
Contributed Paper Session 2
- A. J. Kfoury:

Recursion Versus Iteration at Higher-Orders. 57-73 - Andrew D. Gordon, Paul D. Hankin, Søren B. Lassen:

Compilation and Equivalence of Imperative Objects. 74-87 - Massimo Marchiori:

On the Expressive Power of Rewriting. 88-102
Invited Talk 3
- Deepak Kapur, Mahadevan Subramaniam:

Mechanizing Verification of Arithmetic Circuits: SRT Division. 103-122
Contributed Paper Session 3
- Enrico Pontelli, Desh Ranjan, Gopal Gupta:

On the Complexity of Parallel Implementation of Logic Programs. 123-137 - Jia-Huai You, Li-Yan Yuan, Randy Goebel:

An Abductive Semantics for Disjunctive Logic Programs and Its Proof Procedure. 138-152
Contributed Paper Session 4
- Swarup Mohalik, Ramaswamy Ramanujam:

Assumption-Commitment in Automata. 153-168 - Sandeep S. Kulkarni, Anish Arora:

Compositional Design of Multitolerant Repetitive Byzantine Agreement. 169-183
Invited Talk 4
- Madhu Sudan:

Algorithmic Issues in Coding Theory. 184-199
Contributed Paper Session 5
- Anil Seth:

Sharper Results on the Expressive Power of Generalized Quantifiers. 200-219 - N. V. Vinodchandran:

Improved Lowness Results for Solvable Black-box Group Problems. 220-234 - Vikraman Arvind, Johannes Köbler:

On Resource-Bounded Measure and Pseudorandomness. 235-249
Invited Talk 5
- Moshe Y. Vardi:

Verification of Open Systems. 250-266
Contributed Paper Session 6
- Frank S. de Boer, Ulrich Hannemann, Willem P. de Roever:

Hoare-Style Compositional Proof Systems for Reactive Shared Variable Concurency. 267-283 - Kedar S. Namjoshi:

A Simple Characterization of Stuttering Bisimulation. 284-296
Contributed Paper Session 7
- Raymond Devillers, Hanna Klaudel, Robert-C. Riemann:

General Refinement for High Level Petri Nets. 297-311 - Catherine Dufourd, Alain Finkel:

Polynomial-Time Manz-One Reductions for Petri Nets. 312-326 - Burkhard Graves:

Computing Reachability Properties Hidden in Finite Net Unfoldings. 327-341

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














