The SCEAS System
Navigation Menu

Conferences in DBLP

Foundations of Software Technology and Theoretical Computer Science (FSTTCS) (fsttcs)
1993 (conf/fsttcs/1993)

  1. Juris Hartmanis
    Some Observations About the Nature of Computer Science. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1993, pp:1-12 [Conf]
  2. Steffen van Bakel
    Essential Intersection Type Assignment. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1993, pp:13-23 [Conf]
  3. Hassan Aït-Kaci, Jacques Garrigue
    Label-Selective lambda-Calculus Syntax and Confluence. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1993, pp:24-40 [Conf]
  4. Erik Barendsen, Sjaak Smetsers
    Conventional and Uniqueness Typing in Graph Rewrite Systems. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1993, pp:41-51 [Conf]
  5. Giuseppe Castagna
    A Meta-Language for Typed Object-Oriented Languages. [Citation Graph (1, 0)][DBLP]
    FSTTCS, 1993, pp:52-71 [Conf]
  6. Gérard Berry
    Preemption in Concurrent Systems. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1993, pp:72-93 [Conf]
  7. Sanjeev R. Kulkarni, Sanjoy K. Mitter, T. J. Richardson, John N. Tsitsiklis
    Local Versus Non-local Computation of Length of Digitized Curves. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1993, pp:94-103 [Conf]
  8. Klaus-Jörn Lange, Rolf Niedermeier
    Data-Independences of Parallel Random Access Machines. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1993, pp:104-113 [Conf]
  9. G. Aguzzi, U. Modigliani
    Proving Termination of Logic Programs by Transforming them into Equivalent Term Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1993, pp:114-124 [Conf]
  10. M. R. K. Krishna Rao
    Completeness of Hierarchical Combinations of term Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1993, pp:125-138 [Conf]
  11. Nachum Dershowitz, Subrata Mitra
    Higher-Order and Semantic Unification. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1993, pp:139-150 [Conf]
  12. David A. Basin, Seán Matthews
    A Conservative Extension of First-order Logic and Its Application to Theorem Proving. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1993, pp:151-160 [Conf]
  13. Peter J. Stuckey, S. Sudarshan
    Well-Founded Ordered Search (Extended Abstract). [Citation Graph (2, 0)][DBLP]
    FSTTCS, 1993, pp:161-172 [Conf]
  14. Y. S. Ramakrishna, Laura K. Dillon, Louise E. Moser, P. M. Melliar-Smith, G. Kutty
    A Real-Time Interval Logic and Its Decision Procedure. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1993, pp:173-192 [Conf]
  15. François Fages
    On the Semantics of Optimization Predicates in CLP Languages. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1993, pp:193-204 [Conf]
  16. Viswanath Ramachandran, Pascal Van Hentenryck
    Incremental Algorithms for Constraint Solving and Entailment over Rational Trees. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1993, pp:205-217 [Conf]
  17. Sumanta Guha, Ichiro Suzuki
    Proximity Problems and the Voronoi Diagram an a Rectilinear Plane with Rectangular Obstacles. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1993, pp:218-227 [Conf]
  18. 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. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1993, pp:228-237 [Conf]
  19. Venkatesh Radhakrishnan, Sven Oliver Krumke, Madhav V. Marathe, Daniel J. Rosenkrantz, S. S. Ravi
    Compact Location Problems. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1993, pp:238-247 [Conf]
  20. Magnús M. Halldórsson, Jaikumar Radhakrishnan, K. V. Subrahmanyam
    On Some Communication Complexity Problems Related to THreshold Functions. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1993, pp:248-259 [Conf]
  21. Felipe Cucker, Francesc Rosselló
    Recursiveness over the Complex Numbers is Time-Bounded. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1993, pp:260-267 [Conf]
  22. Ketan Mulmuley
    A lOwer Bound for Solvability of Polynomial Equations. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1993, pp:268-283 [Conf]
  23. Wolfgang Reif, Kurt Stenzel
    Reuse of Proofs in Software Verification. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1993, pp:284-293 [Conf]
  24. Theodore S. Norvell
    Induce-Statements and Induce-Expressions: Constructs for Inductive Programming. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1993, pp:294-305 [Conf]
  25. Christian Antoine, Bernard Le Goff, Jean-Eric Pin
    A Graphic Language Based on Timing Diagrams. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1993, pp:306-316 [Conf]
  26. R. Narasimhan
    Panel on Software Technology: Integrating Theory and Practice. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1993, pp:317- [Conf]
  27. Fahiem Bacchus, Adam J. Grove, Joseph Y. Halpern, Daphne Koller
    Generating Degrees of Belief from Statistical Information: An Overview. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1993, pp:318-325 [Conf]
  28. Allan Cheng, Javier Esparza, Jens Palsberg
    Complexity Results for 1-safe Nets. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1993, pp:326-337 [Conf]
  29. David Janin
    Some Results About Logical Descriptions of Non-Deterministic Behaviours. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1993, pp:338-347 [Conf]
  30. Ryszard Janicki, Maciej Koutny
    Order Structures and Generalisations of Szpilrajn's Theorem. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1993, pp:348-357 [Conf]
  31. K. Narayan Kumar, Paritosh K. Pandya
    ICSP and Its Relationship with ACSP and CSP. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1993, pp:358-372 [Conf]
  32. Kohei Honda, Nobuko Yoshida
    On Reduction-Based Semantics. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1993, pp:373-387 [Conf]
  33. Madhavan Mukund, Milind A. Sohoni
    Keeping Track of the Latest Gossip: Bounded Time-Stamps Suffice. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1993, pp:388-399 [Conf]
  34. Sudhanshu Aggarwal, Shay Kutten
    Time Optimal Self-Stabilizing Spanning Tree Algorithms. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1993, pp:400-410 [Conf]
  35. Arun K. Pujari
    Efficient Algorithm to Sort Linear Combinations of Arrays. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1993, pp:411-418 [Conf]
  36. Vijay K. Vaishnavi, D. Khanna
    A Simple File Structure for the Weighted Dictionary Problem. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1993, pp:419-435 [Conf]
  37. Devdatt P. Dubhashi, Kurt Mehlhorn, Desh Ranjan, Christian Thiel
    Searching, Sorting and Randomised Algorithms for Central Elements and Ideal Counting in Posets. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1993, pp:436-443 [Conf]
  38. Pushpak Bhattacharyya, G. Nagaraja
    Learning Classes of Regular and Linear Languages in Valiant's Learnability Framework. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1993, pp:444-454 [Conf]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002