Practical Algorithms for Selection on Coarse-Grained Parallel Computers
IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
Designing Efficient Distributed Algorithms Using Sampling Techniques
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
A Factor-2 Approximation for Labeling Points with Maximum Sliding Labels
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
A Randomized In-Place Algorithm for Positioning the kth Element in a Multiset
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Querying and Clustering Very Large Data Sets Using Dynamic Bucketing Approach
WAIM '02 Proceedings of the Third International Conference on Advances in Web-Age Information Management
Combining Arithmetic and Geometric Rounding Techniques for Knapsack Problems
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
An Efficient Algorithm for the Approximate Median Selection Problem
CIAC '00 Proceedings of the 4th Italian Conference on Algorithms and Complexity
The Reconstruction of the Digital Hyperbola Segment from Its Code
DGCI '00 Proceedings of the 9th International Conference on Discrete Geometry for Computer Imagery
Some complexity results for the Traveling Salesman Problem
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
Multiple-Resource Periodic Scheduling Problem: how much fairness is necessary?
RTSS '03 Proceedings of the 24th IEEE International Real-Time Systems Symposium
An improved, randomized algorithm for parallel selection with an experimental study
Journal of Parallel and Distributed Computing
Space-efficient geometric divide-and-conquer algorithms
Computational Geometry: Theory and Applications
Randomized algorithm for the sum selection problem
Theoretical Computer Science
Balancing applied to maximum network flow problems
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
A Partitioning Approach to the Design of Selection Networks
IEEE Transactions on Computers
On k-Nearest Neighbor Voronoi Diagrams in the Plane
IEEE Transactions on Computers
Theoretical Computer Science
Fast algorithm for multicast and data gathering in wireless networks
Information Processing Letters
Zonotope/Hyperplane Intersection for Hybrid Systems Reachability Analysis
HSCC '08 Proceedings of the 11th international workshop on Hybrid Systems: Computation and Control
New Upper Bounds on Continuous Tree Edge-Partition Problem
AAIM '08 Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Matching points with rectangles and squares
Computational Geometry: Theory and Applications
Region-restricted clustering for geographic data mining
Computational Geometry: Theory and Applications
Cache-oblivious selection in sorted X+Y matrices
Information Processing Letters
Incorporating symmetry into the Lucas-Kanade framework
Pattern Recognition Letters
Sorting and Selection with Imprecise Comparisons
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Range Quantile Queries: Another Virtue of Wavelet Trees
SPIRE '09 Proceedings of the 16th International Symposium on String Processing and Information Retrieval
NP-hard and linear variants of hypergraph partitioning
Theoretical Computer Science
A simple linear algorithm for computing rectilinear 3-centers
Computational Geometry: Theory and Applications - Special issue: The 11th Candian conference on computational geometry - CCCG 99
Computing mean absolute deviation under uncertainty
Applied Soft Computing
Optimal Randomized Algorithm for the Density Selection Problem
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Balanced vertex-orderings of graphs
Discrete Applied Mathematics
On uniform k-partition problems
Discrete Applied Mathematics
Hybrid rounding techniques for knapsack problems
Discrete Applied Mathematics - Special issue: Efficient algorithms
Transposition invariant string matching
Journal of Algorithms
Journal of Algorithms
Relaxed voting and competitive location under monotonous gain functions on trees
Discrete Applied Mathematics
Comparison-based time-space lower bounds for selection
ACM Transactions on Algorithms (TALG)
Journal of Computer and System Sciences
Paper: Parallel computation of matchings in trees
Parallel Computing
Discrete Applied Mathematics
Logging every footstep: quantile summaries for the entire history
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Journal of Computing Sciences in Colleges
On computing an optimal permutation of ranks for multiselection
Computers & Mathematics with Applications
Preemptive scheduling of independent jobs on identical parallel machines subject to migration delays
Automation and Remote Control
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Adaptive algorithms for planar convex hull problems
FAW'10 Proceedings of the 4th international conference on Frontiers in algorithmics
External-memory algorithms and data structures
Algorithms and theory of computation handbook
Parallel selection by regular sampling
Euro-Par'10 Proceedings of the 16th international Euro-Par conference on Parallel processing: Part II
An algorithmic comparison of three scientific impact indices
Acta Cybernetica
Linear-time nearest point algorithms for coxeter lattices
IEEE Transactions on Information Theory
Schedulability analysis for non-preemptive fixed-priority multiprocessor scheduling
Journal of Systems Architecture: the EUROMICRO Journal
Fuzzy Sets and Systems
Efficient parallel skyline processing using hyperplane projections
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Reoptimization in Lagrangian methods for the 0-1 quadratic knapsack problem
Computers and Operations Research
Randomized selection on the GPU
Proceedings of the ACM SIGGRAPH Symposium on High Performance Graphics
Multiprocessor extensions to real-time calculus
Real-Time Systems
Incremental Cycle Detection, Topological Ordering, and Strong Component Maintenance
ACM Transactions on Algorithms (TALG)
Tight time bounds for the minimum local convex partition problem
JCDCG'04 Proceedings of the 2004 Japanese conference on Discrete and Computational Geometry
Towards optimal multiple selection
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Cache-aware and cache-oblivious adaptive sorting
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Roll cutting in the curtain industry
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Preemptive scheduling of independent jobs on identical parallel machines subject to migration delays
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Min-energy voltage allocation for tree-structured tasks
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Efficient algorithms for the electric power transaction problem
WINE'05 Proceedings of the First international conference on Internet and Network Economics
Merging and merge-sort in a single hop radio network
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
Efficient quantile retrieval on multi-dimensional data
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
A dynamic multicast tree based routing scheme without replication in delay tolerant networks
Journal of Parallel and Distributed Computing
Rank selection in multidimensional data
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Evaluating mid-(k, n) queries using b+-tree
DEXA'05 Proceedings of the 16th international conference on Database and Expert Systems Applications
Approximate range mode and range median queries
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
The complexity of implicit and space efficient priority queues
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
New algorithms on wavelet trees and applications to information retrieval
Theoretical Computer Science
Deterministic splitter finding in a stream with constant storage and guarantees
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Pinning balloons with perfect angles and optimal area
GD'11 Proceedings of the 19th international conference on Graph Drawing
Minimizing the error of linear separators on linearly inseparable data
Discrete Applied Mathematics
Algorithms to Detect Multiprotein Modularity Conserved during Evolution
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Applying fuzzy weighted average approach to evaluate office layouts with Feng-Shui consideration
Mathematical and Computer Modelling: An International Journal
A faster polynomial algorithm for the unbalanced Hitchcock transportation problem
Operations Research Letters
Coverage restricted to an angle
Operations Research Letters
A quantile estimation for massive data with generalized Pareto distribution
Computational Statistics & Data Analysis
On some geometric selection and optimization problems via sorted matrices
Computational Geometry: Theory and Applications
Research paper: The saga of minimum spanning trees
Computer Science Review
On the ultimate convex hull algorithm in practice
Pattern Recognition Letters
Geometric quadrisection in linear time, with application to VLSI placement
Discrete Optimization
A linear-time algorithm for the bottleneck transportation problem with a fixed number of sources
Operations Research Letters
Approximation algorithms for maximum dispersion
Operations Research Letters
A linear time bin-packing algorithm
Operations Research Letters
A New Algorithm for Building Alphabetic Minimax Trees
Fundamenta Informaticae - Special Issue on Stringology
Towards an optimal space-and-query-time index for top-k document retrieval
CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
Minimax trees in linear time with applications
European Journal of Combinatorics
Worst-Case I/O-Efficient Skyline Algorithms
ACM Transactions on Database Systems (TODS)
A linear time algorithm for the k maximal sums problem
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Optimal randomized comparison based algorithms for collision
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Optimal algorithms for the weighted p-center problems on the real line for small p
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
The bitvector machine: a fast and robust machine learning algorithm for non-linear problems
ECML PKDD'12 Proceedings of the 2012 European conference on Machine Learning and Knowledge Discovery in Databases - Volume Part I
Genetic Programming and Evolvable Machines
A linear time approximation scheme for computing geometric maximum k-star
Journal of Global Optimization
Quantiles over data streams: an experimental study
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Computing square roots of trivially perfect and threshold graphs
Discrete Applied Mathematics
Finding the minimum number of elements with sum above a threshold
Information Sciences: an International Journal
Practically efficient multi-party sorting protocols from comparison sort algorithms
ICISC'12 Proceedings of the 15th international conference on Information Security and Cryptology
STRIP: stream learning of influence probabilities
Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining
A framework for evaluating approximation methods for Gaussian process regression
The Journal of Machine Learning Research
Upper and lower degree bounded graph orientation with minimum penalty
CATS '12 Proceedings of the Eighteenth Computing: The Australasian Theory Symposium - Volume 128
Road segment selection with strokes and stability
Proceedings of the 1st ACM SIGSPATIAL International Workshop on MapInteraction
Local feature based retrieval approach for iris biometrics
Frontiers of Computer Science: Selected Publications from Chinese Universities
Reprint of: Extreme point and halving edge search in abstract order types
Computational Geometry: Theory and Applications
Journal of Artificial Intelligence Research
| Hi-index | 0.07 |
The number of comparisons required to select the i-th smallest of n numbers is shown to be at most a linear function of n by analysis of a new selection algorithm-PICK. Specifically, no more than 5.4305 n comparisons are ever required. This bound is improved for extreme values of i, and a new lower bound on the requisite number of comparisons is also proved.