The SCEAS System
Navigation Menu

Conferences in DBLP

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

  1. Assigning Papers to Referees. [Citation Graph (, )][DBLP]

  2. Algorithmic Game Theory: A Snapshot. [Citation Graph (, )][DBLP]

  3. SDP-Based Algorithms for Maximum Independent Set Problems on Hypergraphs. [Citation Graph (, )][DBLP]

  4. Correlation Clustering Revisited: The "True" Cost of Error Minimization Problems. [Citation Graph (, )][DBLP]

  5. Sorting and Selection with Imprecise Comparisons. [Citation Graph (, )][DBLP]

  6. Fast FAST. [Citation Graph (, )][DBLP]

  7. Bounds on the Size of Small Depth Circuits for Approximating Majority. [Citation Graph (, )][DBLP]

  8. Counting Subgraphs via Homomorphisms. [Citation Graph (, )][DBLP]

  9. External Sampling. [Citation Graph (, )][DBLP]

  10. Functional Monitoring without Monotonicity. [Citation Graph (, )][DBLP]

  11. De-amortized Cuckoo Hashing: Provable Worst-Case Performance and Experimental Results. [Citation Graph (, )][DBLP]

  12. Towards a Study of Low-Complexity Graphs. [Citation Graph (, )][DBLP]

  13. Decidability of Conjugacy of Tree-Shifts of Finite Type. [Citation Graph (, )][DBLP]

  14. Improved Bounds for Speed Scaling in Devices Obeying the Cube-Root Rule. [Citation Graph (, )][DBLP]

  15. Competitive Analysis of Aggregate Max in Windowed Streaming. [Citation Graph (, )][DBLP]

  16. Faster Regular Expression Matching. [Citation Graph (, )][DBLP]

  17. A Fast and Simple Parallel Algorithm for the Monotone Duality Problem. [Citation Graph (, )][DBLP]

  18. Unconditional Lower Bounds against Advice. [Citation Graph (, )][DBLP]

  19. Approximating Decision Trees with Multiway Branches. [Citation Graph (, )][DBLP]

  20. Annotations in Data Streams. [Citation Graph (, )][DBLP]

  21. The Tile Complexity of Linear Assemblies. [Citation Graph (, )][DBLP]

  22. A Graph Reduction Step Preserving Element-Connectivity and Applications. [Citation Graph (, )][DBLP]

  23. Approximating Matches Made in Heaven. [Citation Graph (, )][DBLP]

  24. Strong and Pareto Price of Anarchy in Congestion Games. [Citation Graph (, )][DBLP]

  25. A Better Algorithm for Random k-SAT. [Citation Graph (, )][DBLP]

  26. Exact and Approximate Bandwidth. [Citation Graph (, )][DBLP]

  27. Approximation Algorithms via Structural Results for Apex-Minor-Free Graphs. [Citation Graph (, )][DBLP]

  28. Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs. [Citation Graph (, )][DBLP]

  29. On Cartesian Trees and Range Minimum Queries. [Citation Graph (, )][DBLP]

  30. Applications of a Splitting Trick. [Citation Graph (, )][DBLP]

  31. Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness. [Citation Graph (, )][DBLP]

  32. Incompressibility through Colors and IDs. [Citation Graph (, )][DBLP]

  33. Partition Arguments in Multiparty Communication Complexity. [Citation Graph (, )][DBLP]

  34. High Complexity Tilings with Sparse Errors. [Citation Graph (, )][DBLP]

  35. Tight Bounds for the Cover Time of Multiple Random Walks. [Citation Graph (, )][DBLP]

  36. Online Computation with Advice. [Citation Graph (, )][DBLP]

  37. Dynamic Succinct Ordered Trees. [Citation Graph (, )][DBLP]

  38. Universal Succinct Representations of Trees? [Citation Graph (, )][DBLP]

  39. Distortion Is Fixed Parameter Tractable. [Citation Graph (, )][DBLP]

  40. Towards Optimal Range Medians. [Citation Graph (, )][DBLP]

  41. B-Treaps: A Uniquely Represented Alternative to B-Trees. [Citation Graph (, )][DBLP]

  42. Testing Fourier Dimensionality and Sparsity. [Citation Graph (, )][DBLP]

  43. Revisiting the Direct Sum Theorem and Space Lower Bounds in Random Order Streams. [Citation Graph (, )][DBLP]

  44. Wireless Communication Is in APX. [Citation Graph (, )][DBLP]

  45. The Ehrenfeucht-Silberger Problem. [Citation Graph (, )][DBLP]

  46. Applications of Effective Probability Theory to Martin-Löf Randomness. [Citation Graph (, )][DBLP]

  47. An EPTAS for Scheduling Jobs on Uniform Processors: Using an MILP Relaxation with a Constant Number of Integral Variables. [Citation Graph (, )][DBLP]

  48. Popular Mixed Matchings. [Citation Graph (, )][DBLP]

  49. Factoring Groups Efficiently. [Citation Graph (, )][DBLP]

  50. On Finding Dense Subgraphs. [Citation Graph (, )][DBLP]

  51. Learning Halfspaces with Malicious Noise. [Citation Graph (, )][DBLP]

  52. General Scheme for Perfect Quantum Network Coding with Free Classical Communication. [Citation Graph (, )][DBLP]

  53. Greedy D{\ensuremath{\Delta}}-Approximation Algorithm for Covering with Arbitrary Constraints and Submodular Cost. [Citation Graph (, )][DBLP]

  54. Limits and Applications of Group Algebras for Parameterized Problems. [Citation Graph (, )][DBLP]

  55. Sleep with Guilt and Work Faster to Minimize Flow Plus Energy. [Citation Graph (, )][DBLP]

  56. Improved Bounds for Flow Shop Scheduling. [Citation Graph (, )][DBLP]

  57. A 3/2-Approximation Algorithm for General Stable Marriage. [Citation Graph (, )][DBLP]

  58. Limiting Negations in Formulas. [Citation Graph (, )][DBLP]

  59. Fast Polynomial-Space Algorithms Using Möbius Inversion: Improving on Steiner Tree and Related Problems. [Citation Graph (, )][DBLP]

  60. Superhighness and Strong Jump Traceability. [Citation Graph (, )][DBLP]

  61. Amortized Communication Complexity of Distributions. [Citation Graph (, )][DBLP]

  62. The Number of Symbol Comparisons in QuickSort and QuickSelect. [Citation Graph (, )][DBLP]

  63. Computing the Girth of a Planar Graph in O(n logn) Time. [Citation Graph (, )][DBLP]

  64. Elimination Graphs. [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