13. FSTTCS 1993: Bombay, India

Invited Talk

• Juris Hartmanis:
  Some Observations About the Nature of Computer Science. 1-12
  

Type Theory

• Steffen van Bakel:
  Essential Intersection Type Assignment. 13-23
  
• Hassan Aït-Kaci, Jacques Garrigue:
  Label-Selective lambda-Calculus Syntax and Confluence. 24-40
  
• Erik Barendsen, Sjaak Smetsers:
  Conventional and Uniqueness Typing in Graph Rewrite Systems. 41-51
  
• Giuseppe Castagna:
  A Meta-Language for Typed Object-Oriented Languages. 52-71
  

Invited Talk

• Gérard Berry:
  Preemption in Concurrent Systems. 72-93
  

Parallel Algorithms

• Sanjeev R. Kulkarni, Sanjoy K. Mitter, T. J. Richardson, John N. Tsitsiklis:
  Local Versus Non-local Computation of Length of Digitized Curves. 94-103
  
• Klaus-Jörn Lange, Rolf Niedermeier:
  Data-Independences of Parallel Random Access Machines. 104-113
  

Term Rewriting

• G. Aguzzi, U. Modigliani:
  Proving Termination of Logic Programs by Transforming them into Equivalent Term Rewriting Systems. 114-124
  
• M. R. K. Krishna Rao:
  Completeness of Hierarchical Combinations of term Rewriting Systems. 125-138
  
• Nachum Dershowitz, Subrata Mitra:
  Higher-Order and Semantic Unification. 139-150
  

Logic and Constraint Logic Programming

• David A. Basin, Seán Matthews:
  A Conservative Extension of First-order Logic and Its Application to Theorem Proving. 151-160
  
• Peter J. Stuckey, S. Sudarshan:
  Well-Founded Ordered Search (Extended Abstract). 161-172
  
• Y. S. Ramakrishna, Laura K. Dillon, Louise E. Moser, P. M. Melliar-Smith, G. Kutty:
  A Real-Time Interval Logic and Its Decision Procedure. 173-192
  
• François Fages:
  On the Semantics of Optimization Predicates in CLP Languages. 193-204
  
• Viswanath Ramachandran, Pascal Van Hentenryck:
  Incremental Algorithms for Constraint Solving and Entailment over Rational Trees. 205-217
  

Computational Geometry and Complexity

• Sumanta Guha, Ichiro Suzuki:
  Proximity Problems and the Voronoi Diagram an a Rectilinear Plane with Rectangular Obstacles. 218-227
  
• Boudewijn Asberg, Gregoria Blanco, Prosenjit Bose, Jesus Garcia-Lopez, Mark H. Overmars, Godfried T. Toussaint, Gordon T. Wilfong, Binhai Zhu:
  Feasability of Design in Stereolithography. 228-237
  
• Venkatesh Radhakrishnan, Sven Oliver Krumke, Madhav V. Marathe, Daniel J. Rosenkrantz, S. S. Ravi:
  Compact Location Problems. 238-247
  
• Magnús M. Halldórsson, Jaikumar Radhakrishnan, K. V. Subrahmanyam:
  On Some Communication Complexity Problems Related to THreshold Functions. 248-259
  
• Felipe Cucker, Francesc Rosselló:
  Recursiveness over the Complex Numbers is Time-Bounded. 260-267
  

Invited Talk

• Ketan Mulmuley:
  A lOwer Bound for Solvability of Polynomial Equations. 268-283
  

Software Technology

• Wolfgang Reif, Kurt Stenzel:
  Reuse of Proofs in Software Verification. 284-293
  
• Theodore S. Norvell:
  Induce-Statements and Induce-Expressions: Constructs for Inductive Programming. 294-305
  
• Christian Antoine, Bernard Le Goff, Jean-Eric Pin:
  A Graphic Language Based on Timing Diagrams. 306-316
  

Panel

• R. Narasimhan:
  Panel on Software Technology: Integrating Theory and Practice. 317
  

Invited Talk

• Fahiem Bacchus, Adam J. Grove, Joseph Y. Halpern, Daphne Koller:
  Generating Degrees of Belief from Statistical Information: An Overview. 318-325
  

Concurrency

• Allan Cheng, Javier Esparza, Jens Palsberg:
  Complexity Results for 1-safe Nets. 326-337
  
• David Janin:
  Some Results About Logical Descriptions of Non-Deterministic Behaviours. 338-347
  
• Ryszard Janicki, Maciej Koutny:
  Order Structures and Generalisations of Szpilrajn's Theorem. 348-357
  
• K. Narayan Kumar, Paritosh K. Pandya:
  ICSP and Its Relationship with ACSP and CSP. 358-372
  
• Kohei Honda, Nobuko Yoshida:
  On Reduction-Based Semantics. 373-387
  

Distributed Algorithms

• Madhavan Mukund, Milind A. Sohoni:
  Keeping Track of the Latest Gossip: Bounded Time-Stamps Suffice. 388-399
  
• Sudhanshu Aggarwal, Shay Kutten:
  Time Optimal Self-Stabilizing Spanning Tree Algorithms. 400-410
  

Algorithms and Learning Theory

• Arun K. Pujari:
  Efficient Algorithm to Sort Linear Combinations of Arrays. 411-418
  
• Vijay K. Vaishnavi, D. Khanna:
  A Simple File Structure for the Weighted Dictionary Problem. 419-435
  
• Devdatt P. Dubhashi, Kurt Mehlhorn, Desh Ranjan, Christian Thiel:
  Searching, Sorting and Randomised Algorithms for Central Elements and Ideal Counting in Posets. 436-443
  
• Pushpak Bhattacharyya, G. Nagaraja:
  Learning Classes of Regular and Linear Languages in Valiant's Learnability Framework. 444-454
  

Last update Wed May 22 04:40:00 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page