The SCEAS System
Navigation Menu

Conferences in DBLP

IFIP International Conference on Theoretical Computer Science (IFIP TCS) (ifipTCS)
2002 (conf/ifipTCS/2002)

  1. Jozef Gruska, Hiroshi Imai, Keiji Matsumoto
    Power of Quantum Entanglement. [Citation Graph (0, 0)][DBLP]
    IFIP TCS, 2002, pp:3-22 [Conf]
  2. Jon M. Kleinberg
    Information Networks, Link Analysis, and Temporal Dynamics. [Citation Graph (0, 0)][DBLP]
    IFIP TCS, 2002, pp:23-25 [Conf]
  3. Jochen Alber, Jirí Fiala
    Geometric Separation and Exact Solutions for the Parameterized Independent Set Problem on Disk Graphs. [Citation Graph (0, 0)][DBLP]
    IFIP TCS, 2002, pp:26-37 [Conf]
  4. Nikhil Bansal, Zhen Liu, Arvind Sankar
    Bin-Packing with Fragile Objects. [Citation Graph (0, 0)][DBLP]
    IFIP TCS, 2002, pp:38-46 [Conf]
  5. Sergei Bespamyatnikh, Binay K. Bhattacharya, David G. Kirkpatrick, Michael Segal
    Lower and Upper Bounds for Tracking Mobile Users. [Citation Graph (0, 0)][DBLP]
    IFIP TCS, 2002, pp:47-58 [Conf]
  6. Alina Beygelzimer, Mitsunori Ogihara
    On the Enumerability of the Determinant and the Rank. [Citation Graph (0, 0)][DBLP]
    IFIP TCS, 2002, pp:59-70 [Conf]
  7. Douglas M. Blough, Mauro Leoncini, Giovanni Resta, Paolo Santi
    On the Symmetric Range Assignment Problem in Wireless Ad Hoc Networks. [Citation Graph (0, 0)][DBLP]
    IFIP TCS, 2002, pp:71-82 [Conf]
  8. Beate Bollig, Stephan Waack, Philipp Woelfel
    Parity Graph-driven Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication. [Citation Graph (0, 0)][DBLP]
    IFIP TCS, 2002, pp:83-94 [Conf]
  9. Vasco Brattka, Martin Ziegler
    Computability of Linear Equations. [Citation Graph (0, 0)][DBLP]
    IFIP TCS, 2002, pp:95-106 [Conf]
  10. Véronique Bruyère, Olivier Carton
    Hierarchy Among Automata on Linear Orderings. [Citation Graph (0, 0)][DBLP]
    IFIP TCS, 2002, pp:107-118 [Conf]
  11. Gruia Calinescu, Ion I. Mandoiu, Alexander Zelikovsky
    Symmetric Connectivity with Minimum Power Consumption in Radio Networks. [Citation Graph (0, 0)][DBLP]
    IFIP TCS, 2002, pp:119-130 [Conf]
  12. Zhao Chen
    A Modified Recursive Triangular Factorization for Cauchy-like Systems. [Citation Graph (0, 0)][DBLP]
    IFIP TCS, 2002, pp:131-142 [Conf]
  13. Mark Cieliebak, Thomas Erlebach, Zsuzsanna Lipták, Jens Stoye, Emo Welzl
    Algorithmic Complexity of Protein Identification: Searching in Weighted Strings. [Citation Graph (0, 0)][DBLP]
    IFIP TCS, 2002, pp:143-156 [Conf]
  14. Alessandro Dal Palù, Enrico Pontelli, Desh Ranjan
    An Efficient Parallel Pointer Machine Algorithm for the NCA Problem. [Citation Graph (0, 0)][DBLP]
    IFIP TCS, 2002, pp:157-168 [Conf]
  15. Marie Duflot, Laurent Fribourg, Claudine Picaronny
    Randomized Dining Philosophers without Fairness Assumption. [Citation Graph (0, 0)][DBLP]
    IFIP TCS, 2002, pp:169-180 [Conf]
  16. Alon Efrat, Sariel Har-Peled
    Guarding Galleries and Terrains. [Citation Graph (0, 0)][DBLP]
    IFIP TCS, 2002, pp:181-192 [Conf]
  17. Leszek Gasieniec, Igor Potapov
    Gossiping with Unit Messages in Known Radio Networks. [Citation Graph (0, 0)][DBLP]
    IFIP TCS, 2002, pp:193-205 [Conf]
  18. Nicolas Hanusse, Dimitris J. Kavvadias, Evangelos Kranakis, Danny Krizanc
    Memoryless Search Algorithms in a Network with Faulty Advice. [Citation Graph (0, 0)][DBLP]
    IFIP TCS, 2002, pp:206-216 [Conf]
  19. Lane A. Hemaspaandra, Mayur Thakur
    Lower Bounds and the Hardness of Counting Properties. [Citation Graph (0, 0)][DBLP]
    IFIP TCS, 2002, pp:217-229 [Conf]
  20. Matthew Hertz, Neil Immerman, J. Eliot B. Moss
    Framework for Analyzing Garbage Collection. [Citation Graph (0, 0)][DBLP]
    IFIP TCS, 2002, pp:230-242 [Conf]
  21. Christopher M. Homan, Mayur Thakur
    One-Way Permutations and Self-Witnessing Languages. [Citation Graph (0, 0)][DBLP]
    IFIP TCS, 2002, pp:243-254 [Conf]
  22. Klaus Jansen, Hu Zhang
    Approximation Algorithms for General Packing Problems with Modified Logarithmic Potential Function. [Citation Graph (0, 0)][DBLP]
    IFIP TCS, 2002, pp:255-266 [Conf]
  23. Grégory Lafitte
    On Randomness and Infinity. [Citation Graph (0, 0)][DBLP]
    IFIP TCS, 2002, pp:267-279 [Conf]
  24. Aris Pagourtzis, Paolo Penna, Konrad Schlude, Kathleen Steinhöfel, David Scot Taylor, Peter Widmayer
    Server Placements, Roman Domination and other Dominating Set Variants. [Citation Graph (0, 0)][DBLP]
    IFIP TCS, 2002, pp:280-291 [Conf]
  25. B. S. Panda, Sajal K. Das
    A Linear Time Algorithm for Finding Tree 3-Spanner on 2-Trees. [Citation Graph (0, 0)][DBLP]
    IFIP TCS, 2002, pp:292-309 [Conf]
  26. Jörg Rothe, Holger Spakowski, Jörg Vogel
    Exact Complexity of Exact-Four-Colorability and of the Winner Problem for Young Elections. [Citation Graph (0, 0)][DBLP]
    IFIP TCS, 2002, pp:310-322 [Conf]
  27. Tomoyuki Yamakami
    Quantum NP and Quantum Hierarchy. [Citation Graph (0, 0)][DBLP]
    IFIP TCS, 2002, pp:323-336 [Conf]
  28. Marius Zimand
    Probabilistically Checkable Proofs the Easy Way. [Citation Graph (0, 0)][DBLP]
    IFIP TCS, 2002, pp:337-351 [Conf]
  29. Andrew D. Gordon
    XML Web Services: The Global Computer? [Citation Graph (0, 0)][DBLP]
    IFIP TCS, 2002, pp:355- [Conf]
  30. Carl A. Gunter
    Micro Mobile Programs. [Citation Graph (0, 0)][DBLP]
    IFIP TCS, 2002, pp:356-369 [Conf]
  31. Patrick Baillot
    Checking Polynomial Time Complexity with Types. [Citation Graph (0, 0)][DBLP]
    IFIP TCS, 2002, pp:370-382 [Conf]
  32. Chiara Braghin, Agostino Cortesi, Riccardo Focardi, Steffen van Bakel
    Boundary Inference for Enforcing Security Policies in Mobile Ambients. [Citation Graph (0, 0)][DBLP]
    IFIP TCS, 2002, pp:383-395 [Conf]
  33. Aline Brum Loreto, Leila Ribeiro, Laira Vieira Toscani
    Decidability and Tractability of Problems in Object-Based Graph Grammars. [Citation Graph (0, 0)][DBLP]
    IFIP TCS, 2002, pp:396-408 [Conf]
  34. Hana Chockler, Orna Kupferman
    Coverage of Implementations by Simulating Specifications. [Citation Graph (0, 0)][DBLP]
    IFIP TCS, 2002, pp:409-421 [Conf]
  35. Giovanni Conforti, Orlando Ferrara, Giorgio Ghelli
    TQL Algebra and its Implementation. [Citation Graph (0, 0)][DBLP]
    IFIP TCS, 2002, pp:422-434 [Conf]
  36. Dino Distefano, Arend Rensink, Joost-Pieter Katoen
    Model Checking Birth and Death. [Citation Graph (0, 0)][DBLP]
    IFIP TCS, 2002, pp:435-447 [Conf]
  37. Matthew Fluet, Riccardo Pucella
    Phantom Types and Subtyping. [Citation Graph (0, 0)][DBLP]
    IFIP TCS, 2002, pp:448-460 [Conf]
  38. Rachid Guerraoui, Petr Kouznetsov
    On the Weakest Failure Detector for Non-Blocking Atomic Commit. [Citation Graph (0, 0)][DBLP]
    IFIP TCS, 2002, pp:461-473 [Conf]
  39. Martin Hyland, Gordon D. Plotkin, John Power
    Combining Computational Effects: commutativity & sum. [Citation Graph (0, 0)][DBLP]
    IFIP TCS, 2002, pp:474-484 [Conf]
  40. Salvatore La Torre, Supratik Mukhopadhyay, Aniello Murano
    Optimal-Reachability and Control for Acyclic Weighted Timed Automata. [Citation Graph (0, 0)][DBLP]
    IFIP TCS, 2002, pp:485-497 [Conf]
  41. Daniel Leivant
    Substructural Verification and Computational Feasibility. [Citation Graph (0, 0)][DBLP]
    IFIP TCS, 2002, pp:498-510 [Conf]
  42. Daniel J. Dougherty, Stephane Lengrand, Pierre Lescanne
    An Improved System of Intersection Types for Explicit Substitutions. [Citation Graph (0, 0)][DBLP]
    IFIP TCS, 2002, pp:511-523 [Conf]
  43. Fabio Martinelli
    About Compositional Analysis of Pi-Calculus Processes. [Citation Graph (0, 0)][DBLP]
    IFIP TCS, 2002, pp:524-536 [Conf]
  44. Catuscia Palamidessi, Oltea Mihaela Herescu
    A Randomized Distributed Encoding of the Pi-Calculus with Mixed Choice. [Citation Graph (0, 0)][DBLP]
    IFIP TCS, 2002, pp:537-549 [Conf]
  45. Iain Phillips, Maria Grazia Vigliotti
    On Reduction Semantics for the Push and Pull Ambitent Calculus. [Citation Graph (0, 0)][DBLP]
    IFIP TCS, 2002, pp:550-562 [Conf]
  46. Alan Schmitt
    Safe Dynamic Binding in the Join Calculus. [Citation Graph (0, 0)][DBLP]
    IFIP TCS, 2002, pp:563-575 [Conf]
  47. Olivier Serre
    Vectorial Languages and Linear Temporal Logic. [Citation Graph (0, 0)][DBLP]
    IFIP TCS, 2002, pp:576-587 [Conf]
  48. Scott D. Stoller
    A Bound on Attacks on Authentication Protocols. [Citation Graph (0, 0)][DBLP]
    IFIP TCS, 2002, pp:588-600 [Conf]
  49. Xiaogang Zhang, John Potter
    Responsive Bisimulation. [Citation Graph (0, 0)][DBLP]
    IFIP TCS, 2002, pp:601-612 [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