13. FSTTCS 1993:
Bombay,
India
R. K. Shyamasundar (Ed.):
Foundations of Software Technology and Theoretical Computer Science, 13th Conference, Bombay, India, December 15-17, 1993, Proceedings.
Lecture Notes in Computer Science 761 Springer 1993, ISBN 3-540-57529-4 BibTeX
@proceedings{DBLP:conf/fsttcs/1993,
editor = {R. K. Shyamasundar},
title = {Foundations of Software Technology and Theoretical Computer Science,
13th Conference, Bombay, India, December 15-17, 1993, Proceedings},
booktitle = {FSTTCS},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {761},
year = {1993},
isbn = {3-540-57529-4},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Invited Talk
Type Theory
Invited Talk
Parallel Algorithms
Term Rewriting
Logic and Constraint Logic Programming
Computational Geometry and Complexity
- Sumanta Guha, Ichiro Suzuki:
Proximity Problems and the Voronoi Diagram an a Rectilinear Plane with Rectangular Obstacles.
218-227 BibTeX
- Boudewijn Asberg, Gregoria Blanco, Prosenjit Bose, Jesus Garcia-Lopez, Mark H. Overmars, Godfried T. Toussaint, Gordon T. Wilfong, Binhai Zhu:
Feasability of Design in Stereolithography.
228-237 BibTeX
- Venkatesh Radhakrishnan, Sven Oliver Krumke, Madhav V. Marathe, Daniel J. Rosenkrantz, S. S. Ravi:
Compact Location Problems.
238-247 BibTeX
- Magnús M. Halldórsson, Jaikumar Radhakrishnan, K. V. Subrahmanyam:
On Some Communication Complexity Problems Related to THreshold Functions.
248-259 BibTeX
- Felipe Cucker, Francesc Rosselló:
Recursiveness over the Complex Numbers is Time-Bounded.
260-267 BibTeX
Invited Talk
Software Technology
Panel
Invited Talk
Concurrency
Distributed Algorithms
Algorithms and Learning Theory
Copyright © Sat May 16 23:12:55 2009
by Michael Ley (ley@uni-trier.de)
