Riassunto:
th This volume contains the proceedings of the 19 FST&TCS conference (Foundations of Software Technology and Theoretical Computer Science), - ganized under the auspices of the Indian Association for Research in Computing Science (http://www. imsc. ernet. in/~iarcs). This year’s conference attracted 84 submissions from as many as 25 dieren t countries. Each submission was reviewed by at least three independent referees. th After a week-long e-mail discussion, the program committee met on the 7 th and 8 of August, 1999, in Chennai and selected 30 papers for inclusion in the conference program. We thank the program committee members and the reviewers for their sincere eorts. We are fortunate to have ve invited speakers this year, providing for a very attractive program: Mart n Abadi (Bell Labs - Lucent Technologies, Palo Alto, USA), Lila Kari (Univ. Western Ontario, Canada), Jean-Jacques L evy (INRIA, Paris,France),Micha Sharir, (Univ. TelAviv,Israel),andSeinosuke Toda (IEC, Tokyo,Japan). Moreover,theconferenceisprecededbyatwo-dayworkshop(- cember 11{12, 1999) on Data Structures and succeeded by a two-day workshop (December 16-17, 1999) on Foundations of Mobile Computation. The conference also features two joint sessions with the International Symposium on - tomata, Algorithms and Computation (December 16{18, 1999, Chennai): Monika Henzinger (Compaq Systems Research, Palo Alto, USA) is presenting a tutorial on Web algorithmics as the last event of FST&TCS and Kurt Mehlhorn (Max-Planck-Institut, Saarbru ¨cken, Germany) is giving a talk on algorithm - gineering as the rst event of ISAAC.
Contenuti:
Invited Talk 1.- Recent Developments in the Theory of Arrangements of Surfaces.- Session 1(a).- Dynamic Compressed Hyperoctrees with Application to the N-body Problem.- Largest Empty Rectangle among a Point Set.- Session 1(b).- Renaming Is Necessary in Timed Regular Expressions.- Product Interval Automata: A Subclass of Timed Automata.- Session 2(a).- The Complexity of Rebalancing a Binary Search Tree.- Fast Allocation and Deallocation with an Improved Buddy System.- Session 2(b).- Optimal Bounds for Transformations of ?-Automata.- CTL+ Is Exponentially More Succinct than CTL.- Invited Talk 2.- A Top-Down Look at a Secure Message.- Session 3.- Explaining Updates by Minimal Sums.- A Foundation for Hybrid Knowledge Bases.- Session 4.- Hoare Logic for Mutual Recursion and Local Variables.- Invited Talk 3.- Explicit Substitutions and Programming Languages.- Session 5(a).- Approximation Algorithms for Routing and Call Scheduling in All-Optical Chains and Rings.- A Randomized Algorithm for Flow Shop Scheduling.- Session 5(b).- Synthesizing Distributed Transition Systems from Global Specifications.- Beyond Region Graphs: Symbolic Forward Analysis of Timed Automata.- Session 6.- Implicit Temporal Query Languages: Towards Completeness.- On the Undecidability of Some Sub-classical First-Order Logics.- Invited Talk 4.- How to Compute with DNA.- Session 7(a).- A High Girth Graph Construction and a Lower Bound for Hitting Set Size for Combinatorial Rectangles.- Protecting Facets in Layered Manufacturing.- Session 7(b).- The Receptive Distributed ?-Calculus.- Series and Parallel Operations on Pomsets.- Session 8.- Unreliable Failure Detectors with Limited Scope Accuracy and an Application to Consensus.- Invited Talk 5.- Graph Isomorphism: Its Complexity and Algorithms.- Session 9(a).- Computing with Restricted Nondeterminism: The Dependence of the OBDD Size on the Number of Nondeterministic Variables.- Lower Bounds for Linear Transformed OBDDs and FBDDs.- Session 9(b).- A Unifying Framework for Model Checking Labeled Kripke Structures, Modal Transition Systems, and Interval Transition Systems.- Graded Modalities and Resource Bisimulation.- Session 10(a).- The Non-recursive Power of Erroneous Computation.- Analysis of Quantum Functions.- Session 10(b).- On Sets Growing Continuously.- Model Checking Knowledge and Time in Systems with Perfect Recall.- FST&TCS — ISAAC Joint Session Talks.- The Engineering of Some Bipartite Matching Programs.
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
