Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).

We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.

301 Publications


2006 | Journal Article | LibreCat-ID: 2043
Bagchi, A., Bhargava, A., Chaudhary, A., Eppstein, D., & Scheideler, C. (2006). The Effect of Faults on Network Expansion. Theory Comput. Syst., (6), 903--928. https://doi.org/10.1007/s00224-006-1349-0
LibreCat | DOI
 

2006 | Conference Paper | LibreCat-ID: 2213 | OA
Scheideler, C. (2006). Towards a paradigm for robust distributed algorithms and data structures. In 6th International HNI Symposium on New Trends in Parallel and Distributed Computing.
LibreCat | Files available
 

2005 | Conference Paper | LibreCat-ID: 2114 | OA
Korzeniowski, M., & Scheideler, C. (2005). Transparent Data Structures, or How to Make Search Trees Robust in a Distributed Environment. In ISPAN (pp. 182--187).
LibreCat | Files available
 

2005 | Conference Paper | LibreCat-ID: 2115 | OA
Kothapalli, K., & Scheideler, C. (2005). Supervised Peer-to-Peer Systems. In ISPAN (pp. 188--193).
LibreCat | Files available
 

2005 | Conference Paper | LibreCat-ID: 2116 | OA
Onus, M., W. Richa, A., Kothapalli, K., & Scheideler, C. (2005). Efficient Broadcasting and Gathering in Wireless Ad-Hoc Networks. In ISPAN (pp. 346--351).
LibreCat | Files available
 

2005 | Conference Paper | LibreCat-ID: 2117 | OA
Kothapalli, K., Scheideler, C., Onus, M., & W. Richa, A. (2005). Constant density spanners for wireless ad-hoc networks. In SPAA (pp. 116--125).
LibreCat | Files available
 

2005 | Conference Paper | LibreCat-ID: 2118 | OA
Scheideler, C. (2005). How to spread adversarial nodes?: rotate! In STOC (pp. 704--713).
LibreCat | Files available
 

2005 | Conference Paper | LibreCat-ID: 2212 | OA
Scheideler, C. (2005). Overlay networks for wireless ad hoc networks. In IMA Workshop on Wireless Communications.
LibreCat | Files available
 

2004 | Journal Article | LibreCat-ID: 2119
Kolman, P., & Scheideler, C. (2004). Simple On-Line Algorithms for the Maximum Disjoint Paths Problem. Algorithmica, (3), 209--233. https://doi.org/10.1007/s00453-004-1086-1
LibreCat | DOI
 

2004 | Conference Paper | LibreCat-ID: 2120 | OA
Awerbuch, B., & Scheideler, C. (2004). Group Spreading: A Protocol for Provably Secure Distributed Name Service. In ICALP (Vol. 3142, pp. 183--195).
LibreCat | Files available
 

Filters and Search Terms

department=79

Search

Filter Publications

Display / Sort

Citation Style: APA

Export / Embed