The SCEAS System
Navigation Menu

Conferences in DBLP

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

  1. Micha Sharir
    Recent Developments in the Theory of Arrangements of Surfaces. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1999, pp:1-20 [Conf]
  2. Srinivas Aluru, Fatih Erdogan Sevilgen
    Dynamic Compressed Hypertoctrees with Application to the N-Body Problem. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1999, pp:21-33 [Conf]
  3. Jeet Chaudhuri, Subhas C. Nandy
    Largest Empty Rectangle among a Point Set. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1999, pp:34-46 [Conf]
  4. Philippe Herrmann
    Renaming is Necessary in Timed Regular Expressions. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1999, pp:47-59 [Conf]
  5. Deepak D'Souza, P. S. Thiagarajan
    Product Interval Automata: A Subclass of Timed Automata. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1999, pp:60-71 [Conf]
  6. Rolf Fagerberg
    The Complexity of Rebalancing a Binary Serach Tree. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1999, pp:72-83 [Conf]
  7. Erik D. Demaine, J. Ian Munro
    Fast Allocation and Deallocation with an Improved Buddy System. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1999, pp:84-96 [Conf]
  8. Christof Löding
    Optimal Bounds for Transformations of omega-Automata. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1999, pp:97-109 [Conf]
  9. Thomas Wilke
    CTL+ is Exponentially more Succinct than CTL. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1999, pp:110-121 [Conf]
  10. Martín Abadi, Cédric Fournet, Georges Gonthier
    A Top-Down Look at a Secure Message. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1999, pp:122-141 [Conf]
  11. Jürgen Dix, Karl Schlechta
    Explaining Updates by Minimal Sums. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1999, pp:142-154 [Conf]
  12. James J. Lu, Neil V. Murray, Erik Rosenthal
    A Foundation for Hybrid Knowledge Bases. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1999, pp:155-167 [Conf]
  13. David von Oheimb
    Hoare Logic for Mutual Recursion and Local Variables. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1999, pp:168-180 [Conf]
  14. Jean-Jacques Lévy, Luc Maranget
    Explicit Substitutions and Programming Languages. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1999, pp:181-200 [Conf]
  15. Luca Becchetti, Miriam Di Ianni, Alberto Marchetti-Spaccamela
    Approximation Algorithms for Routing and Call Scheduling in All-Optical Chains and Rings. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1999, pp:201-212 [Conf]
  16. Naveen Garg, Sachin Jain, Chaitanya Swamy
    A Randomized Algorithm for Flow Shop Scheduling. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1999, pp:213-218 [Conf]
  17. Ilaria Castellani, Madhavan Mukund, P. S. Thiagarajan
    Synthesizing Distributed Transition Systems from Global Specification. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1999, pp:219-231 [Conf]
  18. Supratik Mukhopadhyay, Andreas Podelski
    Beyond Region Graphs: Symbolic Forward Analysis of Timed Automata. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1999, pp:232-244 [Conf]
  19. Nicole Bidoit, Sandra de Amo
    Implicit Temporal Query Languages: Towards Completeness. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1999, pp:245-257 [Conf]
  20. Matthias Baaz, Agata Ciabattoni, Christian G. Fermüller, Helmut Veith
    On the Undecidability of some Sub-Classical First-Order Logics. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1999, pp:258-268 [Conf]
  21. Lila Kari, Mark Daley, Greg Gloor, Rani Siromoney, Laura F. Landweber
    How to Compute with DNA. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1999, pp:269-282 [Conf]
  22. L. Sunil Chandran
    A High Girth Graph Construction and a Lower Bound for Hitting Set Size for Combinatorial Rectangles. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1999, pp:283-290 [Conf]
  23. Jörg Schwerdt, Michiel H. M. Smid, Ravi Janardan, Eric Johnson, Jayanth Majhi
    Protecting Facets in Layered Manufacturing. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1999, pp:291-303 [Conf]
  24. Roberto M. Amadio, Gérard Boudol, Cédric Lhoussaine
    The Receptive Distributed pi-Calculus (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1999, pp:304-315 [Conf]
  25. Zoltán Ésik, Satoshi Okawa
    Series and Parallel Operations on Pomsets. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1999, pp:316-328 [Conf]
  26. Achour Mostéfaoui, Michel Raynal
    Unreliable Failure Detectors with Limited Scope Accuracy and an Application to Consensus. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1999, pp:329-340 [Conf]
  27. Seinosuke Toda
    Graph Isomorphism: Its Complexity and Algorithms (Abstract). [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1999, pp:341- [Conf]
  28. Martin Sauerhoff
    Computing with Restricted Nondeterminism: The Dependence of the OBDD Size on the Number of Nondeterministic Variables. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1999, pp:342-355 [Conf]
  29. Detlef Sieling
    Lower Bounds for Linear Transformed OBDDs and FBDDs (Extende Abstract). [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1999, pp:356-368 [Conf]
  30. Michael Huth
    A Unifying Framework for Model Checking Labeled Kripke Structures, Modal Transition Systems and Interval Transition Systems. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1999, pp:369-380 [Conf]
  31. Flavio Corradini, Rocco De Nicola, Anna Labella
    Graded Modalities and Resource Bisimulation. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1999, pp:381-393 [Conf]
  32. Christian Schindelhauer, Andreas Jakoby
    The Non-Recursive Power of Erroneous Computation. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1999, pp:394-406 [Conf]
  33. Tomoyuki Yamakami
    Analysis of Quantum Functions (Preliminary Version). [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1999, pp:407-419 [Conf]
  34. Bernhard Heinemann
    On Sets Growing Continously. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1999, pp:420-431 [Conf]
  35. Ron van der Meyden, Nikolay V. Shilov
    Model Checking Knowledge and Time in Systems with Perfect Recall (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1999, pp:432-445 [Conf]
  36. Kurt Mehlhorn
    The Engineering of some Bipartite Matching Programs. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1999, pp:446-449 [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