The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Harald Räcke: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Valentina Damerow, Friedhelm Meyer auf der Heide, Harald Räcke, Christian Scheideler, Christian Sohler
    Smoothed Motion Complexity. [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:161-171 [Conf]
  2. Harald Räcke, Christian Sohler, Matthias Westermann
    Online Scheduling for Sorting Buffers. [Citation Graph (0, 0)][DBLP]
    ESA, 2002, pp:820-832 [Conf]
  3. Harald Räcke
    Minimizing Congestion in General Networks. [Citation Graph (0, 0)][DBLP]
    FOCS, 2002, pp:43-52 [Conf]
  4. Micah Adler, Harald Räcke, Naveen Sivadasan, Christian Sohler, Berthold Vöcking
    Randomized Pursuit-Evasion in Graphs. [Citation Graph (0, 0)][DBLP]
    ICALP, 2002, pp:901-912 [Conf]
  5. Mihai Badoiu, Kedar Dhamdhere, Anupam Gupta, Yuri Rabinovich, Harald Räcke, R. Ravi, Anastasios Sidiropoulos
    Approximation algorithms for low-distortion embeddings into low-dimensional spaces. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:119-128 [Conf]
  6. Shuchi Chawla, Anupam Gupta, Harald Räcke
    Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:102-111 [Conf]
  7. Kedar Dhamdhere, Anupam Gupta, Harald Räcke
    Improved embeddings of graph metrics into random trees. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:61-69 [Conf]
  8. Anupam Gupta, Mohammad Taghi Hajiaghayi, Harald Räcke
    Oblivious network design. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:970-979 [Conf]
  9. Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Tom Leighton, Harald Räcke
    Oblivious routing on node-capacitated and directed graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:782-790 [Conf]
  10. Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Frank Thomson Leighton, Harald Räcke
    New lower bounds for oblivious routing in undirected graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:918-927 [Conf]
  11. Harald Räcke, Adi Rosén
    Distributed online call control on general networks. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:791-800 [Conf]
  12. Konstantin Andreev, Harald Räcke
    Balanced graph partitioning. [Citation Graph (0, 0)][DBLP]
    SPAA, 2004, pp:120-124 [Conf]
  13. Marcin Bienkowski, Miroslaw Korzeniowski, Harald Räcke
    A practical algorithm for constructing oblivious routing schemes. [Citation Graph (0, 0)][DBLP]
    SPAA, 2003, pp:24-33 [Conf]
  14. Friedhelm Meyer auf der Heide, Harald Räcke, Matthias Westermann
    Data management in hierarchical bus networks. [Citation Graph (0, 0)][DBLP]
    SPAA, 2000, pp:109-118 [Conf]
  15. Christof Krick, Friedhelm Meyer auf der Heide, Harald Räcke, Berthold Vöcking, Matthias Westermann
    Data Management in Networks: Experimental Evaluation of a Provably Good Strategy. [Citation Graph (0, 0)][DBLP]
    SPAA, 1999, pp:165-174 [Conf]
  16. Christof Krick, Harald Räcke, Matthias Westermann
    Approximation algorithms for data management in networks. [Citation Graph (0, 0)][DBLP]
    SPAA, 2001, pp:237-246 [Conf]
  17. Yossi Azar, Edith Cohen, Amos Fiat, Haim Kaplan, Harald Räcke
    Optimal oblivious routing in polynomial time. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:383-388 [Conf]
  18. Simon Fischer, Harald Räcke, Berthold Vöcking
    Fast convergence to Wardrop equilibria by adaptive sampling methods. [Citation Graph (0, 0)][DBLP]
    STOC, 2006, pp:653-662 [Conf]
  19. Mohammad Taghi Hajiaghayi, Jeong Han Kim, Tom Leighton, Harald Räcke
    Oblivious routing in directed graphs with random demands. [Citation Graph (0, 0)][DBLP]
    STOC, 2005, pp:193-201 [Conf]
  20. Jens Krokowski, Harald Räcke, Christian Sohler, Matthias Westermann
    Reducing State Changes with a Pipeline Buffer. [Citation Graph (0, 0)][DBLP]
    VMV, 2004, pp:217- [Conf]
  21. Micah Adler, Harald Räcke, Naveen Sivadasan, Christian Sohler, Berthold Vöcking
    Randomized Pursuit-Evasion In Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2003, v:12, n:3, pp:- [Journal]
  22. Mohammad Taghi Hajiaghayi, Harald Räcke
    An O(sqrt(n))-approximation algorithm for directed sparsest cut. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2006, v:97, n:4, pp:156-160 [Journal]
  23. Harald Räcke
    Datenverwaltung und Routing in allgemeinen Netzwerken. [Citation Graph (0, 0)][DBLP]
    it - Information Technology, 2005, v:47, n:4, pp:232-234 [Journal]
  24. Yossi Azar, Edith Cohen, Amos Fiat, Haim Kaplan, Harald Räcke
    Optimal oblivious routing in polynomial time. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2004, v:69, n:3, pp:383-394 [Journal]
  25. Christof Krick, Friedhelm Meyer auf der Heide, Harald Räcke, Berthold Vöcking, Matthias Westermann
    Data Management in Networks: Experimental Evaluation of a Provably Good Strategy. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2002, v:35, n:2, pp:217-245 [Journal]
  26. Christof Krick, Harald Räcke, Matthias Westermann
    Approximation Algorithms for Data Management in Networks. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2003, v:36, n:5, pp:497-519 [Journal]
  27. Matthias Englert, Harald Räcke, Matthias Westermann
    Reordering buffers for general metric spaces. [Citation Graph (0, 0)][DBLP]
    STOC, 2007, pp:556-564 [Conf]
  28. Konstantin Andreev, Harald Räcke
    Balanced Graph Partitioning. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2006, v:39, n:6, pp:929-939 [Journal]

  29. Vertex Sparsifiers: New Results from Old Techniques. [Citation Graph (, )][DBLP]


  30. Survey on Oblivious Routing Strategies. [Citation Graph (, )][DBLP]


  31. Oblivious Routing for the Lp-norm. [Citation Graph (, )][DBLP]


  32. Oblivious interference scheduling. [Citation Graph (, )][DBLP]


  33. Minimizing average latency in oblivious routing. [Citation Graph (, )][DBLP]


  34. Approximation algorithms for time-constrained scheduling on line networks. [Citation Graph (, )][DBLP]


  35. Optimal hierarchical decompositions for congestion minimization in networks. [Citation Graph (, )][DBLP]


  36. Vertex Sparsifiers: New Results from Old Techniques [Citation Graph (, )][DBLP]


Search in 0.005secs, Finished in 0.007secs
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