Constant-time parallel integer sorting
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Learning decision trees using the Fourier spectrum
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Fast and reliable parallel hashing
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
Fast deterministic approximate and exact parallel sorting
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Geometric partitioning made easier, even in parallel
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Parallel algorithms column 1: models of computation
ACM SIGACT News
Simple, efficient shared memory simulations
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Randomized routing with shorter paths
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Amplification of weak learning under the uniform distribution
COLT '93 Proceedings of the sixth annual conference on Computational learning theory
Constant depth circuits, Fourier transform, and learnability
Journal of the ACM (JACM)
On the computational power of depth 2 circuits with threshold and modulo gates
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Crumbling walls: a class of practical and efficient quorum systems
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
Randomized Routing with Shorter Paths
IEEE Transactions on Parallel and Distributed Systems
On the Fourier spectrum of monotone functions
Journal of the ACM (JACM)
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
On trading task reallocation for thread management in partitionable multiprocessors
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
Learning changing concepts by exploiting the structure of change
COLT '96 Proceedings of the ninth annual conference on Computational learning theory
Simple, efficient routing schemes for all-optical networks
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
Stochastic service guarantees for continuous data on multi-zone disks
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Reactive search, a history-sensitive heuristic for MAX-SAT
Journal of Experimental Algorithmics (JEA)
Comparison of initial conditions for distributed algorithms on anonymous networks
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Randomized and adversarial load balancing
Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures
Randomized robot navigation algorithms
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Fixed-dimensional parallel linear programming via relative &egr;-approximations
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Methods for achieving fast query times in point location data structures
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Analysis and application of adaptive sampling
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Randomized metarounding (extended abstract)
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Random sampling in geometric optimization: new insights and applications
Proceedings of the sixteenth annual symposium on Computational geometry
Anytime algorithm for agent-mediated merchant information gathering
AGENTS '00 Proceedings of the fourth international conference on Autonomous agents
Improved master theorems for divide-and-conquer recurrences
Journal of the ACM (JACM)
Almost optimal permutation routing on hypercubes
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Distributed probabilistic polling and applications to proportionate agreement
Information and Computation
Distributed caching independent of the network size
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
Foreword: performance modelling and evaluation of ATM&IP networks
Performance Evaluation
Learning Changing Concepts by Exploiting the Structure of Change
Machine Learning
Stochastic Finite Learning of the Pattern Languages
Machine Learning
Random Structures & Algorithms - Probabilistic methods in combinatorial optimization
A Clustered Failure Model for the Memory Array Reconfiguration Problem
IEEE Transactions on Computers
Computing Reliability Intervals for k-Resilient Protocols
IEEE Transactions on Computers
Almost Certain Fault Diagnosis Through Algorithm-Based Fault Tolerance
IEEE Transactions on Parallel and Distributed Systems
Theoretical Computer Science - Natural computing
Hard graphs for the randomized Boppana-Halldórsson algorithm for MAXCLIQUE
Nordic Journal of Computing
Sparse networks supporting efficient reliable broadcasting
Nordic Journal of Computing
Optimal Wormhole Routing in the (n, d)-Torus
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
On the Choice of the Mutation Probability for the (1+1) EA
PPSN VI Proceedings of the 6th International Conference on Parallel Problem Solving from Nature
Mining Generalized Association Rules
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Approximating Multicast Congestion
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
Optimal Many-to-One Routing on the Mesh with Constant Queues
Euro-Par '01 Proceedings of the 7th International Euro-Par Conference Manchester on Parallel Processing
Randomized Gossiping by Packets in Faulty Networks
SOFSEM '99 Proceedings of the 26th Conference on Current Trends in Theory and Practice of Informatics on Theory and Practice of Informatics
On the Expected Runtime and the Success Probability of Evolutionary Algorithms
WG '00 Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science
Translating a Planar Object to Maximize Point Containment
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
On Learning Monotone DNF under Product Distributions
COLT '01/EuroCOLT '01 Proceedings of the 14th Annual Conference on Computational Learning Theory and and 5th European Conference on Computational Learning Theory
On counting point-hyperplane incidences
Computational Geometry: Theory and Applications - Special issue: The European workshop on computational geometry -- CG01
Load balancing of unit size tokens and expansion properties of graphs
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Faster deterministic sorting through better sampling
Theoretical Computer Science
Analysis and application of adaptive sampling
Journal of Computer and System Sciences - Special issue on PODS 2000
On the Efficiency of Noise-Tolerant PAC Algorithms Derived from Statistical Queries
Annals of Mathematics and Artificial Intelligence
A High-Performance Distributed Algorithm for Mining Association Rules
ICDM '03 Proceedings of the Third IEEE International Conference on Data Mining
Concentration inequalities for the missing mass and for histogram rule error
The Journal of Machine Learning Research
Tail Bounds and Expectations for Random Arc Allocation and Applications
Combinatorics, Probability and Computing
Algorithms for Colouring Random k-colourable Graphs
Combinatorics, Probability and Computing
Reliable Fault Diagnosis with Few Tests
Combinatorics, Probability and Computing
Large Deviation Bounds for Markov Chains
Combinatorics, Probability and Computing
On sufficient conditions for unsatisfiability of random formulas
Journal of the ACM (JACM)
Sparse networks tolerating random faults
Discrete Applied Mathematics - Special issue on international workshop on algorithms, combinatorics, and optimization in interconnection networks (IWACOIN '99)
The hyperring: a low-congestion deterministic data structure for distributed environments
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Average-case complexity of single-source shortest-paths algorithms: lower and upper bounds
Journal of Algorithms - Special issue: Twelfth annual ACM-SIAM symposium on discrete algorithms
Range counting over multidimensional data streams
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Broose: A Practical Distributed Hashtable Based on the De-Bruijn Topology
P2P '04 Proceedings of the Fourth International Conference on Peer-to-Peer Computing
On learning monotone DNF under product distributions
Information and Computation
A high-performance distributed algorithm for mining association rules
Knowledge and Information Systems
Sampling in dynamic data streams and applications
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Radio communication in random graphs: extended abstract
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Distributed selfish load balancing
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Optimal many-to-one routing on the mesh with constant queues
Information Processing Letters
Locally consistent constraint satisfaction problems
Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
Radio communication in random graphs
Journal of Computer and System Sciences - Special issue on network algorithms 2005
On the communication complexity of randomized broadcasting in random-like graphs
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Large alphabets and incompressibility
Information Processing Letters
Randomized Algorithms for Determining the Majority on Graphs
Combinatorics, Probability and Computing
A practical approximation algorithm for the LMS line estimator
Computational Statistics & Data Analysis
Agent-based randomized broadcasting in large networks
Discrete Applied Mathematics
Feasibility and complexity of broadcasting with random transmission failures
Theoretical Computer Science
Learning a subclass of regular patterns in polynomial time
Theoretical Computer Science - Algorithmic learning theory
On the structure and complexity of worst-case equilibria
Theoretical Computer Science
Balanced allocation and dictionaries with tightly packed constant size bins
Theoretical Computer Science
Analysis of evolutionary algorithms for the longest common subsequence problem
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Detecting change in data streams
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
The power of memory in randomized broadcasting
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
On learning perceptrons with binary weights
Neural Computation
Testing Euclidean minimum spanning trees in the plane
ACM Transactions on Algorithms (TALG)
Simulated annealing, its parameter settings and the longest common subsequence problem
Proceedings of the 10th annual conference on Genetic and evolutionary computation
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
On Concentration of Discrete Distributions with Applications to Supervised Learning of Classifiers
MLDM '07 Proceedings of the 5th international conference on Machine Learning and Data Mining in Pattern Recognition
Multiobjectivization by Decomposition of Scalar Cost Functions
Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X
Rigorous Runtime Analysis of Inversely Fitness Proportional Mutation Rates
Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X
On Radio Broadcasting in Random Geometric Graphs
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Randomized strategies for the plurality problem
Discrete Applied Mathematics
On randomized broadcasting in Star graphs
Discrete Applied Mathematics
Weaknesses of Cuckoo Hashing with a Simple Universal Hash Class: The Case of Large Universes
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Single- and multi-objective evolutionary algorithms for graph bisectioning
Proceedings of the tenth ACM SIGEVO workshop on Foundations of genetic algorithms
On the utility of the population size for inversely fitness proportional mutation rates
Proceedings of the tenth ACM SIGEVO workshop on Foundations of genetic algorithms
Minimizing the communication cost for continuous skyline maintenance
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
On the runtime and robustness of randomized broadcasting
Theoretical Computer Science
Concurrent imitation dynamics in congestion games
Proceedings of the 28th ACM symposium on Principles of distributed computing
An analysis of reduced error pruning
Journal of Artificial Intelligence Research
Optimal many-to-one routing on the mesh with constant queues
Information Processing Letters
Algorithms for memory hierarchies: advanced lectures
Algorithms for memory hierarchies: advanced lectures
Knowledge-binding commitments with applications in time-stamping
PKC'07 Proceedings of the 10th international conference on Practice and theory in public-key cryptography
Broadcasting vs. mixing and information dissemination on Cayley graphs
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Association rule mining: models and algorithms
Association rule mining: models and algorithms
Call to order: a hierarchical browsing approach to eliciting users' preference
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Thinning protocols for routing h-relations over shared media
Journal of Parallel and Distributed Computing
Communication complexity of quasirandom rumor spreading
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Efficient broadcasting in random power law networks
WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
Discovery of frequent patterns in transactional data streams
Transactions on large-scale data- and knowledge-centered systems II
Discovery of frequent patterns in transactional data streams
Transactions on large-scale data- and knowledge-centered systems II
TAPAS'11 Proceedings of the First international ICST conference on Theory and practice of algorithms in (computer) systems
Practical Oblivious Outsourced Storage
ACM Transactions on Information and System Security (TISSEC)
On the price of security in large-scale wireless ad hoc networks
IEEE/ACM Transactions on Networking (TON)
Guaranteeing access in spite of distributed service-flooding attacks
Proceedings of the 11th international conference on Security Protocols
Balanced allocation and dictionaries with tightly packed constant size bins
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Finding frequent patterns in a string in sublinear time
ESA'05 Proceedings of the 13th annual European conference on Algorithms
On the structure and complexity of worst-case equilibria
WINE'05 Proceedings of the First international conference on Internet and Network Economics
Randomised broadcasting: memory vs. randomness
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Multi-budgeted matchings and matroid intersection via dependent rounding
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Toward the eigenvalue power law
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
On randomized broadcasting in power law networks
DISC'06 Proceedings of the 20th international conference on Distributed Computing
On randomized broadcasting in star graphs
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
On the runtime and robustness of randomized broadcasting
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
A Simpler Approach to Matrix Completion
The Journal of Machine Learning Research
Exact and approximate algorithms for the most connected vertex problem
ACM Transactions on Database Systems (TODS)
PKDPA: an enhanced probabilistic differential power attack methodology
INDOCRYPT'11 Proceedings of the 12th international conference on Cryptology in India
Computer Science Review
Survey: The cook-book approach to the differential equation method
Computer Science Review
The impact of the power law exponent on the behavior of a dynamic epidemic type process
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
Synopses for Massive Data: Samples, Histograms, Wavelets, Sketches
Foundations and Trends in Databases
On the connectivity of bluetooth-based ad hoc networks
Euro-Par'07 Proceedings of the 13th international Euro-Par conference on Parallel Processing
Approximating wardrop equilibria with finitely many agents
DISC'07 Proceedings of the 21st international conference on Distributed Computing
Randomised broadcasting: Memory vs. randomness
Theoretical Computer Science
Asymptotic Analysis on Secrecy Capacity in Large-Scale Wireless Networks
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.90 |