Slowing down sorting networks to obtain faster sorting algorithms
Journal of the ACM (JACM)
Efficient plane sweeping in parallel
SCG '86 Proceedings of the second annual symposium on Computational geometry
Explicit expanders and the Ramanujan conjectures
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Expanders, sorting in rounds and superconcentrators of limited depth
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Dynamic parallel complexity of computational circuits
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
The construction of Huffman-equivalent prefix code in NC
ACM SIGACT News
Efficient Parallel Convex Hull Algorithms
IEEE Transactions on Computers
Using smoothness to achieve parallelism
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
A deterministic algorithm for partitioning arrangements of lines and its application
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
A computer assisted optimal depth lower bound for sorting networks with nine inputs
Proceedings of the 1989 ACM/IEEE conference on Supercomputing
Logarithmic time cost optimal parallel sorting is not yet fast in practice!
Proceedings of the 1990 ACM/IEEE conference on Supercomputing
A comparison of sorting algorithms for the connection machine CM-2
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
Ultra-fast expected time parallel algorithms
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Methods for message routing in parallel machines
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
A hypercubic sorting network with nearly logarithmic depth
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Sorting with Linear Speedup on a Pipelined Hypercube
IEEE Transactions on Computers
Finding the repeated median regression line
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Optimal sorting on mesh-connected processor arrays
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
A lower bound for sorting networks based on the shuffle permutation
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Implementations of randomized sorting on large parallel machines
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Fast Algorithms for Routing Around Faults in Multibutterflies and Randomly-Wired Splitter Networks
IEEE Transactions on Computers - Special issue on fault-tolerant computing
The new class of g-chain periodic sorters
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
A New Class of Optimal Bounded-Degree VLSI Sorting Networks
IEEE Transactions on Computers
Tight bounds on the size of fault-tolerant merging and sorting networks with destructive faults
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Expanders that beat the eigenvalue bound: explicit construction and applications
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Self-routing superconcentrators
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
How much can hardware help routing?
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Simulation and visualization tools for teaching parallel merge sort
SIGCSE '93 Proceedings of the twenty-fourth SIGCSE technical symposium on Computer science education
A survey of PRAM simulation techniques
ACM Computing Surveys (CSUR)
Efficient low-contention parallel algorithms
SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
Parallel sorting by over partitioning
SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
Parallel algorithms for evaluating sequences of set-manipulation operations
Journal of the ACM (JACM)
Coins, weights and contention in balancing networks
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Eigenvalues and expansion of regular graphs
Journal of the ACM (JACM)
Deterministic on-line routing on area-universal networks
Journal of the ACM (JACM)
On probabilistic networks for selection, merging, and sorting
Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
Optimal trade-offs between size and slowdown for universal parallel networks
Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
Parallel sorting with limited bandwidth
Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
Lower bounds for sorting networks
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Tight analyses of two local load balancing algorithms
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Sorting on a parallel pointer machine with applications to set expression evaluation
Journal of the ACM (JACM)
Improvements on bottleneck matching and related problems using geometry
Proceedings of the twelfth annual symposium on Computational geometry
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
Communication-efficient parallel sorting (preliminary version)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
An O(nlogn)-size fault-tolerant sorting network (extended abstract)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
A Time- and Cost-Optimal Algorithm for Interlocking Sets-With Applications
IEEE Transactions on Parallel and Distributed Systems
Paul Erdös (1913-996): his influence on the theory of computing
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Improved routing and sorting on multibutterflies
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
How much can hardware help routing?
Journal of the ACM (JACM)
Simulating Boolean circuits on a DNA computer
RECOMB '97 Proceedings of the first annual international conference on Computational molecular biology
Layout of the batcher bitonic sorter (extended abstract)
Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures
Efficient algorithms for geometric optimization
ACM Computing Surveys (CSUR)
How to Sort N Items Using a Sorting Network of Fixed I/O Size
IEEE Transactions on Parallel and Distributed Systems
Sorting and counting networks of small depth and arbitrary width
Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures
Matching nuts and bolts in O(n log n) time
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Parallel integer sorting is more efficient than parallel comparison sorting on exclusive write PRAMs
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
A new approach to fast control of r2× r2 3-stage benes networks of r×r crossbar switches
ISCA '90 Proceedings of the 17th annual international symposium on Computer Architecture
Strong bias of group generators: an obstacle to the “product replacement algorithm”
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Periodification scheme: constructing sorting networks with constant period
Journal of the ACM (JACM)
Loss-less condensers, unbalanced expanders, and extractors
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Parametric search made practical
Proceedings of the eighteenth annual symposium on Computational geometry
Expansion of product replacement graphs
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Improved fast interger sorting in linear space
Information and Computation
Searching games with errors---fifty years of coping with liars
Theoretical Computer Science
Random graphs, random triangle-free graphs, and random partial orders
Computational Discrete Mathematics
Adaptive Binary Sorting Schemes and Associated Interconnection Networks
IEEE Transactions on Parallel and Distributed Systems
Monotone simulations of non-monotone proofs
Journal of Computer and System Sciences - Complexity 2001
On the negation-limited circuit complexity of merging
Discrete Applied Mathematics - Special issue: Special issue devoted to the fifth annual international computing and combinatories conference (COCOON'99) Tokyo, Japan 26-28 July 1999
Improving the efficiency of parallel minimum spanning tree algorithms
Discrete Applied Mathematics - Special issue: Special issue devoted to the fifth annual international computing and combinatories conference (COCOON'99) Tokyo, Japan 26-28 July 1999
Optimizing Parallel Bitonic Sort
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
Work-Time Optimal K-Merge Algorithms on the PRAM
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Essentially Every Unimodular Matrix Defines and Expander
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Euro-Par '00 Proceedings from the 6th International Euro-Par Conference on Parallel Processing
A High Girth Graph Construction and a Lower Bound for Hitting Set Size for Combinatorial Rectangles
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
Labeling Points with Rectangles of Various Shapes
GD '00 Proceedings of the 8th International Symposium on Graph Drawing
Monotone Proofs of the Pigeon Hole Principle
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Randomized speed-ups in parallel computation
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
A Pipelined Single-Bit Controlled Sorting Network with O(N log^2 N) Bit Complexity
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Deterministic Routing of h-relations on the Multibutterfly
IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
On the Bisection Width and Expansion of Butterfly Networks
IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
Strong bias of group generators: an obstacle to the "product replacement algorithm"
Journal of Algorithms - Special issue: SODA 2000
Classifying Matrices Separating Rows and Columns
IEEE Transactions on Parallel and Distributed Systems
Smith normal form of dense integer matrices fast algorithms into practice
ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
A new family of Cayley expanders (?)
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Parametric search made practical
Computational Geometry: Theory and Applications - Special issue on the 18th annual symposium on computational geometry—SoCG2002
Fast periodic correction networks
Theoretical Computer Science - Foundations of computation theory (FCT 2003)
Research note: Networks for sorting multitonic sequences
Journal of Parallel and Distributed Computing
Journal of Parallel and Distributed Computing - Special issue: 18th International parallel and distributed processing symposium
A scalable VLSI speed/area tunable sorting network
Journal of Systems Architecture: the EUROMICRO Journal
Recursive construction of parallel distribution networks
Journal of Parallel and Distributed Computing
On the approximability of influence in social networks
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Recursive construction for 3-regular expanders
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
The impact of randomization in smoothing networks
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Generic discrimination: sorting and paritioning unshared data in linear time
Proceedings of the 13th ACM SIGPLAN international conference on Functional programming
Ranking and Sorting in Unreliable Single Hop Radio Network
ADHOC-NOW '08 Proceedings of the 7th international conference on Ad-hoc, Mobile and Wireless Networks
Algorithms for center and Tverberg points
ACM Transactions on Algorithms (TALG)
Improving the average delay of sorting
Theoretical Computer Science
Bounds on the Size of Small Depth Circuits for Approximating Majority
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
A randomized, o(log w)-depth 2 smoothing network
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
Accelerating certain outputs of merging and sorting networks
Theoretical Computer Science
Efficient algorithms for the sum selection problem and k maximum sums problem
Theoretical Computer Science
Bureaucratic protocols for secure two-party sorting, selection, and permuting
ASIACCS '10 Proceedings of the 5th ACM Symposium on Information, Computer and Communications Security
On the negation-limited circuit complexity of merging
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Improving parallel computation with fast integer sorting
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Improving the average delay of sorting
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Correcting sorted sequences in a single hop radio network
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
Distance makes the types grow stronger: a calculus for differential privacy
Proceedings of the 15th ACM SIGPLAN international conference on Functional programming
Privacy-preserving data-oblivious geometric algorithms for geographic data
Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems
Randomized Shellsort: a simple oblivious sorting algorithm
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Constructing extended formulations from reflection relations
IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
Generic constant-round oblivious sorting algorithm for MPC
ProvSec'11 Proceedings of the 5th international conference on Provable security
Randomized Shellsort: A Simple Data-Oblivious Sorting Algorithm
Journal of the ACM (JACM)
Privacy-preserving group data access via stateless oblivious RAM simulation
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
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
Sorting long sequences in a single hop radio network
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Monotone circuits for the majority function
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
Parceling the butterfly and the batcher sorting network
Theoretical Computer Science
Oblivious RAM with o((logn)3) worst-case cost
ASIACRYPT'11 Proceedings of the 17th international conference on The Theory and Application of Cryptology and Information Security
Finite Fields and Their Applications
Algorithmic results for ordered median problems
Operations Research Letters
More efficient parallel integer sorting
FAW-AAIM'12 Proceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management
Clique problem, cutting plane proofs and communication complexity
Information Processing Letters
Approximation by DNF: examples and counterexamples
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
A deterministic algorithm for fitting a step function to a weighted point-set
Information Processing Letters
A note on searching line arrangements and applications
Information Processing Letters
Using symmetry and evolutionary search to minimize sorting networks
The Journal of Machine Learning Research
Constraints, MMSNP and expander relational structures
Combinatorica
Optimal Tradeoffs Between Size and Slowdown for Universal Parallel Networks
Theory of Computing Systems
On Probabilistic Networks for Selection, Merging, and Sorting
Theory of Computing Systems
| Hi-index | 0.01 |