The SCEAS System
Navigation Menu

Conferences in DBLP

International Colloquium on Automata, Languages and Programming (ICALP) (icalp)
2008 (conf/icalp/2008-1)

  1. Graph Structure and Monadic Second-Order Logic: Language Theoretical Aspects. [Citation Graph (, )][DBLP]

  2. Internet Ad Auctions: Insights and Directions. [Citation Graph (, )][DBLP]

  3. The Complexity of Boolean Formula Minimization. [Citation Graph (, )][DBLP]

  4. Optimal Cryptographic Hardness of Learning Monotone Functions. [Citation Graph (, )][DBLP]

  5. On Berge Multiplication for Monotone Boolean Dualization. [Citation Graph (, )][DBLP]

  6. Diagonal Circuit Identity Testing and Lower Bounds. [Citation Graph (, )][DBLP]

  7. Cell-Probe Proofs and Nondeterministic Cell-Probe Complexity. [Citation Graph (, )][DBLP]

  8. Constructing Efficient Dictionaries in Close to Sorting Time. [Citation Graph (, )][DBLP]

  9. On List Update with Locality of Reference. [Citation Graph (, )][DBLP]

  10. A New Combinatorial Approach for Sparse Graph Problems. [Citation Graph (, )][DBLP]

  11. How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs). [Citation Graph (, )][DBLP]

  12. Networks Become Navigable as Nodes Move and Forget. [Citation Graph (, )][DBLP]

  13. Fast Distributed Computation of Cuts Via Random Circulations. [Citation Graph (, )][DBLP]

  14. Finding a Maximum Matching in a Sparse Random Graph in O(n) Expected Time. [Citation Graph (, )][DBLP]

  15. Function Evaluation Via Linear Programming in the Priced Information Model. [Citation Graph (, )][DBLP]

  16. Improved Approximation Algorithms for Budgeted Allocations. [Citation Graph (, )][DBLP]

  17. The Travelling Salesman Problem in Bounded Degree Graphs. [Citation Graph (, )][DBLP]

  18. Treewidth Computation and Extremal Combinatorics. [Citation Graph (, )][DBLP]

  19. Fast Scheduling of Weighted Unit Jobs with Release Times and Deadlines. [Citation Graph (, )][DBLP]

  20. Approximation Algorithms for Scheduling Parallel Jobs: Breaking the Approximation Ratio of 2. [Citation Graph (, )][DBLP]

  21. A PTAS for Static Priority Real-Time Scheduling with Resource Augmentation. [Citation Graph (, )][DBLP]

  22. Optimal Monotone Encodings. [Citation Graph (, )][DBLP]

  23. Polynomial-Time Construction of Linear Network Coding. [Citation Graph (, )][DBLP]

  24. Complexity of Decoding Positive-Rate Reed-Solomon Codes. [Citation Graph (, )][DBLP]

  25. Computational Complexity of the Distance Constrained Labeling Problem for Trees (Extended Abstract). [Citation Graph (, )][DBLP]

  26. The Randomized Coloring Procedure with Symmetry-Breaking. [Citation Graph (, )][DBLP]

  27. The Local Nature of List Colorings for Graphs of High Girth. [Citation Graph (, )][DBLP]

  28. Approximating List-Coloring on a Fixed Surface. [Citation Graph (, )][DBLP]

  29. Asymptotically Optimal Hitting Sets Against Polynomials. [Citation Graph (, )][DBLP]

  30. The Smoothed Complexity of Edit Distance. [Citation Graph (, )][DBLP]

  31. Randomized Self-assembly for Approximate Shapes. [Citation Graph (, )][DBLP]

  32. Succinct Data Structures for Retrieval and Approximate Membership (Extended Abstract). [Citation Graph (, )][DBLP]

  33. Competitive Weighted Matching in Transversal Matroids. [Citation Graph (, )][DBLP]

  34. Scheduling for Speed Bounded Processors. [Citation Graph (, )][DBLP]

  35. Faster Algorithms for Incremental Topological Ordering. [Citation Graph (, )][DBLP]

  36. Dynamic Normal Forms and Dynamic Characteristic Polynomial. [Citation Graph (, )][DBLP]

  37. Algorithms for epsilon-Approximations of Terrains. [Citation Graph (, )][DBLP]

  38. An Approximation Algorithm for Binary Searching in Trees. [Citation Graph (, )][DBLP]

  39. Algorithms for 2-Route Cut Problems. [Citation Graph (, )][DBLP]

  40. The Two-Edge Connectivity Survivable Network Problem in Planar Graphs. [Citation Graph (, )][DBLP]

  41. Efficiently Testing Sparse GF(2) Polynomials. [Citation Graph (, )][DBLP]

  42. Testing Properties of Sets of Points in Metric Spaces. [Citation Graph (, )][DBLP]

  43. An Expansion Tester for Bounded Degree Graphs. [Citation Graph (, )][DBLP]

  44. Property Testing on k-Vertex-Connectivity of Graphs. [Citation Graph (, )][DBLP]

  45. Almost 2-SAT Is Fixed-Parameter Tractable (Extended Abstract). [Citation Graph (, )][DBLP]

  46. On Problems without Polynomial Kernels (Extended Abstract). [Citation Graph (, )][DBLP]

  47. Faster Algebraic Algorithms for Path and Packing Problems. [Citation Graph (, )][DBLP]

  48. Understanding the Complexity of Induced Subgraph Isomorphisms. [Citation Graph (, )][DBLP]

  49. Spanners in Sparse Graphs. [Citation Graph (, )][DBLP]

  50. Distance Oracles for Unweighted Graphs: Breaking the Quadratic Barrier with Constant Additive Error. [Citation Graph (, )][DBLP]

  51. All-Pairs Shortest Paths with a Sublinear Additive Error. [Citation Graph (, )][DBLP]

  52. Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations. [Citation Graph (, )][DBLP]

  53. The Complexity of the Counting Constraint Satisfaction Problem. [Citation Graph (, )][DBLP]

  54. On the Hardness of Losing Weight. [Citation Graph (, )][DBLP]

  55. Product Theorems Via Semidefinite Programming. [Citation Graph (, )][DBLP]

  56. Sound 3-Query PCPPs Are Long. [Citation Graph (, )][DBLP]

  57. Approximative Methods for Monotone Systems of Min-Max-Polynomial Equations. [Citation Graph (, )][DBLP]

  58. Recursive Stochastic Games with Positive Rewards. [Citation Graph (, )][DBLP]

  59. Complementation, Disambiguation, and Determinization of Büchi Automata Unified. [Citation Graph (, )][DBLP]

  60. Tree Projections: Hypergraph Games and Minimality. [Citation Graph (, )][DBLP]

  61. Explicit Non-adaptive Combinatorial Group Testing Schemes. [Citation Graph (, )][DBLP]

  62. Tight Lower Bounds for Multi-pass Stream Computation Via Pass Elimination. [Citation Graph (, )][DBLP]

  63. Impossibility of a Quantum Speed-Up with a Faulty Oracle. [Citation Graph (, )][DBLP]

  64. Superpolynomial Speedups Based on Almost Any Quantum Circuit. [Citation Graph (, )][DBLP]

  65. The Speed of Convergence in Congestion Games under Best-Response Dynamics. [Citation Graph (, )][DBLP]

  66. Uniform Budgets and the Envy-Free Pricing Problem. [Citation Graph (, )][DBLP]

  67. Bayesian Combinatorial Auctions. [Citation Graph (, )][DBLP]

  68. Truthful Unification Framework for Packing Integer Programs with Choices. [Citation Graph (, )][DBLP]

  69. Upper Bounds on the Noise Threshold for Fault-Tolerant Quantum Computing. [Citation Graph (, )][DBLP]

  70. Finding Optimal Flows Efficiently. [Citation Graph (, )][DBLP]

  71. Optimal Quantum Adversary Lower Bounds for Ordered Search. [Citation Graph (, )][DBLP]

  72. Quantum SAT for a Qutrit-Cinquit Pair Is QMA1-Complete. [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