default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID10th FSTTCS 1990: Bangalore, India
- Kesav V. Nori, C. E. Veni Madhavan:
Foundations of Software Technology and Theoretical Computer Science, Tenth Conference, Bangalore, India, December 17-19, 1990, Proceedings. Lecture Notes in Computer Science 472, Springer 1990, ISBN 3-540-53487-3
Invited Paper
- Tien Huynh, Leo Joskowicz
, Catherine Lassez, Jean-Louis Lassez:
Reasoning About Linear Constraints Using Parametric Queries. 1-20
Logic
- Li-Yan Yuan, Jia-Huai You:
Discriminant Circumscription. 21-32 - Ramesh Subrahmanyam:
Complexity of Algebraic Specification. 33-37 - Ralf Treinen:
A New Method for Undecidability Proofs of First Order Theories. 48-62 - M. Masseron, Christophe Tollu, Jacqueline Vauzeilles:
Generating Plans in Linear Logic. 63-75
Automata and Formal Languages
- Karel Culík II, Simant Dube:
Automata-Theoretic Techniques for Image Generation and Compression. 76-90 - Abdellatif Saoudi:
Recognizable Infinite Tree Sets and their Complexity. 91-103 - V. Vinay, V. Chandru:
The Expressibility of Nondeterministic Auxiliary Stack Automata and its Relation to Treesize Bounded Alternating Auxiliary Pushdown Automata. 104-114
Theory of Programming
- Christopher P. Lewington:
Towards Constructive Program Derivation in VDM. 115-132 - Deepak Kapur, G. Sivakumar, Hantao Zhang:
A New Method for Proving Termination of AC-Rewrite Systems. 133-148
Parallel Algorithms
- John H. Reif, Akhilesh Tyagi:
Efficient Parallel Algorithms for Optical Computing with the DFT Primitive. 149-160 - Rajeev Raman:
The Power of Collision: Randomized Parallel Algorithms for Chaining and Integer Sorting. 161-175 - Rong Lin, Stephan Olariu:
Fast Parallel Algorithms for Cographs. 176-189 - John Case, Dayanand S. Rajan, Anil M. Shende:
Optimally Representing Euclidean Space Discretely for Analogically Simulating Physical Phenomena. 190-203 - Christos Levcopoulos, Andrzej Lingas, Ola Petersson, Wojciech Rytter:
Optimal Parallel Algorithms for Testing Isomorphism of Trees and Outerplanar Graphs. 204-214 - Sanguthevar Rajasekaran:
Randomized Parallel Selection. 215-224 - David Pearson, Vijay V. Vazirani:
A Fast Parallel Algorithm for Finding a Maximal Bipartite Set. 225-231
Invited Paper
- S. Rao Kosaraju:
On Parallel Evaluation of Classes of Circuits. 232-237
Geometrical Algorithms
- Jyh-Jong Fu, Richard C. T. Lee:
Voronoi Diagrams of Moving Points in the Plane. 238-254 - Subhas C. Nandy, Bhargab B. Bhattacharya, Sibabrata Ray:
Efficient algorithms for Identifying All Maximal Isothetic Empty Rectangles in VLSI Layout Design. 255-269 - Amitava Datta, G. D. S. Ramkumar:
On Some Largest Empty Orthoconvex Polygons in a Point Set. 270-285
Concurrency
- Marta Z. Kwiatkowska:
Defining Process Fairness for Non-Interleaving Concurrency. 286-300 - Rocco De Nicola, Gian-Luigi Ferrari:
Observational Logics and Concurrency Models. 301-315
Distributed Computing
- Anish Arora, Mohamed G. Gouda:
Distributed Reset (Extended Abstract). 316-331 - Peter Grønning, Thomas Qvist Nielsen, Hans Henrik Løvengreen:
Refinement and Composition of Transition-based Rely-Guarantee Specification with Auxiliary Variables. 332-348 - Tong-Ying Tony Juang, Subbarayan Venkatesan:
Efficient Algorithms for Crash Recovery in Distributed Systems. 349-361
Semantics
- Gianna Reggio:
A Non-Standard Inductive Semantics. 362-372 - Kurt Sieber:
Relating Full Abstraction Results for Different Programming Languages. 373-387
Invited Lectures in Honour of Prof. R. Narasimhan, TIFR, Bombay
- B. Chandrasekaran, N. Hari Narayanan:
Towards a Theory of Commonsense Visual Reasoning. 388-409 - Akshar Bharati, Rajeev Sangal, Vineet Chaitanya:
Natural Language Processing, Complexity Theory and Logic (Extended Abstract). 410-420
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-02-20 19:50 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
