The SCEAS System
Navigation Menu

Conferences in DBLP

International Colloquium on Automata, Languages and Programming (ICALP) (icalp)
2009 (conf/icalp/2009-2)

  1. A Survey of Stochastic Games with Limsup and Liminf Objectives. [Citation Graph (, )][DBLP]

  2. Tractable Optimization Problems through Hypergraph-Based Structural Restrictions. [Citation Graph (, )][DBLP]

  3. Deciding Safety Properties in Infinite-State Pi-Calculus via Behavioural Types. [Citation Graph (, )][DBLP]

  4. When Are Timed Automata Determinizable? [Citation Graph (, )][DBLP]

  5. Faithful Loops for Aperiodic E-Ordered Monoids. [Citation Graph (, )][DBLP]

  6. Boundedness of Monadic Second-Order Formulae over Finite Words. [Citation Graph (, )][DBLP]

  7. Semilinear Program Feasibility. [Citation Graph (, )][DBLP]

  8. Floats and Ropes: A Case Study for Formal Numerical Program Verification. [Citation Graph (, )][DBLP]

  9. Reachability in Stochastic Timed Games. [Citation Graph (, )][DBLP]

  10. Equations Defining the Polynomial Closure of a Lattice of Regular Languages. [Citation Graph (, )][DBLP]

  11. Approximating Markov Processes by Averaging. [Citation Graph (, )][DBLP]

  12. The Theory of Stabilisation Monoids and Regular Cost Functions. [Citation Graph (, )][DBLP]

  13. A Tight Lower Bound for Determinization of Transition Labeled Büchi Automata. [Citation Graph (, )][DBLP]

  14. On Constructor Rewrite Systems and the Lambda-Calculus. [Citation Graph (, )][DBLP]

  15. On Regular Temporal Logics with Past, . [Citation Graph (, )][DBLP]

  16. Forward Analysis for WSTS, Part II: Complete WSTS. [Citation Graph (, )][DBLP]

  17. Qualitative Concurrent Stochastic Games with Imperfect Information. [Citation Graph (, )][DBLP]

  18. Diagrammatic Confluence and Completion. [Citation Graph (, )][DBLP]

  19. Complexity of Model Checking Recursion Schemes for Fragments of the Modal Mu-Calculus. [Citation Graph (, )][DBLP]

  20. LTL Path Checking Is Efficiently Parallelizable. [Citation Graph (, )][DBLP]

  21. An Explicit Formula for the Free Exponential Modality of Linear Logic. [Citation Graph (, )][DBLP]

  22. Decidability of the Guarded Fragment with the Transitive Closure. [Citation Graph (, )][DBLP]

  23. Weak Alternating Timed Automata. [Citation Graph (, )][DBLP]

  24. A Decidable Characterization of Locally Testable Tree Languages. [Citation Graph (, )][DBLP]

  25. The Complexity of Nash Equilibria in Simple Stochastic Multiplayer Games. [Citation Graph (, )][DBLP]

  26. Google's Auction for TV Ads. [Citation Graph (, )][DBLP]

  27. Graph Sparsification in the Semi-streaming Model. [Citation Graph (, )][DBLP]

  28. Sort Me If You Can: How to Sort Dynamic Data. [Citation Graph (, )][DBLP]

  29. Maximum Bipartite Flow in Networks with Adaptive Channel Width. [Citation Graph (, )][DBLP]

  30. Mediated Population Protocols. [Citation Graph (, )][DBLP]

  31. Rumor Spreading in Social Networks. [Citation Graph (, )][DBLP]

  32. MANETS: High Mobility Can Make Up for Low Transmission Power. [Citation Graph (, )][DBLP]

  33. Multiple Random Walks and Interacting Particle Systems. [Citation Graph (, )][DBLP]

  34. Derandomizing Random Walks in Undirected Graphs Using Locally Fair Exploration Strategies. [Citation Graph (, )][DBLP]

  35. On a Network Generalization of the Minmax Theorem. [Citation Graph (, )][DBLP]

  36. Rate-Based Transition Systems for Stochastic Process Calculi. [Citation Graph (, )][DBLP]

  37. Improved Algorithms for Latency Minimization in Wireless Networks. [Citation Graph (, )][DBLP]

  38. Efficient Methods for Selfish Network Design. [Citation Graph (, )][DBLP]

  39. Smoothed Analysis of Balancing Networks. [Citation Graph (, )][DBLP]

  40. Names Trump Malice: Tiny Mobile Agents Can Tolerate Byzantine Failures. [Citation Graph (, )][DBLP]

  41. Multi-armed Bandits with Metric Switching Costs. [Citation Graph (, )][DBLP]

  42. Algorithms for Secretary Problems on Graphs and Hypergraphs. [Citation Graph (, )][DBLP]

  43. Leader Election in Ad Hoc Radio Networks: A Keen Ear Helps. [Citation Graph (, )][DBLP]

  44. Secure Function Collection with Sublinear Storage. [Citation Graph (, )][DBLP]

  45. Worst-Case Efficiency Analysis of Queueing Disciplines. [Citation Graph (, )][DBLP]

  46. On Observing Dynamic Prioritised Actions in SOC. [Citation Graph (, )][DBLP]

  47. A Distributed and Oblivious Heap. [Citation Graph (, )][DBLP]

  48. Proportional Response Dynamics in the Fisher Market. [Citation Graph (, )][DBLP]

System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
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 [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002