AMAST Mail - October 1999
[Prev][Next][Index]
Call for Participation
-
Subject: Call for Participation
-
From: FSTTCS99 <fsttcs99@imsc.ernet.in>
-
Date: Wed, 20 Oct 1999 19:45:30 +0530 (IST)
-
Return-Receipt-To: fsttcs99@imsc.ernet.in
***********************************************************************
* CALL FOR PARTICIPATION *
***********************************************************************
* *
* FST & TCS '99 *
* *
* FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE *
* December 13--15, 1999, Chennai, India *
* *
***********************************************************************
* Conference Home-page at http://www.imsc.ernet.in/~fsttcs99 *
***********************************************************************
(A postscript version of this announcement is available
by email from "fsttcs99@imsc.ernet.in" .)
GENERAL INFORMATION
The nineteenth Conference on Foundations of Software Technology and
Theoretical Computer Science (19th FST&TCS 1999) will be held at
Chennai. This annual conference, organized by the Indian Association
for Research in Computing Science (IARCS), provides a platform for
presentation of original research results in fundamental aspects of
computer science. The proceedings of FST&TCS-19 are published by
Springer-Verlag as LNCS 1738.
SATELLITE EVENTS
The conference will be preceded by a two-day workshop on Advances in
Data Structures (December 11-12, 1999), and a two-day Workshop on
Foundations of Mobile Computing (December 16-17, 1999). More details
of these events are given below, after the Conference Programme.
INVITED SPEAKERS
Martin Abadi (Bell Labs - Lucent Technologies, Palo Alto, USA)
Lila Kari (Univ. Western Ontario, Canada)
Jean-Jacques Levy (INRIA, Paris, France)
Micha Sharir (Univ. Tel Aviv, Israel and Courant Institute, New York)
Seinosuke Toda (IEC, Tokyo, Japan)
VENUE
The Conference, as well as the Workshop on Advances in Data
Structures, will take place in the IC&SR auditorium in the campus of
Indian Institute of Technology IIT Madras. The Workshop on Foundations
of Mobile Computing will take place in the Institute of Mathematical
Sciences.
ORGANIZED BY
Indian Institute of Technology Madras, Chennai, and
The Institute of Mathematical Sciences, Chennai.
FOR MORE INFORMATION
Email : rangan@iitm.ernet.in
URL : http://www.imsc.ernet.in/~fsttcs99
Post : 19th FST&TCS 1999,
Dept. of Computer Science and Engineering,
Indian Institute of Technology Madras,
Chennai 600 036, India.
Fax: ++91-44-445 8352
**********************************************************************
* *
* CONFERENCE PROGRAMME *
* *
**********************************************************************
(Parallel sessions are marked with a *).
MONDAY, DECEMBER 13, 1999
0815-0900 Registration
0900-1000 Invited Talk I
Recent Developments in the Theory of Arrangements of Surfaces
Micha Sharir,
U. Tel Aviv, Israel and Courant Institute, New York.
1000-1020 TEA
1020-1120 Session 1 (a)*
Dynamic Compressed Hyperoctrees with Application to the N-body Problem
Srinivas Aluru and Fatih Sevilgen
Largest empty rectangle among a point set
Jeet Chaudhuri and Subhas C. Nandy
1020-1120 Session 1 (b)*
Renaming is necessary in timed regular expressions
Philippe HERRMANN
Product Interval Automata: A Subclass of Timed Automata
Deepak D'Souza and P. S. Thiagarajan
1130-1230 Session 2 (a)*
The Complexity of Rebalancing a Binary Search Tree
Rolf Fagerberg
Fast Allocation and Deallocation with an Improved Buddy System
Erik D. Demaine and J. Ian Munro
1130-1230 Session 2 (b)*
Optimal Bounds for Transformations of Omega-Automata
Christof Loeding
CTL+ Is Exponentially More Succinct Than CTL
Thomas Wilke
1230-1400 LUNCH
1400-1500 Invited Talk 2
A top-down look at a secure message
Martin Abadi,
Bell Labs - Lucent Technologies, Palo Alto
1500-1520 TEA
1520-1620 Session 3
Explaining Updates by Minimal Sums
Juergen Dix and Karl Schlechta
A Foundation for Hybrid Knowledge Bases
James J. Lu, Neil V. Murray and Erik Rosenthal
1630-1700 Session 4
Hoare Logic for Mutual Recursion and Local Variables
David von Oheimb
TUESDAY, DECEMBER 14, 1999
0900-1000 Invited Talk 3
Explicit Substitutions and Programming languages
Jean-Jacques Le'vy,
INRIA, Paris.
1000-1020 TEA
1020-1120 Session 5 (a)*
Approximation algorithms for routing and call scheduling in all
optical chains and rings.
L.Becchetti, M.Di Ianni and A. Marchetti-Spaccamela
A Randomized Algorithm for Flow Shop Scheduling
Naveen Garg, Chaitanya Swamy and Sachin Jain
1020-1120 Session 5 (b)*
Synthesizing distributed transition systems from global specifications
Ilaria Castellani, Madhavan Mukund and P.S.Thiagarajan
Beyond Region Graphs: Symbolic Forward Analysis of Timed Automata
Supratik Mukhopadhyay and Andreas Podelski
1130-1230 Session 6
Implicit temporal query languages : towards completeness
N. Bidoit, S. De Amo
On the Undecidability of Some Sub-classical First-order Logics
Matthias Baaz, Agata Ciabattoni, Christian Fermueller and
Helmut Veith
1230-1400 LUNCH
1400-1500 Invited Talk 4
How to compute with DNA
Lila Kari,
University of Western Ontario, London, Canada
1500-1520 TEA
1520-1620 Session 7 (a)*
A high girth graph construction and a lower bound on the
hitting set size for combinatorial rectangles
L. Sunilchandran
Protecting Facets in Layered Manufacturing
Joerg Schwerdt, Michiel Smid, Ravi Janardan,
Eric Johnson and Jayanth Majhi
1520-1620 Session 7 (b)*
The Receptive Distributed Pi-Calculus
Roberto Amadio, Gerard Boudol and Cedric Lhoussaine
Series and parallel operations on pomsets
Zolta'n E'sik and Satoshi Okawa
1630-1700 Session 8
Unreliable Failure Detectors with Limited Scope Accuracy
and an Application to Consensus
Achour Mostefaoui and Michel Raynal
1715 IARCS General Assembly Meeting
1930 Conference Dinner
WEDNESDAY, DECEMBER 15, 1999
0900-1000 Invited Talk 5
Graph Isomorphism Problem: Its Complexity and Algorithms
Seinosuke Toda,
IEC Tokyo.
1000-1020 TEA
1020-1120 Session 9 (a)*
Computing with Restricted Nondeterminism: The Dependence of the
OBDD Size on the Number of Nondeterministic Variables
Martin Sauerhoff
Lower Bounds for Linear Transformed OBDDs and FBDDs
Detlef Sieling
1020-1120 Session 9 (b)*
A Unifying Framework for Model Checking Labeled Kripke Structures,
Modal Transition Systems, and Interval Transition Systems
Michael Huth
Graded Modalities and Resource Bisimulation
Flavio Corradini, Rocco De Nicola and Anna Labella
1130-1230 Session 10 (a)*
The Non-Recursive Power of Erroneous Computation
Christian Schindelhauer and Andreas Jakoby
Analysis of Quantum Functions
Tomoyuki Yamakami
1130-1230 Session 10 (b)*
On Sets Growing Continuously
Bernhard Heinemann
Model Checking Knowledge and Time in Systems with Perfect Recall
Ron van der Meyden and Nikolay Shilov
1230-1400 LUNCH
1700 FST&TCS'99 Closing Session
The following JOINT SESSIONS are open to participants of FST&TCS as
well as ISAAC, the International Symposium on Algorithms and Computation.
WEDNESDAY, DECEMBER 15, 1999,
IC&SR Auditorium, IIT Madras
1400--1700 A tutorial on Web Algorithmics
Monika R. Henzinger
THURSDAY, DECEMBER 16, 1999,
Hotel Taj Coromandel
0900-1000 The Engineering of Some Bipartite Matching Programs
Kurt Mehlhorn
**********************************************************************
* *
* SATELLITE EVENTS *
* *
**********************************************************************
WORKSHOP ON ADVANCES IN DATA STRUCTURES
December 11--12, 1999
IC&SR Auditorium, I.I.T. Madras, Chennai 600 036
URL: http://www.imsc.ernet.in/~fsttcs99/data.html
This workshop will focus on Data Structures, with an emphasis on those
relevant to current and emerging applications.
Invited talks include
Expected case complexity of nearest neighbour searching
Sunil Arya (Hong Kong University of Science and Technology)
Regularities in sequences
Gerth Brodal (BRICS)
String B-trees: theoretical results, algorithmic engineering
and some applications on XML texts
Paolo Ferragina (University of Pisa)
Problems in cell probe complexity (some open, some solved)
Peter Bro Miltersen (University of Aarhus)
Succinct data structures
Ian Munro (University of Waterloo)
Shortest paths: Recent developments
Torben Hagerup (University of Frankfurt)
Tuning the cache performance of a local search algorithm
for graph coloring
Giuseppe Italiano (University of Rome)
Cache analysis of sorting algorithms
Rajeev Raman (King's College London)
Workshop Organisers
Ramesh Hariharan ramesh@csa.iisc.ernet.in
Rajeev Raman raman@dcs.kcl.ac.uk
Local Arrangements
Venkatesh Raman vraman@imsc.ernet.in
C. Pandu Rangan rangan@iitm.ernet.in
**********************************************************************
WORKSHOP ON FOUNDATIONS OF MOBILE COMPUTING
December 16--17, 1999
Institute of Mathematical Sciences, Chennai 600 113
URL: http://www.imsc.ernet.in/~fsttcs99/mobile.html
The workshop will address fundamental principles in the definition,
analysis and implementation of languages and models for mobile
distributed programming.
The theme of the workshop is formal operational foundations of
mobile computation, including semantics, equivalences and program
logics. Associated with the frameworks mentioned above are
numerous issues, related to typing and type safety, security,
mobility, architectures and protocols, active networks,
proof-carrying code, protocol analysis and verification, concurrent
constraint solving, as well as numerous interesting applications such
as switchware, programmable hybrid systems, and reactive
systems.
The aim of the workshop is to introduce these operational
frameworks to potentially interested researchers (the tutorial aspect)
as well as provide a forum for researchers active in the area to
report on recent work.
Invited speakers include
Gerard Boudol (INRIA, Sophia-Antipolis)
Andrew Gordon (Microsoft Research)
Jean-Jacques Levy (INRIA, Rocquencourt)
Programme Committee
Roberto Amadio (Univ. of Provence, Marseille)
Hans Huttel (Univ. of Aalborg)
Jean-Jacques Levy (INRIA, Rocquencourt)
Benjamin Pierce (Univ. of Pennsylvania)
Sanjiva Prasad (IIT, Delhi) (Organizer)
R. Ramanujam (IMSc, Chennai) (Organizer)
XXXX
**********************************************************************
* *
* REGISTRATION INFORMATION *
* *
**********************************************************************
The registration fees for FST\&TCS '99 are as follows:
-----------------------------------------
| Dates | General | Student |
| | | |
------------------+----------+----------+
| Until Nov. 6 | $ 200 | $ 125 |
| After Nov. 6 | $ 250 | $ 150 |
-----------------------------------------
The registration fee includes a copy of the Conference proceedings,
lunch and refreshments, and registration for the two Workshops.
This year, the tenth International Symposium on Algorithms and
Computation (ISAAC) is being held in Chennai on 16--18 December,
immediately following FST&TCS.
The registration fees for ISAAC are as follows:
-----------------------------------------
| Dates | General | Student |
| | | |
------------------+----------+----------+
| Until Nov. 6 | $ 350 | $ 150 |
| After Nov. 6 | $ 400 | $ 200 |
-----------------------------------------
The registration fee includes a copy of the Symposium proceedings,
lunch and refreshments.
To register for *both* FST&TCS and ISAAC, the fees are as follows:
-----------------------------------------
| Dates | General | Student |
| | | |
------------------+----------+----------+
| Until Nov. 6 | $ 500 | $ 250 |
| After Nov. 6 | $ 600 | $ 300 |
-----------------------------------------
To pay the registration fee in advance, fill out the registration form
below and mail it to the following address, along with a banker's
cheque of the appropriate value in US Dollars drawn in favour of
FST&TCS 99
and payable at the State Bank of India, IIT Madras, Chennai:
19th FST&TCS 1999,
C. Pandu Rangan,
Professor and Head,
Dept. of Computer Science and Engineering,
Indian Institute of Technology,
Chennai 600 036, India
REGISTRATION FORM
1 Name:
2 Affiliation:
3 Postal Address:
4 E-mail:
5 Phone:
6 Fax:
7 Conferences and Workshops:
a I would like to participate in
Both FST&TCS and ISAAC Yes/No
Only FST&TCS Yes/No
b I would like to participate in the Workshop on Advances in
Data Structures: Yes/No
c I would like to participate in the Workshop on
Mobile Computing: Yes/No
8 Registration details:
a Type of registration:
General / Student
b Date of registration:
On or Before Nov 6 / After Nov 6
9 Bank draft details:
a Draft number:
b Date:
c Amount:
d Drawn on: (Bank, Branch)
Signature:
Date:
TRAVEL AND MISCELLANEOUS INFORMATION
Chennai, formerly known as Madras, is served by several international
airlines, including Air India, British Airways, Lufthansa, Singapore
Airlines, Malaysian Airlines, Gulf Air. In addition, it has excellent
domestic air and train connections to Delhi and Mumbai (formerly
Bombay), which are served by virtually all international airlines.
Most international flights to/from India in December are booked
months in advance, since this is the prime tourist season. So you are
advised to start making your trip preparations at once. You are also
advised to apply early for a visa, since there can be a large delay
in this process. It is often simpler to apply for a general
tourist visa than to get a visa to attend the Conference.
The climate in Chennai in December is usually quite pleasant, with
day temperatures ranging between 25 C and 30 C, and
minimum temperatures of 18 C to 20 C. Occasional rain
showers are common in December.
ACCOMMODATION
The FST&TCS Conference has not made any specific hotel bookings. The
homepage
http://www.imsc.ernet.in/~fsttcs99/hotels.html
has a list of conveniently located hotels, with tariff rates and
telephone and fax numbers. You can also download maps of Chennai and
the area around I.I.T. campus. Contact the hotel of your choice
directly and finalise your accomodation arrangements. Again, since
this is the prime tourist season, you are advised to finalise the
hotel booking as early as possible.
SOCIAL EVENTS
Since the second half of December is the classical music and dance
season in Chennai, there will be a surfeit of excellent performances
all over town. Information about these events will be available at the
Conference registration desk during the Conference.
There are several interesting sites near Chennai worth a visit,
including the temple town of Kancheepuram and the temples and beaches
of Mamallapuram.
ADDITIONAL INFORMATION
For more information, see the Conference homepage, or send email to
rangan@iitm.ernet.in. In particular, detailed instructions and maps
describing how to reach the conference venue are available on the
homepage
http://www.imsc.ernet.in/~fsttcs99/venue.html.
**********************************************************************
CONFERENCE GENERAL CHAIR
C. Pandu Rangan (IIT Madras)
PROGRAMME COMMITTEE
S. Arun-Kumar (IIT Delhi)
V. Arvind (IMSc, Chennai)
Zhou Chaochen (UNU/IIST, Macau)
Tamal Dey (IIT Kharagpur)
Devdatt Dubhashi (IIT Delhi)
Melvin Fitting (CUNY, New York)
Lance Fortnow (U. Chicago)
Ramesh Hariharan (IISc, Bangalore)
Kohei Honda (U. Edinburgh)
Samir Khuller (U. Maryland, College Park)
Kamala Krithivasan (IIT Madras)
K. Narayan Kumar (CMI, Chennai)
Ming Li (U. Waterloo)
Kamal Lodaya (IMSc, Chennai)
Paliath Narendran (SUNY, Albany)
Rajeev Raman (King's College, London)
Venkatesh Raman (IMSc, Chennai) (Co-chair)
R. Ramanujam (IMSc, Chennai) (Co-chair)
S. Ramesh (IIT Bombay)
Uday S. Reddy (U. Illinois at Urbana-Champaign)
Natarajan Shankar (SRI, Menlo Park)
Scott Smolka (SUNY, Stony Brook)
Milind Sohoni (IIT Bombay)
Wolfgang Thomas (RWTH, Aachen)
ORGANIZING COMMITTEE
E. Boopal (IIT Madras)
V. Kamakoti (ATI Research, Chennai)
R. Rama (IIT Madras)
K. Rangarajan (MCC, Chennai)
PUBLICITY
Madhavan Mukund (CMI, Chennai)
**********************************************************************
[
AMAST Mail - October 1999
|
September 1999 |
November 1999 |
Latest Update |
AMAST Mail Meta-Index |
AMAST Mail 1999 |
AMAST
]