default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID6th FSTTCS 1986: New Delhi, India
- Kesav V. Nori:
Foundations of Software Technology and Theoretical Computer Science, Sixth Conference, New Delhi, India, December 18-20, 1986, Proceedings. Lecture Notes in Computer Science 241, Springer 1986, ISBN 3-540-17179-7 - Dines Bjørner:
Software Development Graphs. A Unifying Concept for Software Development? 1-9
Session 1: Software Technology
- David S. Rosenblum, Sriram Sankar, David C. Luckham:
Concurrent Runtime Checking of Annotated Ada Programs. 10-35 - Amitabh Srivastava:
Recovery of Noncurrent Variables in Source-Level Debugging of Optimized Code. 36-56 - Vishv M. Malhotra
, Sanjeev Kumar:
Automatic Retargetable Code Generation: A New Technique. 57-80 - S. Sridhar:
An Implementation of OBJ2: An Object-Oriented Language for Abstract Program Specification. 81-95
Session 2: Logic Programming and Functional Programming
- Jean-Louis Lassez, Kim Marriott:
Explicit Representation of Terms Defined by Counter Examples. 96-107 - Vipin Kumar, Yow-Jian Lin:
A Framework for Intelligent Backtracking in Logic Programs. 108-123 - Yellamraju V. Srinivas, Rajeev Sangal:
A Generalization of Backus' FP. 124-143 - Christos H. Papadimitriou:
Shortest-Path Motion. 144-153
Session 3: Algorithms
- Jayaram Bhasker, Sartaj Sahni:
Via Assignment in Single Row Routing. 154-176 - Prakash V. Ramanan, Kazuhiro Tsuga:
Average-Case Analysis of the Modified Marmonic Algorithm. 177-192 - Ravi Kannan, László Lovász:
Covering Minima and Lattice Point Free Convex Bodies. 193-213
Session 4: Theory
- V. S. Lakshmanan, C. E. Veni Madhavan:
Binary Decompositions and Acyclic Schemes. 214-238 - Danièle Beauquier:
Thin Homogeneous Sets of Factors. 239-251 - Joachim von zur Gathen:
Irreducible Polynomials over Finite Fields. 252-262 - Ravi Kannan:
Basis Reduction and Evidence for Transcendence of Certain Numbers. 263-269
Session 5: Distributed Computing
- S. R. Goregaokar, S. Arun-Kumar:
A Characterization of Asynchronous Message-Passing. 270-287 - Ajoy Kumar Datta, Sukumar Ghosh:
Modular Synthesis of Deadlock-Free Control Structures. 288-318 - Inder S. Gopal, Parviz Kermani:
Distributed Resource Sharing in Computer Networks. 319-329 - Rob Gerth, Liuba Shrira:
On Proving Communication Closedness of Distributed Layers. 330-343 - Hrushikesha Mohanty, G. P. Bhattacharjee:
A Distributed Algorithm for Edge-Disjoint Path Problem. 344-361
Session 6: Scheduling
- Abha Moitra:
Scheduling of Hard Real-Time Systems. 362-381 - Dorit S. Hochbaum, David B. Shmoys:
A Polynomial Approximation Scheme for Machine Scheduling on Uniform Processors: Using the Dual Approximation Approach. 382-393 - László Lovász:
Connectivity Algorithms Using Rubber-bands. 394-411
Session 7: Complexity
- Steven Homer:
On Simple and Creative Sets in NP. 412-425 - Deepak Kapur, Paliath Narendran, Hantao Zhang:
Complexity of Sufficient-Completeness. 426-442 - Umesh V. Vazirani, Vijay V. Vazirani:
Sampling a Population with a Semi-Random Source. 443-452
Session 8: Parallel Algorithms
- Alan Gibbons, Wojciech Rytter:
An Optimal Parallel Algorithm for Dynamic Expression Evaluation and Its Applications. 453-469 - Victor Y. Pan, John H. Reif:
Extension of the Parallel Nested Dissection Algorithm to Path Algebra Problems. 470-487 - Sanjay V. Rajopadhye, S. Purushothaman, Richard Fujimoto:
On Synthesizing Systolic Arrays from Recurrence Equations with Linear Dependencies. 488-503 - Rakesh M. Verma, Krishnaprasad Thirunarayan, I. V. Ramakrishnan:
An Efficient Parallel Algorithm for Term Matching. 504-518
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.
last updated on 2024-12-26 01:01 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
