FST TCS 2000 Preliminary Programme
13 December 2000 |
||
| 9:00-9:30 | Opening | |
| 9:30-10:30 | Invited Talk:
E Allen Emerson Model Checking: Theory into Practice |
|
| 10:30-11:00 | Tea | |
| 11:00-12:30 | Fast On-line/Off-line Algorithms for Optimal Reinforcement
of a Network and its Connections with Principal Partition H. Narayanan and Sachin B. Patkar |
Model checking CTL Properties of Pushdown Systems Igor Walukiewicz |
| On-Line Edge-Coloring with a Fixed Number of Colors
Lene Monrad Favrholdt and Morten Nyhave Nielsen |
A Decidable Dense Branching-time Temporal Logic Salvatore La Torre and Margherita Napoli |
|
| On Approximability of the Independent/Connected Edge
Dominating Set Problems Toshihiro Fujito |
Fair Equivalence Relations Orna Kupferman, Nir Piterman and Moshe Vardi |
|
| 12:30-14:00 | Lunch | |
| 14:00-15:00 | Invited Talk: Philip Wadler An Algebra for XML Query |
|
| 15:00-15:30 | Tea | |
| 15:30-17:00 | Arithmetic Circuits and Polynomial Replacement Systems Pierre McKenzie, Heribert Vollmer and Klaus W. Wagner |
Combining Semantics with Non-Standard Interpreter
Hierarchies Sergei Abramov and Robert Glueck |
| Depth-3 arithmetic circuits for S(2,n)(X) and extensions
of the Graham-Pollack theorem Jaikumar Radhakrishnan, Pranab Sen and Sundar Vishwanathan |
Using Modes to Ensure Subject Reduction for Typed Logic
Programs with Subtyping Jan-Georg Smaus, Francois Fages and Pierre Deransart |
|
| The Weak Monadic Quantifier Alternation Hierarchy of
Equational Graphs is Infinite Ly Olivier |
Dynamically Ordered Probabilistic Choice Logic
Programming Marina De Vos and Dirk Vermeir |
|
| 18:30-20:00 | IARCS Business Meeting | |
14 December 2000 |
||
| 9:00-10:00 | Invited Talk: Bernard Chazelle Irregularities of Distribution, Derandomization, and Complexity Theory |
|
| 10:10-11:10 | Coordinatized Kernels and Catalytic Reductions: Improved
FPT Algorithms for Max Leaf Spanning Tree and Other Problems Michael R. Fellows, Catherine McCartin, Ulrike Stege and Frances A. Rosamond |
A Complete Fragment of Higher-Order Duration
$\mu$-Calculus Dimitar P. Guelev |
| Planar Graph Blocking for External Searching Surender Baswana and Sandeep Sen |
A Complete Axiomatisation for Timed Automata Huimin Lin and Wang Yi |
|
| 11:10-11:30 | Tea | |
| 11:30-12:30 | Text Sparsification via Local Maxima Pierluigi Cresceznzi, Alberto Del Lungo, Roberto Grossi, Elena Lodi, Linda Palgi and Gianluca Rossi |
Semantic Theory for Heterogeneous System Design, Rance Cleaveland and Gerald Luettgen |
| Approximate Swapped Matching A Amir, M Lewenstein and E. Porat |
Formal Verification of the Ricart-Agrawala Algorithm Ekaterina Sedletsky, Amir Pnueli and Mordechai Ben-Ari |
|
| 12:30-14:00 | Lunch |
|
| 14:00-15:00 | Invited Talk: Jose Meseguer Rewriting Logic as a Metalogical Framework |
|
| 15:00-15:30 | Tea | |
| 15:30-17:00 | On distribution-specific learning with membership queries
versus pseudorandom generation Johannes Köbler and Wolfang Lindner |
A General Framework for Types in Graph Rewriting Barbara Koenig |
| $\Theta_2^p$-completeness: A classical approach for new
results Joel Vogel and Holger Spakowski |
The Ground Congruence for Chi Calculus Yuxi Fu and Zhenrong Yang |
|
| Is the Standard Proof System for SAT P-optimal? Johannes Köbler and Jochen Messner |
Inheritance in the Join Calculus Cedric Fournet, Cosimo Laneve, Luc Maranget and Didier Remy |
|
| 15 December 2000 | ||
| 9:00-10:00 | Invited Talk: Martin Grötschel Frequency Assignment in Mobile Phone Systems |
|
| 10:10-11:10 | Approximation Algorithms for Bandwidth and Storage
Allocation Problems under Real Time Constraints Stefano Leonardi, Alberto Marchetti-Spaccamela and Andrea Vitaletti |
The Fine Structure of Game Lambda Models Pietro Di Gianantonio and Gianluca Franco |
| Dynamic Spectrum Allocation: The Impotency of Duration
Notification Bala Kalyanasundaram and Kirk Pruhs |
Strong Normalisation of Second Order Symmetric
Lambda-calculus Michel Parigot |
|
| 11:10-11:30 | Tea |
|
| 11:30-12:30 | Scheduling to minimize the average completion time of
dedicated tasks Foto Afrati, Eviripidis Bampis, Aleksei V. Fishin, Klaus Jansen and Claire Keyon |
Keeping Track of the Latest Gossip in Shared Memory
Systems Bharat Adsul, Aranyak Mehta and Milind Sohoni |
| Hunting for Functionally Analogous Genes M. T. Hallett and J. Lagergren |
On Concurrent Knowledge and Logical Clock Abstractions
Ajay Kshemkalyani |
|
| 12:30-14:00 | Lunch |
|
| 14:00-15:00 | Invited Talk: Peter Buneman Data Provenance: Some Basic Issues |
|
| 15:00-15:30 | Tea |
|
| 15:30-16:30 | Decidable Hierarchies of Starfree Languages Christian Glasser and Heinz Schmitz |
|
| Prefix languages of Church-Rosser languages Jens R. Woinowski |
||
| 16:30-17:00 | Closing | |