The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Christian Scheideler: [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. Friedhelm Meyer auf der Heide, Christian Scheideler
    Routing with Bounded Buffers and Hot-Potato Routing in Vertex-Symmetric Networks. [Citation Graph (0, 0)][DBLP]
    ESA, 1995, pp:341-354 [Conf]
  3. Baruch Awerbuch, Petra Berenbrink, André Brinkmann, Christian Scheideler
    Simple Routing Strategies for Adversarial Systems. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:158-167 [Conf]
  4. Friedhelm Meyer auf der Heide, Christian Scheideler
    Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols. [Citation Graph (0, 0)][DBLP]
    FOCS, 1996, pp:370-379 [Conf]
  5. Baruch Awerbuch, André Brinkmann, Christian Scheideler
    Anycasting in Adversarial Systems: Routing and Admission Control. [Citation Graph (0, 0)][DBLP]
    ICALP, 2003, pp:1153-1168 [Conf]
  6. Baruch Awerbuch, Christian Scheideler
    Group Spreading: A Protocol for Provably Secure Distributed Name Service. [Citation Graph (0, 0)][DBLP]
    ICALP, 2004, pp:183-195 [Conf]
  7. Stefan Bock, Friedhelm Meyer auf der Heide, Christian Scheideler
    Optimal Wormhole Routing in the (n, d)-Torus. [Citation Graph (0, 0)][DBLP]
    IPPS, 1997, pp:326-332 [Conf]
  8. Chris Riley, Christian Scheideler
    A Distributed Hash Table for Computational Grids. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2004, pp:- [Conf]
  9. Kishore Kothapalli, Christian Scheideler, Melih Onus, Christian Schindelhauer
    Distributed coloring in O/spl tilde/(/spl radic/(log n)) bit rounds. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2006, pp:- [Conf]
  10. Baruch Awerbuch, Christian Scheideler
    Robust Distributed Name Service. [Citation Graph (0, 0)][DBLP]
    IPTPS, 2004, pp:237-249 [Conf]
  11. Giuseppe Ateniese, Chris Riley, Christian Scheideler
    Survivable Monitoring in Dynamic Networks. [Citation Graph (0, 0)][DBLP]
    IWIA, 2004, pp:33-47 [Conf]
  12. Baruch Awerbuch, Christian Scheideler
    Robust Random Number Generation for Peer-to-Peer Systems. [Citation Graph (0, 0)][DBLP]
    OPODIS, 2006, pp:275-289 [Conf]
  13. Petra Berenbrink, André Brinkmann, Christian Scheideler
    Distributed Path Selection for Storage Networks. [Citation Graph (0, 0)][DBLP]
    PDPTA, 2000, pp:- [Conf]
  14. Baruch Awerbuch, Christian Scheideler
    Peer-to-peer systems for prefix search. [Citation Graph (0, 0)][DBLP]
    PODC, 2003, pp:123-132 [Conf]
  15. Artur Czumaj, Chris Riley, Christian Scheideler
    Perfectly Balanced Allocation. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 2003, pp:240-251 [Conf]
  16. Baruch Awerbuch, Christian Scheideler
    The hyperring: a low-congestion deterministic data structure for distributed environments. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:318-327 [Conf]
  17. Petra Berenbrink, Christian Scheideler
    Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:112-121 [Conf]
  18. Artur Czumaj, Christian Scheideler
    Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma. [Citation Graph (0, 0)][DBLP]
    SODA, 2000, pp:30-39 [Conf]
  19. Petr Kolman, Christian Scheideler
    Improved bounds for the unsplittable flow problem. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:184-193 [Conf]
  20. Friedhelm Meyer auf der Heide, Christian Scheideler
    Communication in Parallel Systems. [Citation Graph (0, 0)][DBLP]
    SOFSEM, 1996, pp:16-33 [Conf]
  21. Baruch Awerbuch, Christian Scheideler
    Consistent and compact data management in distributed storage systems. [Citation Graph (0, 0)][DBLP]
    SPAA, 2004, pp:44-53 [Conf]
  22. Baruch Awerbuch, Christian Scheideler
    Towards a scalable and robust DHT. [Citation Graph (0, 0)][DBLP]
    SPAA, 2006, pp:318-327 [Conf]
  23. Amitabha Bagchi, Ankur Bhargava, Amitabh Chaudhary, David Eppstein, Christian Scheideler
    The effect of faults on network expansion. [Citation Graph (0, 0)][DBLP]
    SPAA, 2004, pp:286-293 [Conf]
  24. Amitabha Bagchi, Amitabh Chaudhary, Christian Scheideler, Petr Kolman
    Algorithms for fault-tolerant routing in circuit switched networks. [Citation Graph (0, 0)][DBLP]
    SPAA, 2002, pp:265-274 [Conf]
  25. Micah Adler, Christian Scheideler
    Efficient Communication Strategies for Ad-Hoc Wireless Networks (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SPAA, 1998, pp:259-268 [Conf]
  26. Petra Berenbrink, Marco Riedel, Christian Scheideler
    Simple Competitive Request Scheduling Strategies. [Citation Graph (0, 0)][DBLP]
    SPAA, 1999, pp:33-42 [Conf]
  27. Ankur Bhargava, Kishore Kothapalli, Chris Riley, Christian Scheideler, Mark Thober
    Pagoda: a dynamic overlay network for routing, data management, and multicasting. [Citation Graph (0, 0)][DBLP]
    SPAA, 2004, pp:170-179 [Conf]
  28. André Brinkmann, Kay Salzwedel, Christian Scheideler
    Efficient, distributed data placement strategies for storage area networks (extended abstract). [Citation Graph (0, 0)][DBLP]
    SPAA, 2000, pp:119-128 [Conf]
  29. André Brinkmann, Kay Salzwedel, Christian Scheideler
    Compact, adaptive placement schemes for non-uniform requirements. [Citation Graph (0, 0)][DBLP]
    SPAA, 2002, pp:53-62 [Conf]
  30. Michele Flammini, Christian Scheideler
    Simple, Efficient Routing Schemes for All-Optical Networks. [Citation Graph (0, 0)][DBLP]
    SPAA, 1997, pp:170-179 [Conf]
  31. Friedhelm Meyer auf der Heide, Christian Scheideler
    Space-Efficient Routing in Vertex-Symmetric Networks (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SPAA, 1995, pp:137-146 [Conf]
  32. Lujun Jia, Rajmohan Rajaraman, Christian Scheideler
    On local algorithms for topology control and routing in ad hoc networks. [Citation Graph (0, 0)][DBLP]
    SPAA, 2003, pp:220-229 [Conf]
  33. Petr Kolman, Christian Scheideler
    Simple on-line algorithms for the maximum disjoint paths problem. [Citation Graph (0, 0)][DBLP]
    SPAA, 2001, pp:38-47 [Conf]
  34. Kishore Kothapalli, Christian Scheideler
    Information gathering in adversarial systems: lines and cycles. [Citation Graph (0, 0)][DBLP]
    SPAA, 2003, pp:333-342 [Conf]
  35. Kishore Kothapalli, Christian Scheideler, Melih Onus, Andréa W. Richa
    Constant density spanners for wireless ad-hoc networks. [Citation Graph (0, 0)][DBLP]
    SPAA, 2005, pp:116-125 [Conf]
  36. Christian Scheideler, Berthold Vöcking
    Universal Continuous Routing Strategies. [Citation Graph (0, 0)][DBLP]
    SPAA, 1996, pp:141-151 [Conf]
  37. Friedhelm Meyer auf der Heide, Christian Scheideler, Volker Stemann
    Exploiting Storage Redundancy to Speed Up Randomized Shared Memory Simulations. [Citation Graph (0, 0)][DBLP]
    STACS, 1995, pp:267-278 [Conf]
  38. Christian Scheideler
    Models and Techniques for Communication in Dynamic Networks. [Citation Graph (0, 0)][DBLP]
    STACS, 2002, pp:27-49 [Conf]
  39. Robert Cypher, Friedhelm Meyer auf der Heide, Christian Scheideler, Berthold Vöcking
    Universal Algorithms for Store-and-Forward and Wormhole Routing. [Citation Graph (0, 0)][DBLP]
    STOC, 1996, pp:356-365 [Conf]
  40. Artur Czumaj, Christian Scheideler
    A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (extended abstract). [Citation Graph (0, 0)][DBLP]
    STOC, 2000, pp:38-47 [Conf]
  41. Uriel Feige, Christian Scheideler
    Improved Bounds for Acyclic Job Shop Scheduling (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    STOC, 1998, pp:624-633 [Conf]
  42. Christian Scheideler
    How to spread adversarial nodes?: rotate! [Citation Graph (0, 0)][DBLP]
    STOC, 2005, pp:704-713 [Conf]
  43. Christian Scheideler, Berthold Vöcking
    From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols. [Citation Graph (0, 0)][DBLP]
    STOC, 1999, pp:215-224 [Conf]
  44. Petr Kolman, Christian Scheideler
    Simple On-Line Algorithms for the Maximum Disjoint Paths Problem. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2004, v:39, n:3, pp:209-233 [Journal]
  45. Uriel Feige, Christian Scheideler
    Improved Bounds for Acyclic Job Shop Scheduling. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2002, v:22, n:3, pp:361-399 [Journal]
  46. Friedhelm Meyer auf der Heide, Christian Scheideler
    Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2001, v:21, n:1, pp:95-138 [Journal]
  47. Amitabha Bagchi, Ankur Bhargava, Amitabh Chaudhary, David Eppstein, Christian Scheideler
    The Effect of Faults on Network Expansion [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  48. Petr Kolman, Christian Scheideler
    Improved bounds for the unsplittable flow problem. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2006, v:61, n:1, pp:20-44 [Journal]
  49. Micah Adler, Christian Scheideler
    Efficient Communication Strategies for Ad Hoc Wireless Networks. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2000, v:33, n:5/6, pp:337-391 [Journal]
  50. Michele Flammini, Christian Scheideler
    Simple, Efficient Routing Schemes for All-Optical Networks. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 1999, v:32, n:3, pp:387-420 [Journal]
  51. Christian Scheideler, Berthold Vöcking
    Universal Continuous Routing Strategies. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 1998, v:31, n:4, pp:425-449 [Journal]
  52. Artur Czumaj, Christian Scheideler
    Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lovász local lemma. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2000, v:17, n:3-4, pp:213-237 [Journal]
  53. Christian Scheideler, Berthold Vöcking
    From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:30, n:4, pp:1126-1155 [Journal]
  54. Friedhelm Meyer auf der Heide, Christian Scheideler, Volker Stemann
    Exploiting Storage Redundancy to Speed up Randomized Shared Memory Simulations. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:162, n:2, pp:245-281 [Journal]
  55. Giuseppe Ateniese, Chris Riley, Christian Scheideler
    Survivable Monitoring in Dynamic Networks. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Mob. Comput., 2006, v:5, n:9, pp:1242-1254 [Journal]
  56. Melih Onus, Andréa Richa, Christian Scheideler
    Linearization: Locally Self-Stabilizing Sorting in Graphs. [Citation Graph (0, 0)][DBLP]
    ALENEX, 2007, pp:- [Conf]
  57. Baruch Awerbuch, Christian Scheideler
    A denial-of-service resistant DHT. [Citation Graph (0, 0)][DBLP]
    PODC, 2007, pp:370-371 [Conf]
  58. Baruch Awerbuch, Christian Scheideler
    A Denial-of-Service Resistant DHT. [Citation Graph (0, 0)][DBLP]
    DISC, 2007, pp:33-47 [Conf]
  59. Amitabha Bagchi, Ankur Bhargava, Amitabh Chaudhary, David Eppstein, Christian Scheideler
    The Effect of Faults on Network Expansion. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2006, v:39, n:6, pp:903-928 [Journal]

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


  61. Supervised Peer-to-Peer Systems. [Citation Graph (, )][DBLP]


  62. Transparent Data Structures, or How to Make Search Trees Robust in a Distributed Environmen. [Citation Graph (, )][DBLP]


  63. Efficient Broadcasting and Gathering in Wireless Ad-Hoc Networks. [Citation Graph (, )][DBLP]


  64. Time Complexity of Distributed Topological Self-stabilization: The Case of Graph Linearization. [Citation Graph (, )][DBLP]


  65. An O(log n) dominating set protocol for wireless ad-hoc networks under the physical interference model. [Citation Graph (, )][DBLP]


  66. SIMLAB-A Simulation Environment for Storage Area Networks. [Citation Graph (, )][DBLP]


  67. A jamming-resistant MAC protocol for single-hop wireless networks. [Citation Graph (, )][DBLP]


  68. A distributed polylogarithmic time algorithm for self-stabilizing skip graphs. [Citation Graph (, )][DBLP]


  69. Brief announcement: towards robust medium access in multi-hop networks. [Citation Graph (, )][DBLP]


  70. SPREAD: an adaptive scheme for redundant and fair storage in dynamic heterogeneous storage systems. [Citation Graph (, )][DBLP]


  71. A DoS-resilient information system for dynamic data management. [Citation Graph (, )][DBLP]


  72. Tiara: A Self-stabilizing Deterministic Skip List. [Citation Graph (, )][DBLP]


  73. Brief Announcement: On the Time Complexity of Distributed Topological Self-stabilization. [Citation Graph (, )][DBLP]


  74. Brief Announcement: Stabilizing Consensus with the Power of Two Choices. [Citation Graph (, )][DBLP]


  75. A Jamming-Resistant MAC Protocol for Multi-Hop Wireless Networks. [Citation Graph (, )][DBLP]


  76. A Jamming-Resistant MAC Protocol for Multi-Hop Wireless Networks [Citation Graph (, )][DBLP]


  77. AntiJam: Efficient Medium Access despite Adaptive and Reactive Jamming [Citation Graph (, )][DBLP]


Search in 0.026secs, Finished in 0.029secs
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