Tight bounds for distributed selection
Authors:
Open Access
- 9 June 2007
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 145-153
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Computing aggregates for monitoring wireless sensor networks2003
- The cougar approach to in-network query processing in sensor networksACM SIGMOD Record, 2002
- Efficient distributed selection with bounded messagesIEEE Transactions on Parallel and Distributed Systems, 1997
- A distributed selection algorithm and its expected communication complexityTheoretical Computer Science, 1992
- Reduction techniques for selection in distributed filesIEEE Transactions on Computers, 1989
- On the expected complexity of distributed selectionJournal of Parallel and Distributed Computing, 1988
- Tradeoffs for selection in distributed networks (Preliminary Version)1983
- Finding the median distributivelyJournal of Computer and System Sciences, 1982
- Finding the medianJournal of Computer and System Sciences, 1976
- Time bounds for selectionJournal of Computer and System Sciences, 1973