Skip to main content
  • Conference proceedings
  • © 1999

Foundations of Software Technology and Theoretical Computer Science

19th Conference, Chennai, India, December 13-15, 1999 Proceedings

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 1738)

Buy it now

Buying options

eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

This is a preview of subscription content, log in via an institution to check for access.

Table of contents (36 papers)

  1. Front Matter

    Pages I-XII
  2. Invited Talk 1

  3. Session 1(a)

    1. Dynamic Compressed Hyperoctrees with Application to the N-body Problem

      • Srinivas Aluru, Fatih E. Sevilgen
      Pages 21-33
    2. Largest Empty Rectangle among a Point Set

      • Jeet Chaudhuri, Subhas C. Nandy
      Pages 34-46
  4. Session 1(b)

    1. Product Interval Automata: A Subclass of Timed Automata

      • Deepak D’Souza, P. S. Thiagarajan
      Pages 60-71
  5. Session 2(a)

    1. Fast Allocation and Deallocation with an Improved Buddy System

      • Erik D. Demaine, Ian J. Munro
      Pages 84-96
  6. Session 2(b)

  7. Invited Talk 2

    1. A Top-Down Look at a Secure Message

      • Martín Abadi, Cédric Fournet, Georges Gonthier
      Pages 122-141
  8. Session 3

    1. Explaining Updates by Minimal Sums

      • Jürgen Dix, Karl Schlechta
      Pages 142-154
    2. A Foundation for Hybrid Knowledge Bases

      • James J. Lu, Neil V. Murray, Erik Rosenthal
      Pages 155-167
  9. Session 4

  10. Invited Talk 3

    1. Explicit Substitutions and Programming Languages

      • Jean-Jacques Lévy, Luc Maranget
      Pages 181-200
  11. Session 5(a)

    1. Approximation Algorithms for Routing and Call Scheduling in All-Optical Chains and Rings

      • Luca Becchetti, Miriam Di Ianni, Alberto Marchetti-Spaccamela
      Pages 201-213
    2. A Randomized Algorithm for Flow Shop Scheduling

      • Naveen Garg, Sachin Jain, Chaitanya Swamy
      Pages 213-218
  12. Session 5(b)

    1. Synthesizing Distributed Transition Systems from Global Specifications

      • Ilaria Castellani, Madhavan Mukund, P. S. Thiagarajan
      Pages 219-231
    2. Beyond Region Graphs: Symbolic Forward Analysis of Timed Automata

      • Supratik Mukhopadhyay, Andreas Podelski
      Pages 232-244
  13. Session 6

    1. Implicit Temporal Query Languages: Towards Completeness

      • Nicole Bidoit, Sandra de Amo
      Pages 245-257

Editors and Affiliations

  • Department of Computer Science and Engineering, Indian Institute of Technology, Chennai, India

    C. Pandu Rangan

  • Institute of Mathematical Sciences C.I.T. Campus, Chennai, India

    V. Raman, R. Ramanujam

Bibliographic Information

Buy it now

Buying options

eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access