M. Blum, R. Floyd, V. Pratt, R. Rivest, and R. Tarjan. Time bounds for selection. Journal of Computer and System Sciences, 7:448--461, 1973. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Novel Models and Algorithms for Integrated - Production Planning And (Correct)
No context found.
M. Blum, R. Floyd, V. Pratt, R. Rivest, and R. Tarjan. Time bounds for selection. Journal of Computer and System Sciences, 7:448--461, 1973.
Output-Sensitive Algorithms for Computing.. - Bremner, Demaine, .. (Correct)
No context found.
M. Blum, R. W. Floyd, V. Pratt, R. L. Rivest, and R. E. Tarjan. Time bounds for selection. Journal of Computing and Systems Science, 7:448--461, 1973.
On the Sectional Area of Convex Polytopes - Avis, Bose, Shermer, Snoeyink.. (1996) (6 citations) (Correct)
No context found.
M. Blum, R. W. Floyd, V. Pratt, R. L. Rivest, and R. E. Tarjan. Time bounds for selection. J. Comp. Sys. Sci., 7:448-461, 1973.
On-line Inference for Well-Log Data - Paul Fearnhead And (2003) (1 citation) (Correct)
No context found.
Blum, M., Floyd, R. W., Pratt, V., Rivest, R. L. and Tarjan, R. E. (1973). Time bounds for selection. Journal of Computer and System Sciences 7, 448-461.
Important Extrema of Time Series: Theory and Applications - Gandhi (2004) (1 citation) (Correct)
No context found.
Manuel Blum, Robert W. Floyd, Vaughan Pratt, Ronald L. Rivest, and Robert E. Tarjan. Time bounds for selection. Journal of Computer and System Sciences, 7(4):448-461, 1973.
Towards Optimal Multiple Selection - Kaligosi, Mehlhorn, Munro, Sanders (Correct)
No context found.
M. Blum, R. W. Floyd, V. R. Pratt, R. L. Rivest, and R. E. Tarjan. Time bounds for selection. Journal of Computer and System Sciences, 7(4):448--461, 1973.
Scheduling Tasks Sharing Files from Distributed Repositories - Giersch, Robert, Vivien (2004) (1 citation) (Correct)
No context found.
M. Blum, R. W. Floyd, V. Pratt, R. R. Rivest, and R. E. Tarjan. Time bounds for selection. Journal of Computer and System Sciences, 7(4):448--461, 1973.
Scheduling Tasks Sharing Files from Distributed Repositories - Giersch, Robert, Vivien (2003) (1 citation) (Correct)
No context found.
M. Blum, R. W. Floyd, V. Pratt, R. R. Rivest, and R. E. Tarjan. Time bounds for selection. Journal of Computer and System Sciences, 7(4):448-461, 1973.
Scheduling Tasks Sharing Files from Distributed Repositories - Giersch, Robert, Vivien (2004) (1 citation) (Correct)
No context found.
M. Blum, R. W. Floyd, V. Pratt, R. R. Rivest, and R. E. Tarjan. Time bounds for selection. Journal of Computer and System Sciences, 7(4):448461, 1973.
Scheduling Tasks Sharing Files from Distributed Repositories - Giersch, Robert, Vivien (2004) (1 citation) (Correct)
No context found.
M. Blum, R. W. Floyd, V. Pratt, R. R. Rivest, and R. E. Tarjan. Time bounds for selection. Journal of Computer and System Sciences, 7(4):448-461, 1973.
Scheduling Tasks Sharing Files from Distributed Repositories - Giersch, Robert, Vivien (2003) (1 citation) (Correct)
No context found.
M. Blum, R. W. Floyd, V. Pratt, R. R. Rivest, and R. E. Tarjan. Time bounds for selection. Journal of Computer and System Sciences, 7(4):448-461, 1973.
Optimal Parallel Algorithms for Multiselection on.. - Shen, Han, Pan, Evans (Correct)
No context found.
M. Blum, R. W. Floyd, V. R. Pratt, R. L. Rivest, and R. E. Tarjan. Time bounds for selection. J. Comput. Syst. Sci., 7:448--461, 1972. 18
CS270 Combinatorial Algorithms Data Structures Spring 2003 - Lecture Lecturer Christos (Correct)
No context found.
Blum, M., Floyd, R.W., Pratt, W., Rivest, R., and Tarjan, R. Time bounds for selection. Journal of Computer and System Sciences. 7, pp. 448-461. August 1973.
Output-Sensitive Algorithms for Computing.. - Bremner, Demaine, .. (Correct)
No context found.
M. Blum, R. W. Floyd, V. Pratt, R. L. Rivest, and R. E. Tarjan. Time bounds for selection. Journal of Computing and Systems Science, 7:448--461, 1973.
Three-Dimensional Orthogonal Graph Drawing - Wood (2000) (3 citations) (Correct)
No context found.
M. Blum, R. W. Floyd, V. Pratt, R. L. Rivest, and R. E. Tarjan, Time bounds for selection. J. Comput. System Sci., 7:448-461, 1973.
Three-Dimensional Orthogonal Graph Drawing - Wood (2000) (3 citations) (Correct)
No context found.
M. Blum, R. W. Floyd, V. Pratt, R. L. Rivest, and R. E. Tarjan, Time bounds for selection. J. Comput. System Sci., 7:448-461, 1973.
How to Summarize the Universe: Dynamic Maintenance of .. - Gilbert, Kotidis.. (2002) (8 citations) (Correct)
No context found.
M. Blum, R. W. Floyd, V. R. Pratt, R. L. Rivest and R. E. Tarjan. Time Bounds for Selection. JCSS 7(4): 448--461, 1973.
Scheduling Tasks Sharing Files From Distributed Repositories - Giersch, Robert, Vivien (2003) (1 citation) (Correct)
No context found.
M. Blum, R. W. Floyd, V. Pratt, R. R. Rivest, and R. E. Tarjan. Time bounds for selection. Journal of Computer and System Sciences, 7(4):448-461, 1973.
Approximate Range Mode And Range Median Queries - Prosenjit Bose Evangelos (Correct)
No context found.
M. Blum, R. W. Floyd, V. Pratt, R. L. Rivest, and R. E. Tarjan. Time bounds for selection. Journal of Computer and System Sciences, 7(4):448--461, 1973.
The Soft Heap: An Approximate Priority Queue with Optimal - Error Rate Bernard (Correct)
No context found.
Blum, M., Floyd, R.W., Pratt, V., Rivest, R.L., Tarjan, R.E. Time bounds for selection, Journal of Computer and System Sciences, 7 (1973), 448-461.
A Structured Family of Clustering and Tree Construction Methods - Bryant, Berry (2001) (1 citation) (Correct)
No context found.
M. Blum, V. Pratt, R. E. Tarjan, R. W. Floyd, and R. L. Rivest, Time bounds for selection, J. Comput. Syste Sci. 7 (1973), 448--461.
Three-Dimensional Orthogonal Graph Drawing - Wood (2000) (3 citations) (Correct)
No context found.
M. Blum, R. W. Floyd, V. Pratt, R. L. Rivest, and R. E. Tarjan, Time bounds for selection. J. Comput. System Sci., 7:448-461, 1973.
Selecting the Median - Dor, Zwick (1995) (16 citations) (Correct)
No context found.
M. Blum, R.W. Floyd, V. Pratt, R.L. Rivest, and R.E. Tarjan. Time bounds for selection. Journal of Computer and System Sciences, 7:448--461, 1973.
Balanced Vertex-Orderings of Graphs - Biedl, Chan, Ganjali, al. (2004) (1 citation) (Correct)
No context found.
M. Blum, R. W. Floyd, V. Pratt, R. L. Rivest, and R. E. 24 Tarjan, Time bounds for selection. J. Comput. System Sci., 7:448-461, 1973.
Multiple-Resource Periodic Scheduling Problem: - How Much Fairness (Correct)
No context found.
M. Blum, R. W. Floyd, V. R. Pratt, R. L. Rivest, and R. E. Tarjan. Time bounds for selection. Journal of Computer and System Sciences, 7:448--461, 1973.
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC