Emerging Technologies / IBM / MIT Press / Large Scale Information Systems / /
Country
Germany / / /
Event
Product Issues / Reorganization / /
Facility
Computer Science Johns Hopkins University / Watson Research Center / Dynamic Intelligent Systems Computer Science Department University / /
IndustryTerm
search tree structure / interconnection network / dynamic overlay network / internet applications / search operation / search trees / non-scalable overlay network / content addressable network / balanced search tree / search operations / p2p applications / Internet Technologies / search tree / search structures / large-scale peer-to-peer systems / Software packages / search structure / dynamic distributed systems / overlay network / peer-topeer systems / /
Organization
Graduate School / Christian Scheideler† Department / National Science Foundation / Dynamic Intelligent Systems Computer Science Department University of Paderborn D-33102 Paderborn / MIT / Johns Hopkins University / European Union / /
Person
Christian Scheideler / de Bruijn / K. Hildrum / Consider / Morgan Kaufmann / Using / /
Position
hypertree model / programmer / /
Product
Galil / entries / /
ProvinceOrState
New York / Massachusetts / /
PublishedMedium
Journal of the ACM / Theoretical Computer Science / Lecture Notes in Computer Science / /
Technology
peer-to-peer / Internet Technologies / p2p / peer-to-peer system / shared memory / /
Transparent Data Structures, or How to Make Search Trees Robust in a Distributed Environment Miroslaw Korzeniowski∗ International Graduate School of Dynamic Intelligent Systems Computer Science Department