%A Robert A. Kowalski
%T Logic for knowledge representation
%J Proceedings of the Fourth Conference on the
Foundations of Software Technology and Theoretical Computer Science
%C Bangalore, India
%D December 1984
%E Mathai Joseph
%E Rudrapatna Shyamasundar
%O published as Lecture Notes in Computer Science 181
by Springer-Verlag
%K fsttcs fsttcs4
%P 1-12

%A T.S.E. Maibaum
%A M.R. Sadler
%A P.A.S. Veloso
%T Logical specification and implementation
%J Proceedings of the Fourth Conference on the
Foundations of Software Technology and Theoretical Computer Science
%C Bangalore, India
%D December 1984
%E Mathai Joseph
%E Rudrapatna Shyamasundar
%O published as Lecture Notes in Computer Science 181
by Springer-Verlag
%K fsttcs fsttcs4
%P 13-30

%A R. Ramanujam
%A R.K. Shyamasundar
%T Process specification of logic programs
%J Proceedings of the Fourth Conference on the
Foundations of Software Technology and Theoretical Computer Science
%C Bangalore, India
%D December 1984
%E Mathai Joseph
%E Rudrapatna Shyamasundar
%O published as Lecture Notes in Computer Science 181
by Springer-Verlag
%K fsttcs fsttcs4
%P 31-43

%A Asis K. Goswami
%A L.M. Patnaik
%T Functional programming systems revisited
%J Proceedings of the Fourth Conference on the
Foundations of Software Technology and Theoretical Computer Science
%C Bangalore, India
%D December 1984
%E Mathai Joseph
%E Rudrapatna Shyamasundar
%O published as Lecture Notes in Computer Science 181
by Springer-Verlag
%K fsttcs fsttcs4
%P 44-59

%A Thomas J. Myers
%A A. Toni Cohen
%T Models and transformations for nondeterministic extensions
of functional programming
%J Proceedings of the Fourth Conference on the
Foundations of Software Technology and Theoretical Computer Science
%C Bangalore, India
%D December 1984
%E Mathai Joseph
%E Rudrapatna Shyamasundar
%O published as Lecture Notes in Computer Science 181
by Springer-Verlag
%K fsttcs fsttcs4
%P 60-88

%A M. Nielsen
%A P.S. Thiagarajan
%T Degrees of non-determinism and concurrency: a Petri net view
%J Proceedings of the Fourth Conference on the
Foundations of Software Technology and Theoretical Computer Science
%C Bangalore, India
%D December 1984
%E Mathai Joseph
%E Rudrapatna Shyamasundar
%O published as Lecture Notes in Computer Science 181
by Springer-Verlag
%K fsttcs fsttcs4
%P 89-117

%A N. Natarajan
%T A distributed algorithm for detecting communication deadlocks
%J Proceedings of the Fourth Conference on the
Foundations of Software Technology and Theoretical Computer Science
%C Bangalore, India
%D December 1984
%E Mathai Joseph
%E Rudrapatna Shyamasundar
%O published as Lecture Notes in Computer Science 181
by Springer-Verlag
%K fsttcs fsttcs4
%P 119-135

%A Samuya K. Debray
%A Ariel J. Frank
%A Scott A. Smolka
%T On the existence and construction of robust communication
protocols for unreliable channels
%J Proceedings of the Fourth Conference on the
Foundations of Software Technology and Theoretical Computer Science
%C Bangalore, India
%D December 1984
%E Mathai Joseph
%E Rudrapatna Shyamasundar
%O published as Lecture Notes in Computer Science 181
by Springer-Verlag
%K fsttcs fsttcs4
%P 136-151

%A Bhargab B. Bhattacharya
%A Suranjan Ghose
%A Bhabani P. Sinha
%A Pradip K. Srimani
%T Heuristic search approach to optimal routing in a distributed architecture
%J Proceedings of the Fourth Conference on the
Foundations of Software Technology and Theoretical Computer Science
%C Bangalore, India
%D December 1984
%E Mathai Joseph
%E Rudrapatna Shyamasundar
%O published as Lecture Notes in Computer Science 181
by Springer-Verlag
%K fsttcs fsttcs4
%P 152-164

%A Meurig Beynon
%T Replacement in monotone boolean networks: an algebraic perspective
%J Proceedings of the Fourth Conference on the
Foundations of Software Technology and Theoretical Computer Science
%C Bangalore, India
%D December 1984
%E Mathai Joseph
%E Rudrapatna Shyamasundar
%O published as Lecture Notes in Computer Science 181
by Springer-Verlag
%K fsttcs fsttcs4
%P 165-178
%K replacement rules, replaceability, computational equivalence

%A Stathis Zachos
%A Hans Heller
%T A new characterization of BPP
%J Proceedings of the Fourth Conference on the
Foundations of Software Technology and Theoretical Computer Science
%C Bangalore, India
%D December 1984
%E Mathai Joseph
%E Rudrapatna Shyamasundar
%O published as Lecture Notes in Computer Science 181
by Springer-Verlag
%K fsttcs fsttcs4
%P 179-187
%K probabilistic algorithms, polynomial time complexity classes,
oracles, polynomial hierarchies

%A Kamala Krithivasan
%A Anindya Das
%T Treating terminals as function values of time
%J Proceedings of the Fourth Conference on the
Foundations of Software Technology and Theoretical Computer Science
%C Bangalore, India
%D December 1984
%E Mathai Joseph
%E Rudrapatna Shyamasundar
%O published as Lecture Notes in Computer Science 181
by Springer-Verlag
%K fsttcs fsttcs4
%P 188-201
%K describing parquet deformations using grammars

%A Rohit Parikh
%T Logics of knowledge, games and dynamic logic
%J Proceedings of the Fourth Conference on the
Foundations of Software Technology and Theoretical Computer Science
%C Bangalore, India
%D December 1984
%E Mathai Joseph
%E Rudrapatna Shyamasundar
%O published as Lecture Notes in Computer Science 181
by Springer-Verlag
%K fsttcs fsttcs4
%P 202-222
%K non-monotonic logics of knowledge

%A Malcolm P. Atkinson
%A Ronald Morrison
%T Persistent first class procedures are enough
%J Proceedings of the Fourth Conference on the
Foundations of Software Technology and Theoretical Computer Science
%C Bangalore, India
%D December 1984
%E Mathai Joseph
%E Rudrapatna Shyamasundar
%O published as Lecture Notes in Computer Science 181
by Springer-Verlag
%K fsttcs fsttcs4
%P 223-240
%K applicative programming, information hiding, separate compilation

%A R. Studer
%T Abstraction concepts for modelling screen oriented dialogue interfaces
%J Proceedings of the Fourth Conference on the
Foundations of Software Technology and Theoretical Computer Science
%C Bangalore, India
%D December 1984
%E Mathai Joseph
%E Rudrapatna Shyamasundar
%O published as Lecture Notes in Computer Science 181
by Springer-Verlag
%K fsttcs fsttcs4
%P 241-258
%K menus, forms, windows, VDM

%A Rajiv Kane
%A Sartaj Sahni
%T VLSI systems for design rule checks
%J Proceedings of the Fourth Conference on the
Foundations of Software Technology and Theoretical Computer Science
%C Bangalore, India
%D December 1984
%E Mathai Joseph
%E Rudrapatna Shyamasundar
%O published as Lecture Notes in Computer Science 181
by Springer-Verlag
%K fsttcs fsttcs4
%P 259-278
%K rectilinear polygons, systolic algorithms

%A Christos Levcopolous
%A Andrzej Lingas
%T Bounds on the length of convex partitions of polygons
%J Proceedings of the Fourth Conference on the
Foundations of Software Technology and Theoretical Computer Science
%C Bangalore, India
%D December 1984
%E Mathai Joseph
%E Rudrapatna Shyamasundar
%O published as Lecture Notes in Computer Science 181
by Springer-Verlag
%K fsttcs fsttcs4
%P 279-296
%K complexity of algorithms

%A I.V. Ramakrishnan
%A P.J. Varman
%T On mapping cube graphs onto VLSI arrays
%J Proceedings of the Fourth Conference on the
Foundations of Software Technology and Theoretical Computer Science
%C Bangalore, India
%D December 1984
%E Mathai Joseph
%E Rudrapatna Shyamasundar
%O published as Lecture Notes in Computer Science 181
by Springer-Verlag
%K fsttcs fsttcs4
%P 296-316

%A S.K. Ghosh
%T A linear-time for determining the intersection type of two star polygons
%J Proceedings of the Fourth Conference on the
Foundations of Software Technology and Theoretical Computer Science
%C Bangalore, India
%D December 1984
%E Mathai Joseph
%E Rudrapatna Shyamasundar
%O published as Lecture Notes in Computer Science 181
by Springer-Verlag
%K fsttcs fsttcs4
%P 317-330
%O (Extended Abstract)

%A Gael N. Buckley
%A A. Silberschatz
%T Eliminating cascading rollback in structured databases
%J Proceedings of the Fourth Conference on the
Foundations of Software Technology and Theoretical Computer Science
%C Bangalore, India
%D December 1984
%E Mathai Joseph
%E Rudrapatna Shyamasundar
%O published as Lecture Notes in Computer Science 181
by Springer-Verlag
%K fsttcs fsttcs4
%P 331-343
%K transaction rollback

%A V.S. Lakshmanan
%A N. Chandrasekaran
%A C.E. Veni Madhavan
%T Recognition and top-down generation of beta-acyclic database schemes
%J Proceedings of the Fourth Conference on the
Foundations of Software Technology and Theoretical Computer Science
%C Bangalore, India
%D December 1984
%E Mathai Joseph
%E Rudrapatna Shyamasundar
%O published as Lecture Notes in Computer Science 181
by Springer-Verlag
%K fsttcs fsttcs4
%P 344-366

%A Sushil Jajodia
%T Universal and representative instances using unmarked nulls
%J Proceedings of the Fourth Conference on the
Foundations of Software Technology and Theoretical Computer Science
%C Bangalore, India
%D December 1984
%E Mathai Joseph
%E Rudrapatna Shyamasundar
%O published as Lecture Notes in Computer Science 181
by Springer-Verlag
%K fsttcs fsttcs4
%P 367-378
%K universal relations, databases

%A F. de\ Santis
%A M.I. Sessa
%T On some computational problems related to data base coding
%J Proceedings of the Fourth Conference on the
Foundations of Software Technology and Theoretical Computer Science
%C Bangalore, India
%D December 1984
%E Mathai Joseph
%E Rudrapatna Shyamasundar
%O published as Lecture Notes in Computer Science 181
by Springer-Verlag
%K fsttcs fsttcs4
%P 379
%O (Abstract only)

%A Bruno Poizat
%T Generic oracles
%J Proceedings of the Fourth Conference on the
Foundations of Software Technology and Theoretical Computer Science
%C Bangalore, India
%D December 1984
%E Mathai Joseph
%E Rudrapatna Shyamasundar
%O published as Lecture Notes in Computer Science 181
by Springer-Verlag
%K fsttcs fsttcs4
%P 380
%O (Abstract only)

%A C.E. Veni Madhavan
%T Approximation algorithm for maximum independent set in
planar triangle-free graphs
%J Proceedings of the Fourth Conference on the
Foundations of Software Technology and Theoretical Computer Science
%C Bangalore, India
%D December 1984
%E Mathai Joseph
%E Rudrapatna Shyamasundar
%O published as Lecture Notes in Computer Science 181
by Springer-Verlag
%K fsttcs fsttcs4
%P 381-392

%A Mireille Regnier
%T Grid file algorithms: an analysis in the biased case
%J Proceedings of the Fourth Conference on the
Foundations of Software Technology and Theoretical Computer Science
%C Bangalore, India
%D December 1984
%E Mathai Joseph
%E Rudrapatna Shyamasundar
%O published as Lecture Notes in Computer Science 181
by Springer-Verlag
%K fsttcs fsttcs4
%P 393-418
%K dynamic multi-key indexing schemes

%A A.K. Pal
%A A. Bagchi
%T On the mean weight balance factor of binary trees
%J Proceedings of the Fourth Conference on the
Foundations of Software Technology and Theoretical Computer Science
%C Bangalore, India
%D December 1984
%E Mathai Joseph
%E Rudrapatna Shyamasundar
%O published as Lecture Notes in Computer Science 181
by Springer-Verlag
%K fsttcs fsttcs4
%P 419-434

%A P. Gupta
%A G.P. Bhattacharjee
%T An efficient algorithm for random sampling without replacement
%J Proceedings of the Fourth Conference on the
Foundations of Software Technology and Theoretical Computer Science
%C Bangalore, India
%D December 1984
%E Mathai Joseph
%E Rudrapatna Shyamasundar
%O published as Lecture Notes in Computer Science 181
by Springer-Verlag
%K fsttcs fsttcs4
%P 435-442

%A Gadi Taubenfeld
%A Nissim Francez
%T Proof rules for communication abstractions
%J Proceedings of the Fourth Conference on the
Foundations of Software Technology and Theoretical Computer Science
%C Bangalore, India
%D December 1984
%E Mathai Joseph
%E Rudrapatna Shyamasundar
%O published as Lecture Notes in Computer Science 181
by Springer-Verlag
%K fsttcs fsttcs4
%P 443-465
%K verification, concurrent programming, deadlock, scripts, invariants

%A C.A.R. Hoare
%T The mathematics of programming
%J Proceedings of the Fifth Conference on the
Foundations of Software Technology and Theoretical Computer Science
%C New Delhi, India
%D December 1985
%E S.N. Maheshwari
%O published as Lecture Notes in Computer Science 206
by Springer-Verlag
%K fsttcs fsttcs5
%P 1-18

%A Gul Agha
%A Carl Hewitt
%T Concurrent programming using actors: exploiting large-scale parallelism
%J Proceedings of the Fifth Conference on the
Foundations of Software Technology and Theoretical Computer Science
%C New Delhi, India
%D December 1985
%E S.N. Maheshwari
%O published as Lecture Notes in Computer Science 206
by Springer-Verlag
%K fsttcs fsttcs5
%P 19-41

%A S. Ramesh
%A S.L. Mehndiratta
%T A new class of high level programs for distributed computing systems
%J Proceedings of the Fifth Conference on the
Foundations of Software Technology and Theoretical Computer Science
%C New Delhi, India
%D December 1985
%E S.N. Maheshwari
%O published as Lecture Notes in Computer Science 206
by Springer-Verlag
%K fsttcs fsttcs5
%P 42-72

%A Devendra Kumar
%T A class of termination detection algorithms for distributed computations
%J Proceedings of the Fifth Conference on the
Foundations of Software Technology and Theoretical Computer Science
%C New Delhi, India
%D December 1985
%E S.N. Maheshwari
%O published as Lecture Notes in Computer Science 206
by Springer-Verlag
%K fsttcs fsttcs5
%P 73-100

%A A. Marchetti-Spaccamela
%T New protocols for the election of a leader in a ring
%J Proceedings of the Fifth Conference on the
Foundations of Software Technology and Theoretical Computer Science
%C New Delhi, India
%D December 1985
%E S.N. Maheshwari
%O published as Lecture Notes in Computer Science 206
by Springer-Verlag
%K fsttcs fsttcs5
%P 101-115

%A Carlo Ghezzi
%A Dino Mandrioli
%A Antonio Tecchio
%T Program simplification via symbolic interpretation
%J Proceedings of the Fifth Conference on the
Foundations of Software Technology and Theoretical Computer Science
%C New Delhi, India
%D December 1985
%E S.N. Maheshwari
%O published as Lecture Notes in Computer Science 206
by Springer-Verlag
%K fsttcs fsttcs5
%P 116-128

%A Jieh Hsiang
%A Mandayam Srivas
%T Prolog-based inductive theorem proving
%J Proceedings of the Fifth Conference on the
Foundations of Software Technology and Theoretical Computer Science
%C New Delhi, India
%D December 1985
%E S.N. Maheshwari
%O published as Lecture Notes in Computer Science 206
by Springer-Verlag
%K fsttcs fsttcs5
%P 129-149

%A Dieter Armbruster
%T On the calling behaviour of procedures
%J Proceedings of the Fifth Conference on the
Foundations of Software Technology and Theoretical Computer Science
%C New Delhi, India
%D December 1985
%E S.N. Maheshwari
%O published as Lecture Notes in Computer Science 206
by Springer-Verlag
%K fsttcs fsttcs5
%P 150-161

%A Shankar M. Venkatesan
%T Approximation algorithms for planar matching
%J Proceedings of the Fifth Conference on the
Foundations of Software Technology and Theoretical Computer Science
%C New Delhi, India
%D December 1985
%E S.N. Maheshwari
%O published as Lecture Notes in Computer Science 206
by Springer-Verlag
%K fsttcs fsttcs5
%P 162-175

%A Chanderjit Bajaj
%T Geometric optimization and the polynomial hierarchy
%J Proceedings of the Fifth Conference on the
Foundations of Software Technology and Theoretical Computer Science
%C New Delhi, India
%D December 1985
%E S.N. Maheshwari
%O published as Lecture Notes in Computer Science 206
by Springer-Verlag
%K fsttcs fsttcs5
%P 176-195

%A Jack Veenstra
%A Narendra Ahuja
%T Deriving object octree from images
%J Proceedings of the Fifth Conference on the
Foundations of Software Technology and Theoretical Computer Science
%C New Delhi, India
%D December 1985
%E S.N. Maheshwari
%O published as Lecture Notes in Computer Science 206
by Springer-Verlag
%K fsttcs fsttcs5
%P 196-211

%A Zohar Manna
%A Richard Waldinger
%T Deduction with relation matching
%J Proceedings of the Fifth Conference on the
Foundations of Software Technology and Theoretical Computer Science
%C New Delhi, India
%D December 1985
%E S.N. Maheshwari
%O published as Lecture Notes in Computer Science 206
by Springer-Verlag
%K fsttcs fsttcs5
%P 212-224

%A Finn V. Jensen
%A Kim G. Larsen
%T Recursively defined domains and their induction principles
%J Proceedings of the Fifth Conference on the
Foundations of Software Technology and Theoretical Computer Science
%C New Delhi, India
%D December 1985
%E S.N. Maheshwari
%O published as Lecture Notes in Computer Science 206
by Springer-Verlag
%K fsttcs fsttcs5
%P 225-245

%A S. Khosia
%A T.S.E. Maibaum
%A M. Sadler
%T Large database specifications from small views
%J Proceedings of the Fifth Conference on the
Foundations of Software Technology and Theoretical Computer Science
%C New Delhi, India
%D December 1985
%E S.N. Maheshwari
%O published as Lecture Notes in Computer Science 206
by Springer-Verlag
%K fsttcs fsttcs5
%P 246-271

%A G. Venkatesh
%T A decision method for temporal logic based on resolution
%J Proceedings of the Fifth Conference on the
Foundations of Software Technology and Theoretical Computer Science
%C New Delhi, India
%D December 1985
%E S.N. Maheshwari
%O published as Lecture Notes in Computer Science 206
by Springer-Verlag
%K fsttcs fsttcs5
%P 272-289

%A Rani Siromoney
%A V. Rajkumnar Dare
%T A generalization of the Parikh vector for finite and infinite words
%J Proceedings of the Fifth Conference on the
Foundations of Software Technology and Theoretical Computer Science
%C New Delhi, India
%D December 1985
%E S.N. Maheshwari
%O published as Lecture Notes in Computer Science 206
by Springer-Verlag
%K fsttcs fsttcs5
%P 290-302

%A V.S. Lakshmanan
%A C.E. Veni Madhavan
%T The implication problem for functional and multivalued dependencies:
an algebraic approach
%J Proceedings of the Fifth Conference on the
Foundations of Software Technology and Theoretical Computer Science
%C New Delhi, India
%D December 1985
%E S.N. Maheshwari
%O published as Lecture Notes in Computer Science 206
by Springer-Verlag
%K fsttcs fsttcs5
%P 303-328

%A K. Vidyasankar
%T A simple characterization of database serializability
%J Proceedings of the Fifth Conference on the
Foundations of Software Technology and Theoretical Computer Science
%C New Delhi, India
%D December 1985
%E S.N. Maheshwari
%O published as Lecture Notes in Computer Science 206
by Springer-Verlag
%K fsttcs fsttcs5
%P 329-345

%A Vijay A. Saraswat
%T Partial correctness semantics for CP[\(da,|,&]
%J Proceedings of the Fifth Conference on the
Foundations of Software Technology and Theoretical Computer Science
%C New Delhi, India
%D December 1985
%E S.N. Maheshwari
%O published as Lecture Notes in Computer Science 206
by Springer-Verlag
%K fsttcs fsttcs5
%P 347-368

%A Eugene W. Stark
%T A proof technique for rely/guarantee properties
%J Proceedings of the Fifth Conference on the
Foundations of Software Technology and Theoretical Computer Science
%C New Delhi, India
%D December 1985
%E S.N. Maheshwari
%O published as Lecture Notes in Computer Science 206
by Springer-Verlag
%K fsttcs fsttcs5
%P 369-391

%A Glynn Winskel
%T A complete proof system for SCCS with model assertions
(extended abstract)
%J Proceedings of the Fifth Conference on the
Foundations of Software Technology and Theoretical Computer Science
%C New Delhi, India
%D December 1985
%E S.N. Maheshwari
%O published as Lecture Notes in Computer Science 206
by Springer-Verlag
%K fsttcs fsttcs5
%P 392-410

%A Arvind
%T Demand-driven evaluation on dataflow machine
(abstract only)
%J Proceedings of the Fifth Conference on the
Foundations of Software Technology and Theoretical Computer Science
%C New Delhi, India
%D December 1985
%E S.N. Maheshwari
%O published as Lecture Notes in Computer Science 206
by Springer-Verlag
%K fsttcs fsttcs5
%P 411

%A Jose M. Muta
%A Gopalakrishnan Vijayan
%T Design and implementation of a procedural VLSI layout system
%J Proceedings of the Fifth Conference on the
Foundations of Software Technology and Theoretical Computer Science
%C New Delhi, India
%D December 1985
%E S.N. Maheshwari
%O published as Lecture Notes in Computer Science 206
by Springer-Verlag
%K fsttcs fsttcs5
%P 412-427
%K ALI2

%A Kam Hoi Cheng
%A Sartaj Sahni
%T VLSI systems for matrix multiplication
%J Proceedings of the Fifth Conference on the
Foundations of Software Technology and Theoretical Computer Science
%C New Delhi, India
%D December 1985
%E S.N. Maheshwari
%O published as Lecture Notes in Computer Science 206
by Springer-Verlag
%K fsttcs fsttcs5
%P 428-456

%A S. Lakshmivarahan
%A Sudarshan K. Dhall
%T Parallel algorithms for solving certain classes of linear recurrences
%J Proceedings of the Fifth Conference on the
Foundations of Software Technology and Theoretical Computer Science
%C New Delhi, India
%D December 1985
%E S.N. Maheshwari
%O published as Lecture Notes in Computer Science 206
by Springer-Verlag
%K fsttcs fsttcs5
%P 457-476

%A Deepak D. Sherlekar
%A Shaunak Pawagi
%A I.V. Ramakrishnan
%T O(1) parallel time incremental graph algorithm
%J Proceedings of the Fifth Conference on the
Foundations of Software Technology and Theoretical Computer Science
%C New Delhi, India
%D December 1985
%E S.N. Maheshwari
%O published as Lecture Notes in Computer Science 206
by Springer-Verlag
%K fsttcs fsttcs5
%P 477-495

%A Dexter Kozen
%A Umesh V. Vazirani
%A Vijay V. Vazirani
%T NC algorithms for comparability graphs, interval graphs, and testing
for unique perfect matching
%J Proceedings of the Fifth Conference on the
Foundations of Software Technology and Theoretical Computer Science
%C New Delhi, India
%D December 1985
%E S.N. Maheshwari
%O published as Lecture Notes in Computer Science 206
by Springer-Verlag
%K fsttcs fsttcs5
%P 496-503

%A Victor Pan
%T Fast and efficient parallel algorithms
for the exact inversion of integer matrices
%J Proceedings of the Fifth Conference on the
Foundations of Software Technology and Theoretical Computer Science
%C New Delhi, India
%D December 1985
%E S.N. Maheshwari
%O published as Lecture Notes in Computer Science 206
by Springer-Verlag
%K fsttcs fsttcs5
%P 504-519

%A Dines Bjorner
%T A unifying concept for software development ?
%J Proceedings of the Sixth Conference on the
Foundations of Software Technology and Theoretical Computer Science
%C New Delhi, India
%D December 1986
%E Kesav V. Nori
%O published as Lecture Notes in Computer Science 241
by Springer-Verlag
%K fsttcs fsttcs6
%P 1-9

%A David S. Rosenblum
%A Sriram Sankar
%A David C. Luckham
%T Concurrent runtime checking of annotated Ada programs
%J Proceedings of the Sixth Conference on the
Foundations of Software Technology and Theoretical Computer Science
%C New Delhi, India
%D December 1986
%E Kesav V. Nori
%O published as Lecture Notes in Computer Science 241
by Springer-Verlag
%K fsttcs fsttcs6
%P 10-35

%A Amitabh Srivastava
%T Recovery of noncurrent variables
in source-level debugging of optimized code
%J Proceedings of the Sixth Conference on the
Foundations of Software Technology and Theoretical Computer Science
%C New Delhi, India
%D December 1986
%E Kesav V. Nori
%O published as Lecture Notes in Computer Science 241
by Springer-Verlag
%K fsttcs fsttcs6
%P 36-56

%A Sanjeev Kumar
%A V.M. Malhotra
%T Automatic retargetable code generation: a new technique
%J Proceedings of the Sixth Conference on the
Foundations of Software Technology and Theoretical Computer Science
%C New Delhi, India
%D December 1986
%E Kesav V. Nori
%O published as Lecture Notes in Computer Science 241
by Springer-Verlag
%K fsttcs fsttcs6
%P 57-80

%A S. Sridhar
%T An implementation of OBJ2:
an object-oriented language for abstract program specification
%J Proceedings of the Sixth Conference on the
Foundations of Software Technology and Theoretical Computer Science
%C New Delhi, India
%D December 1986
%E Kesav V. Nori
%O published as Lecture Notes in Computer Science 241
by Springer-Verlag
%K fsttcs fsttcs6
%P 81-95

%A Jean-Louis Lassez
%A Kimball Marriott
%T Explicit representation of terms defined by counter examples
%J Proceedings of the Sixth Conference on the
Foundations of Software Technology and Theoretical Computer Science
%C New Delhi, India
%D December 1986
%E Kesav V. Nori
%O published as Lecture Notes in Computer Science 241
by Springer-Verlag
%K fsttcs fsttcs6
%P 96-107

%A Vipin Kumar
%A Yow-Jian Lin
%T A framework for intelligent backtracking in logic programs
%J Proceedings of the Sixth Conference on the
Foundations of Software Technology and Theoretical Computer Science
%C New Delhi, India
%D December 1986
%E Kesav V. Nori
%O published as Lecture Notes in Computer Science 241
by Springer-Verlag
%K fsttcs fsttcs6
%P 108-123

%A Y.V. Srinivas
%A Rajeev Sangal
%T A generalization of Backus' FP
%J Proceedings of the Sixth Conference on the
Foundations of Software Technology and Theoretical Computer Science
%C New Delhi, India
%D December 1986
%E Kesav V. Nori
%O published as Lecture Notes in Computer Science 241
by Springer-Verlag
%K fsttcs fsttcs6
%P 124-143

%A Christos H. Papadimitriou
%T Shortest-path motion
%J Proceedings of the Sixth Conference on the
Foundations of Software Technology and Theoretical Computer Science
%C New Delhi, India
%D December 1986
%E Kesav V. Nori
%O published as Lecture Notes in Computer Science 241
by Springer-Verlag
%K fsttcs fsttcs6
%P 144-153

%A Jayaram Bhasker
%A Sartaj Sahni
%T Via assignment in single row routing
%J Proceedings of the Sixth Conference on the
Foundations of Software Technology and Theoretical Computer Science
%C New Delhi, India
%D December 1986
%E Kesav V. Nori
%O published as Lecture Notes in Computer Science 241
by Springer-Verlag
%K fsttcs fsttcs6
%P 154-176

%A Prakash Ramanan
%A Kazuhiro Tsuga
%T Average-case analysis of the modified harmonic algorithm
%J Proceedings of the Sixth Conference on the
Foundations of Software Technology and Theoretical Computer Science
%C New Delhi, India
%D December 1986
%E Kesav V. Nori
%O published as Lecture Notes in Computer Science 241
by Springer-Verlag
%K fsttcs fsttcs6
%P 177-192

%A Ravi Kannan
%A Laszlo Lovasz
%T Covering minima and lattice point free convex bodies
%J Proceedings of the Sixth Conference on the
Foundations of Software Technology and Theoretical Computer Science
%C New Delhi, India
%D December 1986
%E Kesav V. Nori
%O published as Lecture Notes in Computer Science 241
by Springer-Verlag
%K fsttcs fsttcs6
%P 193-213

%A V.S. Lakshmanan
%A C.E. Veni Madhavan
%T Binary decompositions and acyclic schemes
%J Proceedings of the Sixth Conference on the
Foundations of Software Technology and Theoretical Computer Science
%C New Delhi, India
%D December 1986
%E Kesav V. Nori
%O published as Lecture Notes in Computer Science 241
by Springer-Verlag
%K fsttcs fsttcs6
%P 214-238

%A D. Beauquier
%T Thin homogeneous sets of factors
%J Proceedings of the Sixth Conference on the
Foundations of Software Technology and Theoretical Computer Science
%C New Delhi, India
%D December 1986
%E Kesav V. Nori
%O published as Lecture Notes in Computer Science 241
by Springer-Verlag
%K fsttcs fsttcs6
%P 239-251

%A Joachim von\ zur\ Gathen
%T Irreducible polynomials over finite fields
%J Proceedings of the Sixth Conference on the
Foundations of Software Technology and Theoretical Computer Science
%C New Delhi, India
%D December 1986
%E Kesav V. Nori
%O published as Lecture Notes in Computer Science 241
by Springer-Verlag
%K fsttcs fsttcs6
%P 252-262
%O (extended abstract)

%A Ravi Kannan
%A Lyle A. McGeoch
%T Basis reduction and evidence for transcendence of certain numbers
%J Proceedings of the Sixth Conference on the
Foundations of Software Technology and Theoretical Computer Science
%C New Delhi, India
%D December 1986
%E Kesav V. Nori
%O published as Lecture Notes in Computer Science 241
by Springer-Verlag
%K fsttcs fsttcs6
%P 263-269

%A S.R. Goregaokar
%A S. Arun-Kumar
%T A characterization of message-passing
%J Proceedings of the Sixth Conference on the
Foundations of Software Technology and Theoretical Computer Science
%C New Delhi, India
%D December 1986
%E Kesav V. Nori
%O published as Lecture Notes in Computer Science 241
by Springer-Verlag
%K fsttcs fsttcs6
%P 270-287

%A Ajoy Kumar Datta
%A S. Ghosh
%T Modular synthesis of deadlock-free control structures
%J Proceedings of the Sixth Conference on the
Foundations of Software Technology and Theoretical Computer Science
%C New Delhi, India
%D December 1986
%E Kesav V. Nori
%O published as Lecture Notes in Computer Science 241
by Springer-Verlag
%K fsttcs fsttcs6
%P 288-318

%A Inder S. Gopal
%A Parviz Kermani
%T Distributed resource sharing in computer networks
%J Proceedings of the Sixth Conference on the
Foundations of Software Technology and Theoretical Computer Science
%C New Delhi, India
%D December 1986
%E Kesav V. Nori
%O published as Lecture Notes in Computer Science 241
by Springer-Verlag
%K fsttcs fsttcs6
%P 319-329

%A Rob Gerth
%A Liuba Shrira
%T On proving communication closedness of distributed layers
%J Proceedings of the Sixth Conference on the
Foundations of Software Technology and Theoretical Computer Science
%C New Delhi, India
%D December 1986
%E Kesav V. Nori
%O published as Lecture Notes in Computer Science 241
by Springer-Verlag
%K fsttcs fsttcs6
%P 330-343

%A H. Mohanty
%A G. P. Battacharjee
%T A distributed algorithm for edge-disjoint path problem
%J Proceedings of the Sixth Conference on the
Foundations of Software Technology and Theoretical Computer Science
%C New Delhi, India
%D December 1986
%E Kesav V. Nori
%O published as Lecture Notes in Computer Science 241
by Springer-Verlag
%K fsttcs fsttcs6
%P 344-361

%A Abha Moitra
%T Scheduling of hard real-time systems
%J Proceedings of the Sixth Conference on the
Foundations of Software Technology and Theoretical Computer Science
%C New Delhi, India
%D December 1986
%E Kesav V. Nori
%O published as Lecture Notes in Computer Science 241
by Springer-Verlag
%K fsttcs fsttcs6
%P 362-381

%A Dorit S. Hochbaum
%A David B. Shmoys
%T A polynomial approximation scheme for machine scheduling
on uniform processors: using the dual approximation approach
%J Proceedings of the Sixth Conference on the
Foundations of Software Technology and Theoretical Computer Science
%C New Delhi, India
%D December 1986
%E Kesav V. Nori
%O published as Lecture Notes in Computer Science 241
by Springer-Verlag
%K fsttcs fsttcs6
%P 382-393

%A Laszlo Lovasz
%T Connectivity algorithms using rubber bands
%J Proceedings of the Sixth Conference on the
Foundations of Software Technology and Theoretical Computer Science
%C New Delhi, India
%D December 1986
%E Kesav V. Nori
%O published as Lecture Notes in Computer Science 241
by Springer-Verlag
%K fsttcs fsttcs6
%P 394-411

%A Steven Homer
%T On simple and creative sets in NP
%J Proceedings of the Sixth Conference on the
Foundations of Software Technology and Theoretical Computer Science
%C New Delhi, India
%D December 1986
%E Kesav V. Nori
%O published as Lecture Notes in Computer Science 241
by Springer-Verlag
%K fsttcs fsttcs6
%P 412-425

%A Deepak Kapur
%A Paliath Narendran
%A Hantao Zhang
%T Complexity of sufficient-completeness
%P 426-442
%O (Preliminary version)

%A Umesh V. Vazirani
%A Vijay V. Vazirani
%T Sampling a population with a semi-random source
%J Proceedings of the Sixth Conference on the
Foundations of Software Technology and Theoretical Computer Science
%C New Delhi, India
%D December 1986
%E Kesav V. Nori
%O published as Lecture Notes in Computer Science 241
by Springer-Verlag
%K fsttcs fsttcs6
%P 443-452
%O (Extended abstract)

%A Alan Gibbons
%A Wojciech Rytter
%T An optimal parallel algorithm for dynamic expression evaluation
and its applications
%J Proceedings of the Sixth Conference on the
Foundations of Software Technology and Theoretical Computer Science
%C New Delhi, India
%D December 1986
%E Kesav V. Nori
%O published as Lecture Notes in Computer Science 241
by Springer-Verlag
%K fsttcs fsttcs6
%P 453-469

%A Victor Pan
%A John Reif
%T Extension of the parallel nested dissection algorithm
to path parallel problems
%J Proceedings of the Sixth Conference on the
Foundations of Software Technology and Theoretical Computer Science
%C New Delhi, India
%D December 1986
%E Kesav V. Nori
%O published as Lecture Notes in Computer Science 241
by Springer-Verlag
%K fsttcs fsttcs6
%P 470-487

%A Sanjay V. Rajopadhye
%A S. Purushothaman
%A Richard M. Fujimoto
%T On synthesizing systolic arrays
from recurrence equations with linear dependencies
%J Proceedings of the Sixth Conference on the
Foundations of Software Technology and Theoretical Computer Science
%C New Delhi, India
%D December 1986
%E Kesav V. Nori
%O published as Lecture Notes in Computer Science 241
by Springer-Verlag
%K fsttcs fsttcs6
%P 488-503

%A Rakesh M. Verma
%A T. Krishnaprasad
%A I.V. Ramakrishnan
%T An efficient parallel algorithm for term matching
%J Proceedings of the Sixth Conference on the
Foundations of Software Technology and Theoretical Computer Science
%C New Delhi, India
%D December 1986
%E Kesav V. Nori
%O published as Lecture Notes in Computer Science 241
by Springer-Verlag
%K fsttcs fsttcs6
%P 504-518