Advertisement

Table of contents

  1. Front Matter
    PDF
  2. Some observations about the nature of computer science
    Juris Hartmanis
    Pages 1-12
  3. Essential intersection type assignment
    Steffen van Bakel
    Pages 13-23
  4. Label-selective λ-calculus syntax and confluence
    Hassan Aït-Kaci, Jacques Garrigue
    Pages 24-40
  5. Conventional and uniqueness typing in graph rewrite systems
    Erik Barendsen, Sjaak Smetsers
    Pages 41-51
  6. A meta-language for typed object-oriented languages
    Giuseppe Castagna
    Pages 52-71
  7. Preemption in concurrent systems
    Gérard Berry
    Pages 72-93
  8. Local versus non-local computation of length of digitized curves
    S. R. Kulkarni, S. K. Mitter, T. J. Richardson, J. N. Tsitsiklis
    Pages 94-103
  9. Data-independences of parallel random access machines
    Klaus-Jörn Lange, Rolf Niedermeier
    Pages 104-113
  10. Proving termination of logic programs by transforming them into equivalent term rewriting systems
    G. Aguzzi, U. Modigliani
    Pages 114-124
  11. Completeness of hierarchical combinations of term rewriting systems
    M. R. K. Krishna Rao
    Pages 125-138
  12. Higher-order and semantic unification
    Nachum Dershowitz, Subrata Mitra
    Pages 139-150
  13. A conservative extension of first-order logic and its applications to theorem proving
    David Basin, Seán Matthews
    Pages 151-160
  14. Well-founded Ordered Search (extended abstract)
    Peter J. Stuckey, S. Sudarshan
    Pages 161-171
  15. A real-time interval logic and its decision procedure
    Y. S. Ramakrishna, L. K. Dillon, L. E. Moser, P. M. Melliar-Smith, G Kutty
    Pages 173-192
  16. On the semantics of optimization predicates in CLP languages
    François Fages
    Pages 193-204
  17. Incremental algorithms for constraint solving and entailment over rational trees
    Viswanath Ramachandran, Pascal van Hentenryck
    Pages 205-217
  18. Proximity problems and the Voronoi diagram on a rectilinear plane with rectangular obstacles
    Sumanta Guha, Ichiro Suzuki
    Pages 218-227
  19. Feasibility of design in stereolithography
    B. Asberg, G. Blanco, P. Bose, J. Garcia-Lopez, M. Overmars, G. Toussaint et al.
    Pages 228-237
  20. Compact location problems
    Venkatesh Radhakrishnan, Sven O. Krumke, Madhav V. Marathe, Daniel J. Rosenkrantz, S. S. Ravi
    Pages 238-247
  21. On some communication complexity problems related to threshold functions
    Magnús M. Halldórsson, Jaikumar Radhakrishnan, K. V. Subrahmanyam
    Pages 248-259
  22. Recursiveness over the complex numbers is time-bounded
    Felipe Cucker, Francesc Rosselló
    Pages 260-267
  23. A lower bound for solvability of polynomial equations
    Ketan Mulmuley
    Pages 268-283
  24. Reuse of proofs in software verification
    Wolfgang Reif, Kurt Stenzel
    Pages 284-293
  25. Induce-statements and induce-expressions: Constructs for inductive programming
    Theodore S. Norvell
    Pages 294-305
  26. A graphic language based on timing diagrams
    Christian Antoine, Bernard Le Goff, Jean-Eric Pin
    Pages 306-316
  27. Software technology: Integrating theory and practice
    R. Narasimhan
    Pages 317-317
  28. Generating degrees of belief from statistical information: An overview
    Fahiem Bacchus, Adam J. Grove, Joseph Y. Halpern, Daphne Koller
    Pages 318-325
  29. Complexity results for 1-safe nets
    Allan Cheng, Javier Esparza, Jens Palsberg
    Pages 326-337
  30. Some results about logical descriptions of non deterministic behaviours
    David Janin
    Pages 338-347
  31. Order structures and generalisations of Szpilrajn's theorem
    Ryszard Janicki, Maciej Koutny
    Pages 348-357
  32. ICSP and its relationship with ACSP and CSP
    K. Narayan Kumar, Paritosh K Pandya
    Pages 358-372
  33. On reduction-based process semantics
    Kohei Honda, Nobuko Yoshida
    Pages 373-387
  34. Keeping track of the latest gossip: Bounded time-stamps suffice
    Madhavan Mukund, Milind Sohoni
    Pages 388-399
  35. Time optimal self-stabilizing spanning tree algorithms
    Sudhanshu Aggarwal, Shay Kutten
    Pages 400-410
  36. Efficient algorithm to sort linear combinations of arrays
    Arun K. Pujari
    Pages 411-418
  37. A simple file structure for the weighted dictionary problem
    V. K. Vaishnavi, D. Khanna
    Pages 419-435
  38. Searching, sorting and randomised algorithms for Central Elements and ideal counting in posets
    Devdatt P. Dubhashi, Kurt Mehlhorn, Desh Ranjan, Christian Thiel
    Pages 436-443
  39. Learning classes of Regular and Linear Languages in Valiant's learnability framework
    P. Bhattacharyya, G. Nagaraja
    Pages 444-453
  40. Back Matter
    PDF

About these proceedings

Introduction

For more than a decade, Foundations of Software Technology and Theoretical Computer Science Conferences have been providing an annual forum for the presentation of new research results in India and abroad. This year, 119 papers from 20 countries were submitted. Each paper was reviewed by at least three reviewers, and 33 papers were selected for presentation and included in this volume, grouped into parts on type theory, parallel algorithms, term rewriting, logic and constraint logic programming, computational geometry and complexity, software technology, concurrency, distributed algorithms, and algorithms and learning theory. Also included in the volume are the five invited papers presented at theconference.

Keywords

Algorithmen Algorthmische Geometrie Computational Geometry Concurrency Komplexität Type Theory Typentheorie algorithm algorithms complexity logic programming

Bibliographic information

Industry Sectors
Automotive
Biotechnology
IT & Software
Telecommunications
Consumer Packaged Goods
Aerospace
Engineering
Finance, Business & Banking
Electronics