A survey of linear programming in randomized subexponential time
ACM SIGACT News
ACM SIGACT News
ACM Computing Surveys (CSUR)
ACM Computing Surveys (CSUR)
Mining optimized association rules for numeric attributes
PODS '96 Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Efficient algorithms for inverting evolution
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Strategic directions in research in theory of computing
ACM Computing Surveys (CSUR) - Special ACM 50th-anniversary issue: strategic directions in computing research
Uniform and Self-Stabilizing Token Rings Allowing Unfair Daemon
IEEE Transactions on Parallel and Distributed Systems
Exactly Learning Automata of Small Cover Time
Machine Learning - Special issue on the eighth annual conference on computational learning theory, (COLT '95)
On the anomaly of ran1() in Monte Carlo pricing of financial derivatives
WSC '96 Proceedings of the 28th conference on Winter simulation
Using content-derived names for configuration management
Proceedings of the 1997 symposium on Software reusability
Efficient computations on fault-prone BSP machines
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
Allocating weighted jobs in parallel
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
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
Two algorithms for nearest-neighbor search in high dimensions
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
The Swendsen-Wang process does not always mix rapidly
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
MobiCom '97 Proceedings of the 3rd annual ACM/IEEE international conference on Mobile computing and networking
RAPID: randomized pharmacophore identification for drug design
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
A new general derandomization method
Journal of the ACM (JACM)
Approximate graph coloring by semidefinite programming
Journal of the ACM (JACM)
Randomized binary search trees
Journal of the ACM (JACM)
Throughput-competitive admission control for continuous media databases
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Efficient searching with linear constraints
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
CURE: an efficient clustering algorithm for large databases
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Random sampling for histogram construction: how much is enough?
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Random generation of embedded graphs and an extension to Dobrushin uniqueness (extended abstract)
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Decoding algebraic-geometric codes beyond the error-correction bound
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Analysis of low density codes and improved designs using irregular graphs
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Finding almost-satisfying assignments
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Adaptive versus nonadaptive attribute-efficient learning
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Approximate nearest neighbors: towards removing the curse of dimensionality
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Improved incremental randomized Delaunay triangulation
Proceedings of the fourteenth annual symposium on Computational geometry
On enumerating and selecting distances
Proceedings of the fourteenth annual symposium on Computational geometry
Towards a theory of cost management for digital libraries and electronic commerce
ACM Transactions on Database Systems (TODS)
“Dynamic-fault-prone BSP”: a paradigm for robust computations in changing environments
Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures
Algorithms for optical mapping
RECOMB '98 Proceedings of the second annual international conference on Computational molecular biology
Solving puzzles related to permutation groups
ISSAC '98 Proceedings of the 1998 international symposium on Symbolic and algebraic computation
Crowds: anonymity for Web transactions
ACM Transactions on Information and System Security (TISSEC)
Towards a polynomial-time randomized algorithm for closed product-form networks
ACM Transactions on Modeling and Computer Simulation (TOMACS)
The branching factor of regular search spaces
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Using randomization in the teaching of data structures and algorithms
SIGCSE '99 The proceedings of the thirtieth SIGCSE technical symposium on Computer science education
Efficient algorithms for geometric optimization
ACM Computing Surveys (CSUR)
Optimal buy-and-hold strategies for financial markets with bounded daily returns
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Extracting all the randomness and reducing the error in Trevisan's extractors
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Majorizing estimators and the approximation of #P-complete problems
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
A lower bound on the complexity of approximate nearest-neighbor searching on the Hamming cube
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Lower bounds for leader election and collective coin-flipping in the perfect information model
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
A faster distributed algorithm for computing maximal matchings deterministically
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Finding similar regions in many strings
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
Scheduling threads for low space requirement and good locality
Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures
Multi-fidelity algorithms for interactive mobile applications
DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
Fixed-dimensional parallel linear programming via relative &egr;-approximations
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Better approximation guarantees for job-shop scheduling
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Randomized fully-scalable BSP techniques for multi-searching and convex hull construction
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Kinetic binary space partitions for intersecting segments and disjoint triangles
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
On the distributed complexity of computing maximal matchings
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Output-sensitive generation of random events
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Bounding the diffuse adversary
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Fast distributed algorithms for Brooks-Vizing colourings
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Optimal on-line algorithms for an electronic commerce money distribution system
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Indexing schemes for random points
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Distinguishing string selection problems
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
New algorithmic aspects of the Local Lemma with applications to routing and partitioning
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Efficient algorithms for inverting evolution
Journal of the ACM (JACM)
A selective location update strategy for PCS users
Wireless Networks
Minimum cuts in near-linear time
Journal of the ACM (JACM)
RECOMB '00 Proceedings of the fourth annual international conference on Computational molecular biology
ACM Computing Surveys (CSUR)
Towards estimation error guarantees for distinct values
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Pseudo-random functions and factoring (extended abstract)
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
The small-world phenomenon: an algorithmic perspective
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Near optimal multiple alignment within a band in polynomial time
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Random walks with “back buttons” (extended abstract)
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Query strategies for priced information (extended abstract)
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
When crossings count — approximating the minimum spanning tree
Proceedings of the sixteenth annual symposium on Computational geometry
Cooperative facility location games
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Efficient on-line communication in cellular networks
Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures
Static scheduling algorithms for allocating directed task graphs to multiprocessors
ACM Computing Surveys (CSUR)
Fast practical algorithms for the Boolean-product-witness-matrix problem
ISSAC '00 Proceedings of the 2000 international symposium on Symbolic and algebraic computation
Energy-efficient randomized routing in radio networks
DIALM '00 Proceedings of the 4th international workshop on Discrete algorithms and methods for mobile computing and communications
Clustering algorithms for wireless ad hoc networks
DIALM '00 Proceedings of the 4th international workshop on Discrete algorithms and methods for mobile computing and communications
Randomized Initialization Protocols for Ad Hoc Networks
IEEE Transactions on Parallel and Distributed Systems
Energy-Efficient Initialization Protocols for Single-Hop Radio Networks with No Collision Detection
IEEE Transactions on Parallel and Distributed Systems
New approaches to covering and packing problems
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Stability preserving transformations: packet routing networks with edge capacities and speeds
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Competitive auctions and digital goods
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Equitable colorings extend Chernoff-Hoeffding bounds
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
On the discrete Bak-Sneppen model of self-organized criticality
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Design and analysis of physical design algorithms
Proceedings of the 2001 international symposium on Physical design
Finding authorities and hubs from link structures on the World Wide Web
Proceedings of the 10th international conference on World Wide Web
Optimal aggregation algorithms for middleware
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Convex quadratic and semidefinite programming relaxations in scheduling
Journal of the ACM (JACM)
Finding large independent sets of hypergraphs in parallel
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Periodic, random-fault-tolerant correction networks
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Running time and program size for self-assembled squares
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
ACM Transactions on Internet Technology (TOIT)
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
The randomized z-buffer algorithm: interactive rendering of highly complex scenes
Proceedings of the 28th annual conference on Computer graphics and interactive techniques
Distributed multi-broadcast in unknown radio networks
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Counting by quantum eigenvalue estimation
Theoretical Computer Science
An empirical study of operating systems errors
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
The architecture of robust publishing systems
ACM Transactions on Internet Technology (TOIT)
Fault Detection for Byzantine Quorum Systems
IEEE Transactions on Parallel and Distributed Systems
Information and Computation
On the closest string and substring problems
Journal of the ACM (JACM)
Distributed probabilistic polling and applications to proportionate agreement
Information and Computation
Multi-fidelity algorithms for interactive mobile applications
Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
Rational Interpolation Examples in Performance Analysis
IEEE Transactions on Computers
The nonapproximability of OBDD minimization
Information and Computation
Selfish traffic allocation for server farms
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Tight security proofs for the bounded-storage model
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Tradeoffs in probabilistic packet marking for IP traceback
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Algorithmic derandomization via complexity theory
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
The structure of broad topics on the web
Proceedings of the 11th international conference on World Wide Web
Proceedings of the 11th international conference on World Wide Web
Randomized initialization protocols for radio networks
Handbook of wireless networks and mobile computing
Leader election protocols for radio networks
Handbook of wireless networks and mobile computing
Models and issues in data stream systems
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Graph cutting algorithms for distributed applications partitioning
ACM SIGMETRICS Performance Evaluation Review
Censorship resistant peer-to-peer content addressable networks
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Tight bounds for worst-case equilibria
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Maintaining stream statistics over sliding windows: (extended abstract)
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Wavelet synopses with error guarantees
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
On-line load balancing of temporary tasks revisited
Theoretical Computer Science
Uniform Leader Election Protocols for Radio Networks
IEEE Transactions on Parallel and Distributed Systems
On the analysis of the (1+ 1) evolutionary algorithm
Theoretical Computer Science
Explicit and implicit enforcing: randomized optimization
Computational Discrete Mathematics
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Efficient algorithms for leader election in radio networks
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Viceroy: a scalable and dynamic emulation of the butterfly
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Efficient randomized web-cache replacement schemes using samples from past eviction times
IEEE/ACM Transactions on Networking (TON)
Evolution strategies –A comprehensive introduction
Natural Computing: an international journal
On the approximation of the minimum disturbance p-facility location problem
Discrete Applied Mathematics - Special issue: Third ALIO-EURO meeting on applied combinatorial optimization
VRST '02 Proceedings of the ACM symposium on Virtual reality software and technology
Efficient packet marking for large-scale IP traceback
Proceedings of the 9th ACM conference on Computer and communications security
Unified approach fuzzy graph problems
Fuzzy Sets and Systems - Theme: Decision and optimization
Adaptive Versus Nonadaptive Attribute-Efficient Learning
Machine Learning
Cosmological lower bound on the circuit complexity of a small problem in logic
Journal of the ACM (JACM)
A probabilistic constructive approach to optimization problems
Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design
Computational Optimization and Applications
On the Hamming distance of constraint satisfaction problems
Theoretical Computer Science - Complexity and logic
On computing the diameter of a point set in high dimensional Euclidean space
Theoretical Computer Science
Finding Interesting Associations without Support Pruning
IEEE Transactions on Knowledge and Data Engineering
Energy-Efficient Routing in the Broadcast Communication Model
IEEE Transactions on Parallel and Distributed Systems
General partitioning on random graphs
Journal of Algorithms
How to analyse evolutionary algorithms
Theoretical Computer Science - Natural computing
Theoretical Computer Science - Natural computing
Algorithms, nymphs, and shepherds
Theoretical Computer Science
Property testers for dense constraint satisfaction programs on finite domains
Random Structures & Algorithms
On asymptotically optimal methods of prediction and adaptive coding for Markov sources
Journal of Complexity
Approximate congruence in nearly linear time
Computational Geometry: Theory and Applications - Fourth CGC workshop on computional geometry
Finding similar regions in many sequences
Journal of Computer and System Sciences - STOC 1999
Extracting all the randomness and reducing the error in Trevisan's extractors
Journal of Computer and System Sciences - STOC 1999
Randomized path coloring on binary trees
Theoretical Computer Science
Chord: a scalable peer-to-peer lookup protocol for internet applications
IEEE/ACM Transactions on Networking (TON)
Journal of Parallel and Distributed Computing - Self-stabilizing distributed systems
Competitive on-line scheduling of continuous-media streams
Journal of Computer and System Sciences
A bounding chain for Swendsen-Wang
Random Structures & Algorithms
Multimedia content screening using a dual watermarking and fingerprinting system
Proceedings of the tenth ACM international conference on Multimedia
Selection with monotone comparison costs
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Property testing of data dimensionality
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Integrality ratio for group Steiner trees and directed steiner trees
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Simultaneous optimization for concave costs: single sink aggregation or single source buy-at-bulk
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Deterministic identity testing for multivariate polynomials
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
On Performance Estimates for Two Evolutionary Algorithms
Proceedings of the EvoWorkshops on Applications of Evolutionary Computing
On the Effectiveness of D-BSP as a Bridging Model of Parallel Computation
ICCS '01 Proceedings of the International Conference on Computational Science-Part II
Nearest Neighbors Can Be Found Efficiently If the Dimension Is Small Relative to the Input Size
ICDT '03 Proceedings of the 9th International Conference on Database Theory
A New Min-Cut Max-Flow Ratio for Multicommodity Flows
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
An Efficient Routing Protocol for Hierarchical Ad-hoc Mobile Networks
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Competitive Analysis of On-line Randomized Call Control in Cellular Networks
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Fundamental Protocols on Wireless Sensor Networks
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Agent-Based Distance Vector Routing
MATA '01 Proceedings of the Third International Workshop on Mobile Agents for Telecommunication Applications
PARA '02 Proceedings of the 6th International Conference on Applied Parallel Computing Advanced Scientific Computing
PLATINUM: A Placement Tool Based on Process Initiative
PaCT '999 Proceedings of the 5th International Conference on Parallel Computing Technologies
News from the Online Traveling Repairman
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Approximate Verification of Probabilistic Systems
PAPM-PROBMIV '02 Proceedings of the Second Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
On the Analysis of Dynamic Restart Strategies for Evolutionary Algorithms
PPSN VII Proceedings of the 7th International Conference on Parallel Problem Solving from Nature
Similarity Search in High Dimensions via Hashing
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Local Dimensionality Reduction: A New Approach to Indexing High Dimensional Spaces
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
On Network Design Problems: Fixed Cost Flows and the Covering Steiner Problem
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
Fast Randomized Algorithms for Robust Estimation of Location
TSDM '00 Proceedings of the First International Workshop on Temporal, Spatial, and Spatio-Temporal Data Mining-Revised Papers
Resizable Arrays in Optimal Time and Space
WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
Efficient Web Searching Using Temporal Factors
WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Seller-Focused Algorithms for Online Auctioning
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Efficient Routing in Networks with Long Range Contacts
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
Verifying Probabilistic Programs Using a Hoare like Logic
ASIAN '99 Proceedings of the 5th Asian Computing Science Conference on Advances in Computing Science
Improved Boneh-Shaw Content Fingerprinting
CT-RSA 2001 Proceedings of the 2001 Conference on Topics in Cryptology: The Cryptographer's Track at RSA
Fair e-Lotteries and e-Casinos
CT-RSA 2001 Proceedings of the 2001 Conference on Topics in Cryptology: The Cryptographer's Track at RSA
Distributed Probabilistic Polling and Applications to Proportionate Agreement
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Theoretical Aspects of Evolutionary Algorithms
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Why Computational Complexity Requires Stricter Martingales
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
A PTAS for Distinguishing (Sub)string Selection
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
A Bound on the Capacity of Backoff and Acknowledgement-Based Protocols
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
A Parallel Algorithm for Sampling Matchings from an Almost Uniform Distribution
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Randomized O (log log n)-Round Leader Election Protocols in Packet Radio Networks
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Randomized K-Dimensional Binary Search Trees
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Coupon Collectors, q-Binomial Coefficients and the Unsatisfiability Threshold
ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
Energy-Efficient Initialization Protocols for Ad-hoc Radio Networks
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
The Query Complexity of Program Checking by Constant-Depth Circuits
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
Randomized Leader Election Protocols in Radio Networks with No Collision Detection
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Approximation Algorithms for the Maximum Power Consumption Problem on Combinatorial Circuits
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Randomized Shared Queues Applied to Distributed Optimization Algorithms
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Quantum Algorithms for Intersection and Proximity Problems
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Go with the Winners Algorithms for Cliques in Random Graphs
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Approximation Algorithms for Some Parameterized Counting Problems
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
A Formal Approach to Probabilistic Termination
TPHOLs '02 Proceedings of the 15th International Conference on Theorem Proving in Higher Order Logics
Distributed Soft Path Coloring
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Parallel Shortest Path for Arbitrary Graphs
Euro-Par '00 Proceedings from the 6th International Euro-Par Conference on Parallel Processing
Weak Communication in Radio Networks
Euro-Par '02 Proceedings of the 8th International Euro-Par Conference on Parallel Processing
Some Parallel Algorithms for Integer Factorisation
Euro-Par '99 Proceedings of the 5th International Euro-Par Conference on Parallel Processing
Efficient Randomized Routing Algorithms on the Two-Dimensional Mesh of Buses
COCOON '98 Proceedings of the 4th Annual International Conference on Computing and Combinatorics
A Randomized Algorithm for Gossiping in Radio Networks
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Energy-Efficient Size Approximation of Radio Networks with No Collision Detection
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Using PageRank to Characterize Web Structure
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Solving Constraint Satisfaction Problems with DNA Computing
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Randomized path coloring on binary trees
APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
Wavelength rerouting in optical networks, or the Venetian routing problem
APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
Information Theoretically Secure Communication in the Limited Storage Space Model
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
Quantitative Observables and Averages in Probabilistic Constraint Programming
Selected papers from the Joint ERCIM/Compulog Net Workshop on New Trends in Contraints
Efficient Object Identification with Passive RFID Tags
Pervasive '02 Proceedings of the First International Conference on Pervasive Computing
Irregularities of Distribution, Derandomization, and Complexity Theory
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
Random Geometric Problems on [0, 1]²
RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
Sampling Methods Applied to Dense Instances of Non-Boolean Optimization Problems
RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
Exact Sampling in Machine Scheduling Problems
APPROX '01/RANDOM '01 Proceedings of the 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and 5th International Workshop on Randomization and Approximation Techniques in Computer Science: Approximation, Randomization and Combinatorial Optimization
On Computing Ad-hoc Selective Families
APPROX '01/RANDOM '01 Proceedings of the 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and 5th International Workshop on Randomization and Approximation Techniques in Computer Science: Approximation, Randomization and Combinatorial Optimization
Equitable Coloring Extends Chernoff-Hoeffding Bounds
APPROX '01/RANDOM '01 Proceedings of the 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and 5th International Workshop on Randomization and Approximation Techniques in Computer Science: Approximation, Randomization and Combinatorial Optimization
Algorithms on Compressed Strings and Arrays
SOFSEM '99 Proceedings of the 26th Conference on Current Trends in Theory and Practice of Informatics on Theory and Practice of Informatics
Efficient Amplification of the Security of Weak Pseudo-random Function Generators
EUROCRYPT '01 Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
Probabilistic Rewrite Strategies. Applications to ELAN
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
WAE '99 Proceedings of the 3rd International Workshop on Algorithm Engineering
WAE '00 Proceedings of the 4th International Workshop on Algorithm Engineering
Approximation Algorithms for Finding Best Viewpoints
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
Decision Complexity in Dynamic Geometry
ADG '00 Revised Papers from the Third International Workshop on Automated Deduction in Geometry
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
Approximate Constrained Bipartite Edge Coloring
WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
Computational Aspects of Parallel Attribute-Efficient Learning
ALT '98 Proceedings of the 9th International Conference on Algorithmic Learning Theory
On Learning Correlated Boolean Functions Using Statistical Queries
ALT '01 Proceedings of the 12th International Conference on Algorithmic Learning Theory
A Polynominal Time Approximation Scheme for the Closest Substring Problem
COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching
A Fast Random Greedy Algorithm for the Component Commonality Problem
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
On Computing the Diameter of a Point Set in High Dimensional Euclidean Space
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
Approximation Algorithms for Restoration Capacity Planning
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
On the Analysis of Evolutionary Algorithms - A Proof That Crossover Really Can Help
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
Multipacket Routing on 2-D Meshes and Its Application to Fault-Tolerant Routing
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
Strongly Competitive Algorithms for Caching with Pipelined Prefetching
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
A Simple Shortest Path Algorithm with Linear Average Time
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Round Robin Is Optimal for Fault-Tolerant Broadcasting on Wireless Networks
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Competitive Auctions for Multiple Digital Goods
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Frequency Estimation of Internet Packet Streams with Limited Space
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
A Fast, Accurate and Simple Method for Pricing European-Asian and Saving-Asian Options
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Estimating Rarity and Similarity over Data Stream Windows
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Improved Cryptanalysis of MISTY1
FSE '02 Revised Papers from the 9th International Workshop on Fast Software Encryption
Using the Pseudo-Dimension to Analyze Approximation Algorithms for Integer Programming
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Randomized Pursuit-Evasion in Graphs
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
On Quantum Versions of the Yao Principle
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Techniques for Estimation of Design Diversity for Combinational Logic Circuits
DSN '01 Proceedings of the 2001 International Conference on Dependable Systems and Networks (formerly: FTCS)
Randomized online multi-threaded paging
Nordic Journal of Computing
Theoretical Computer Science
News from the online traveling repairman
Theoretical Computer Science - Mathematical foundations of computer science
Lower bounds for dynamic transitive closure, planar point location, and parantheses matching
Nordic Journal of Computing
Interval selection: applications, algorithms, and lower bounds
Journal of Algorithms
ISOSLIDER: a system for interactive exploration of isosurfaces
VISSYM '03 Proceedings of the symposium on Data visualisation 2003
What's hot and what's not: tracking most frequent items dynamically
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Scaling personalized web search
WWW '03 Proceedings of the 12th international conference on World Wide Web
Wavelength rerouting in optical networks, or the Venetian Routing problem
Journal of Algorithms
Degree constrained book embeddings
Journal of Algorithms
IEEE Transactions on Parallel and Distributed Systems
TCP is competitive against a limited adversary
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
On the maximum stable throughput problem in random networks with directional antennas
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Query strategies for priced information
Journal of Computer and System Sciences - Special issue on STOC 2000
Clustering in massive data sets
Handbook of massive data sets
Convergent algorithms for collaborative filtering
Proceedings of the 4th ACM conference on Electronic commerce
Randomly coloring graphs of girth at least five
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Some 3CNF properties are hard to test
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Meet and merge: approximation algorithms for confluent flows
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
The intrinsic dimensionality of graphs
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Consistent load balancing via spread minimization
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Conductance and congestion in power law graphs
SIGMETRICS '03 Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Journal of Parallel and Distributed Computing - Special issue on wireless and mobile ad hoc networking and computing
Distributed communication algorithms for ad hoc mobile networks
Journal of Parallel and Distributed Computing - Special issue on wireless and mobile ad hoc networking and computing
A self-stabilizing distributed algorithm for spanning tree construction in wireless ad hoc networks
Journal of Parallel and Distributed Computing - Special issue on wireless and mobile ad hoc networking and computing
Diffusion without false rumors: on propagating updates in a Byzantine environment
Theoretical Computer Science
Towards optimal lower bounds for clique and chromatic number
Theoretical Computer Science
On finding common neighborhoods in massive graphs
Theoretical Computer Science
A Short Guide To Approximation Preserving Reductions
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Accelerating Approximate Subsequence Search on Large Protein Sequence Databases
CSB '02 Proceedings of the IEEE Computer Society Conference on Bioinformatics
Stochastic Load Balancing and Related Problems
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
A Probabilistic Algorithm for k-SAT and Constraint Satisfaction Problems
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
On Diffusing Updates in a Byzantine Environment
SRDS '99 Proceedings of the 18th IEEE Symposium on Reliable Distributed Systems
On cutting a few vertices from a graph
Discrete Applied Mathematics
Journal of Computer and System Sciences - Special issue on PODS 2000
Probabilistic algorithmic knowledge
Proceedings of the 9th conference on Theoretical aspects of rationality and knowledge
Energy-Efficient Initialization Protocols for Radio Networks with no Collision Detection
ICPP '00 Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing
Finding Essential Attributes from Binary Data
Annals of Mathematics and Artificial Intelligence
Distributed broadcast in radio networks of unknown topology
Theoretical Computer Science
SETS: search enhanced by topic segmentation
Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval
Optimal aggregation algorithms for middleware
Journal of Computer and System Sciences - Special issu on PODS 2001
Competitive video on demand schedulers for popular movies
Discrete Applied Mathematics - Special issue: Algorithmic aspects of communication
Scalable and dynamic quorum systems
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Routing networks for distributed hash tables
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Robust and efficient fuzzy match for online data cleaning
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Towards ambitious approximation algorithms in stubborn set optimization
Fundamenta Informaticae - Concurrency specification and programming
Analysis of a randomized rendezvous algorithm
Information and Computation
Applications of Probabilistic Quorums to Iterative Algorithms
ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
DMKD '03 Proceedings of the 8th ACM SIGMOD workshop on Research issues in data mining and knowledge discovery
Equilibria in topology control games for ad hoc networks
DIALM-POMC '03 Proceedings of the 2003 joint workshop on Foundations of mobile computing
Distinguishing string selection problems
Information and Computation
A Random Graph Model for Optical Networks of Sensors
IEEE Transactions on Mobile Computing
On the distribution of the number of roots of polynomials and explicit weak designs
Random Structures & Algorithms
Navigating massive data sets via local clustering
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
Estimating network size from local information
Information Processing Letters
Optimizing result prefetching in web search engines with segmented indices
ACM Transactions on Internet Technology (TOIT)
Proceedings of the 2004 ACM symposium on Applied computing
Journal of Functional Programming
Simulated Annealing and Graph Colouring
Combinatorics, Probability and Computing
Explicit Constructions of Rödl's Asymptotically Good Packings and Coverings
Combinatorics, Probability and Computing
Random Structures & Algorithms
A Human-Computer Interactive Method for Projected Clustering
IEEE Transactions on Knowledge and Data Engineering
Round Robin is optimal for fault-tolerant broadcasting on wireless networks
Journal of Parallel and Distributed Computing
A hierarchical adaptive distributed algorithm for load balancing
Journal of Parallel and Distributed Computing
On the power assignment problem in radio networks
Mobile Networks and Applications - Discrete algorithms and methods for mobile computing and communications
Comparison of Certain Evolutionary Algorithms
Automation and Remote Control
A random graph approach to NMR sequential assignment
RECOMB '04 Proceedings of the eighth annual international conference on Resaerch in computational molecular biology
ACM Transactions on Database Systems (TODS)
Probabilistic wavelet synopses
ACM Transactions on Database Systems (TODS)
The Knowledge Engineering Review
Covering minimum spanning trees of random subgraphs
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
The wake-up problem in multi-hop radio networks
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
On finding a guard that sees most and a shop that sells most
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Lattice sensor networks: capacity limits, optimal routing and robustness to failures
Proceedings of the 3rd international symposium on Information processing in sensor networks
Set k-cover algorithms for energy efficient monitoring in wireless sensor networks
Proceedings of the 3rd international symposium on Information processing in sensor networks
Hardness of approximation for non-overlapping local alignments
Discrete Applied Mathematics
Cooperative facility location games
Journal of Algorithms - Special issue: SODA 2000
Cost-Driven Selection of Parity Trees
VTS '04 Proceedings of the 22nd IEEE VLSI Test Symposium
Evaluating holistic aggregators efficiently for very large datasets
The VLDB Journal — The International Journal on Very Large Data Bases
Capacity bounds for three classes of wireless networks: asymmetric, cluster, and hybrid
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
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
Journal of Systems and Software - Special issue: Computer systems
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
On the complexity of the discrete logarithm and Diffie-Hellman problems
Journal of Complexity - Special issue on coding and cryptography
Computational Geometry: Theory and Applications - Special issue on the 14th Canadian conference on computational geometry CCCG02
Optimal Time Bounds for Approximate Clustering
Machine Learning
Geometric generalizations of the power of two choices
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Fighting against two adversaries: page migration in dynamic networks
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
The effect of faults on network expansion
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries
Journal of the ACM (JACM)
A lower bound for testing juntas
Information Processing Letters
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Balanced binary trees for ID management and load balance in distributed hash tables
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
On the Morality of Artificial Agents
Minds and Machines
Mobile Networks and Applications
Approximating a collection of frequent sets
Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
Utility computing SLA management based upon business objectives
IBM Systems Journal
Competitive algorithms for the dynamic selection of component implementations
IBM Systems Journal
Mercury: supporting scalable multi-attribute range queries
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Strongly competitive algorithms for caching with pipelined prefetching
Information Processing Letters - Devoted to the rapid publication of short contributions to information processing
External matrix multiplication and all-pairs shortest path
Information Processing Letters - Devoted to the rapid publication of short contributions to information processing
Real royal road functions for constant population size
Theoretical Computer Science
A Dual Watermark-Fingerprint System
IEEE MultiMedia
Batch conflict resolution algorithm with progressively accurate multiplicity estimation
Proceedings of the 2004 joint workshop on Foundations of mobile computing
Efficient Design Diversity Estimation for Combinational Circuits
IEEE Transactions on Computers
Computational Geometry: Theory and Applications - Special issue on the 10th fall workshop on computational geometry
Randomized naming using wait-free shared variables
Distributed Computing
Variational Chernoff bounds for graphical models
UAI '04 Proceedings of the 20th conference on Uncertainty in artificial intelligence
Tracking set-expression cardinalities over continuous update streams
The VLDB Journal — The International Journal on Very Large Data Bases
Approximate constrained bipartite edge coloring
Discrete Applied Mathematics
Precise interprocedural analysis using random interpretation
Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The predecessor attack: An analysis of a threat to anonymous communications systems
ACM Transactions on Information and System Security (TISSEC)
A simple and deterministic competitive algorithm for online facility location
Information and Computation - Special issue: Commemorating the 50th birthday anniversary of Paris C. Kanellakis
Journal of the ACM (JACM)
Using the small-world model to improve Freenet performance
Computer Networks: The International Journal of Computer and Telecommunications Networking
Subspace clustering for high dimensional categorical data
ACM SIGKDD Explorations Newsletter
Data structures for maintaining set partitions
Random Structures & Algorithms
On the Optimization of Monotone Polynomials by Simple Randomized Search Heuristics
Combinatorics, Probability and Computing
Fast Recognition of Musical Genres Using RBF Networks
IEEE Transactions on Knowledge and Data Engineering
Recurrence equation as basis for designing hot-potato routing protocols
CompSysTech '04 Proceedings of the 5th international conference on Computer systems and technologies
ACM Transactions on Internet Technology (TOIT)
Fun-sort--or the chaos of unordered binary search
Discrete Applied Mathematics - Fun with algorithms 2 (FUN 2001)
Optimal Oblivious Path Selection on the Mesh
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Coordination mechanisms for congestion games
ACM SIGACT News
ACM SIGACT News
Deterministic wavelet thresholding for maximum-error metrics
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Efficiency test of pseudorandom number generators using random walks
Journal of Computational and Applied Mathematics
Performance analysis of a greedy algorithm for inferring boolean functions
Information Processing Letters
Simple and Efficient Oracle-Based Consensus Protocols for Asynchronous Byzantine Systems
IEEE Transactions on Dependable and Secure Computing
Trade-offs in probabilistic packet marking for IP traceback
Journal of the ACM (JACM)
Oblivious routing in directed graphs with random demands
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
On the bias of traceroute sampling: or, power-law degree distributions in regular graphs
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Scaling link-based similarity search
WWW '05 Proceedings of the 14th international conference on World Wide Web
What's hot and what's not: tracking most frequent items dynamically
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2003
XML stream processing using tree-edit distance embeddings
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2003
A probabilistic model of computing with words
Journal of Computer and System Sciences
Hybrid sensor networks: a small world
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Randomized dynamic route maintenance for adaptive routing in multihop mobile ad hoc networks
Journal of Parallel and Distributed Computing
Analyzing and enhancing the resilience of structured peer-to-peer systems
Journal of Parallel and Distributed Computing
Graceful service degradation (or, how to know your payment is late)
Proceedings of the 6th ACM conference on Electronic commerce
Secure distributed human computation
Proceedings of the 6th ACM conference on Electronic commerce
A data streaming algorithm for estimating subpopulation flow size distribution
SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Join-distinct aggregate estimation over update streams
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Space efficient mining of multigraph streams
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Profiling and mapping of parallel workloads on network processors
Proceedings of the 2005 ACM symposium on Applied computing
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Not all linear functions are equally difficult for the compact genetic algorithm
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
On the impact of objective function transformations on evolutionary and black-box algorithms
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Rigorous runtime analysis of a (μ+1)ES for the sphere function
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Isomorphism and embedding problems for infinite limits of scale-free graphs
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Adaptivity and approximation for stochastic packing problems
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Space-time tradeoffs for approximate spherical range counting
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Coins make quantum walks faster
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Conformance testing in the presence of multiple faults
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
A Generic Scheme for Color Image Retrieval Based on the Multivariate Wald-Wolfowitz Test
IEEE Transactions on Knowledge and Data Engineering
A generalization of the 0-1 principle for sorting
Information Processing Letters
An improved data stream summary: the count-min sketch and its applications
Journal of Algorithms
A scheme for load balancing in heterogenous distributed hash tables
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Randomization does not reduce the average delay in parallel packet switches
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Decentralized algorithms using both local and random probes for P2P load balancing
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Collaborate with strangers to find own preferences
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Oblivious routing on geometric networks
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Adversarial contention resolution for simple channels
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Balanced vertex-orderings of graphs
Discrete Applied Mathematics
Encyclopedia of Computer Science
On network design problems: fixed cost flows and the covering steiner problem
ACM Transactions on Algorithms (TALG)
Autonomous virtual mobile nodes
DIALM-POMC '05 Proceedings of the 2005 joint workshop on Foundations of mobile computing
DIALM-POMC '05 Proceedings of the 2005 joint workshop on Foundations of mobile computing
Approximate recognition of non-regular languages by finite automata
ACSC '05 Proceedings of the Twenty-eighth Australasian conference on Computer Science - Volume 38
Summarizing and mining inverse distributions on data streams via dynamic inverse sampling
VLDB '05 Proceedings of the 31st international conference on Very large data bases
On a simple randomized algorithm for finding a 2-factor in sparse graphs
Information Processing Letters
Structural filtering: a paradigm for efficient and exact geometric programs
Computational Geometry: Theory and Applications - Special issue: The 11th Candian conference on computational geometry - CCCG 99
Design considerations for network processor operating systems
Proceedings of the 2005 ACM symposium on Architecture for networking and communications systems
Web path recommendations based on page ranking and Markov models
Proceedings of the 7th annual ACM international workshop on Web information and data management
A randomized satisfiability procedure for arithmetic and uninterpreted function symbols
Information and Computation - Special issue: 19th international conference on automated deduction (CADE-19)
Real royal road functions: where crossover provably is essential
Discrete Applied Mathematics - Special issue: Boolean and pseudo-boolean funtions
On probabilistic program equivalence and refinement
CONCUR 2005 - Concurrency Theory
On authenticated computing and RSA-based authentication
Proceedings of the 12th ACM conference on Computer and communications security
Improving lookup latency in distributed hash table systems using random sampling
IEEE/ACM Transactions on Networking (TON)
Usage-Based PageRank for Web Personalization
ICDM '05 Proceedings of the Fifth IEEE International Conference on Data Mining
The Cooperative Coevolutionary (1+1) EA
Evolutionary Computation
Drift and Scaling in Estimation of Distribution Algorithms
Evolutionary Computation
On the Choice of the Offspring Population Size in Evolutionary Algorithms
Evolutionary Computation
Combination can be hard: approximability of the unique coverage problem
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Analyzing BitTorrent and related peer-to-peer networks
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
A framework for pursuit evasion games in Rn
Information Processing Letters
Learning DNF from random walks
Journal of Computer and System Sciences - Special issue: Learning theory 2003
Wavelet synopses for general error metrics
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2004
What's new: finding significant differences in network data streams
IEEE/ACM Transactions on Networking (TON)
Runtime Analysis of the (μ+1) EA on Simple Pseudo-Boolean Functions
Evolutionary Computation
Improved Boolean function hashing based on multiple-vertex dominators
Proceedings of the 2005 Asia and South Pacific Design Automation Conference
Random Embedding Machines for Pattern Recognition
Neural Computation
On the hardness of approximating Max-Satisfy
Information Processing Letters
NP-completeness for all computer science undergraduates: a novel project-based curriculum
Journal of Computing Sciences in Colleges
Geographic gossip: efficient aggregation for sensor networks
Proceedings of the 5th international conference on Information processing in sensor networks
Locally consistent constraint satisfaction problems
Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
The black-box complexity of nearest-neighbor search
Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
RaWMS -: random walk based lightweight membership service for wireless ad hoc network
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
On Floyd and Rivest's SELECT algorithm
Theoretical Computer Science
Approximation algorithms and online mechanisms for item pricing
EC '06 Proceedings of the 7th ACM conference on Electronic commerce
A polynomial time approximation scheme for embedding a directed hypergraph on a ring
Information Processing Letters
Reductions in binary search trees
Theoretical Computer Science
Confidence intervals for priority sampling
SIGMETRICS '06/Performance '06 Proceedings of the joint international conference on Measurement and modeling of computer systems
Design of a novel statistics counter architecture with optimal space and time efficiency
SIGMETRICS '06/Performance '06 Proceedings of the joint international conference on Measurement and modeling of computer systems
Subset-conjunctive rules for breast cancer diagnosis
Discrete Applied Mathematics - Special issue: Discrete mathematics & data mining II (DM & DM II)
Random walks in peer-to-peer networks: algorithms and evaluation
Performance Evaluation - P2P computing systems
Unstructured peer-to-peer networks for sharing processor cycles
Parallel Computing - Parallel matrix algorithms and applications (PMAA'04)
Partial and approximate symmetry detection for 3D geometry
ACM SIGGRAPH 2006 Papers
Evolution of page popularity under random web graph models
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Randomized computations on large data sets: tight lower bounds
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Efficient gossip-based aggregate computation
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Meet and merge: Approximation algorithms for confluent flows
Journal of Computer and System Sciences - Special issue on network algorithms 2005
On the local performance of simulated annealing and the (1+1) evolutionary algorithm
Proceedings of the 8th annual conference on Genetic and evolutionary computation
How randomized search heuristics find maximum cliques in planar graphs
Proceedings of the 8th annual conference on Genetic and evolutionary computation
Random testing of formal software models and induced coverage
Proceedings of the 1st international workshop on Random testing
On certain connectivity properties of the internet topology
Journal of Computer and System Sciences - Special issue on FOCS 2003
Scalable and dynamic quorum systems
Distributed Computing
A generic search strategy for large-scale real-world networks
InfoScale '06 Proceedings of the 1st international conference on Scalable information systems
Storage load balancing via local interactions among peers in unstructured P2P networks
InfoScale '06 Proceedings of the 1st international conference on Scalable information systems
IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
Analysis of a wireless sensor dropping problem in wide-area environmental monitoring
IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
On space-stretch trade-offs: upper bounds
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Optimal throughput-delay scaling in wireless networks: part I: the fluid model
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Decentralized erasure codes for distributed networked storage
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
The LCD interconnection of LRU caches and its analysis
Performance Evaluation
Uniform generation in spatial constraint databases and applications
Journal of Computer and System Sciences
Computer Vision and Image Understanding
Broadcast in the rendezvous model
Information and Computation
Negative dependence in the balls and bins experiment with applications to order statistics
Journal of Multivariate Analysis
Randomized registers and iterative algorithms
Distributed Computing
IEEE Transactions on Parallel and Distributed Systems
Growth codes: maximizing sensor network data persistence
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Efficient adaptive collect using randomization
Distributed Computing - Special issue: DISC 04
On optimal communication cost for gathering correlated data through wireless sensor networks
Proceedings of the 12th annual international conference on Mobile computing and networking
Large alphabets and incompressibility
Information Processing Letters
Locally testable codes and PCPs of almost-linear length
Journal of the ACM (JACM)
Analysis of a multiobjective evolutionary algorithm on the 0-1 knapsack problem
Theoretical Computer Science
Adaptive cleaning for RFID data streams
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
The power of choice in random walks: an empirical study
Proceedings of the 9th ACM international symposium on Modeling analysis and simulation of wireless and mobile systems
Data streams: algorithms and applications
Foundations and Trends® in Theoretical Computer Science
Approximation schemes for scheduling and covering on unrelated machines
Theoretical Computer Science
Tradeoffs in worst-case equilibria
Theoretical Computer Science - Approximation and online algorithms
Routing Correlated Data with Fusion Cost in Wireless Sensor Networks
IEEE Transactions on Mobile Computing
Salsa: a structured approach to large-scale anonymity
Proceedings of the 13th ACM conference on Computer and communications security
Using random sampling to build approximate tries for efficient string sorting
Journal of Experimental Algorithmics (JEA)
Ranking target objects of navigational queries
WIDM '06 Proceedings of the 8th annual ACM international workshop on Web information and data management
Using expander graphs to find vertex connectivity
Journal of the ACM (JACM)
Tight bounds for worst-case equilibria
ACM Transactions on Algorithms (TALG)
Entropy-based bounds for online algorithms
ACM Transactions on Algorithms (TALG)
Online Permutation Routing in Partitioned Optical Passive Star Networks
IEEE Transactions on Computers
On an Online Spanning Tree Problem in Randomly Weighted Graphs
Combinatorics, Probability and Computing
Dynamic storage load balancing with analogy to thermal diffusion for P2P file sharing
Interperf '06 Proceedings from the 2006 workshop on Interdisciplinary systems approach in performance evaluation and design of computer & communications sytems
Online Random Shuffling of Large Database Tables
IEEE Transactions on Knowledge and Data Engineering
Topology matters: smoothed competitiveness of metrical task systems
Theoretical Computer Science
New bounds for randomized busing
Theoretical Computer Science
A collision model for randomized routing in fat-tree networks
Journal of Parallel and Distributed Computing
Journal of Experimental Algorithmics (JEA)
The price of validity in dynamic networks
Journal of Computer and System Sciences
Data Anonymity in the FOO Voting Scheme
Electronic Notes in Theoretical Computer Science (ENTCS)
On the complexity of deriving position specific score matrices from positive and negative sequences
Discrete Applied Mathematics
Optimizing random walk search algorithms in P2P networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
A short proof of optimality for the MIN cache replacement algorithm
Information Processing Letters
Fundamenta Informaticae
Information Processing Letters
Adaptive work stealing with parallelism feedback
Proceedings of the 12th ACM SIGPLAN symposium on Principles and practice of parallel programming
Maximizing Several Cuts Simultaneously
Combinatorics, Probability and Computing
A Mechanism for Communication-Efficient Broadcast Encryption over Wireless Ad Hoc Networks
Electronic Notes in Theoretical Computer Science (ENTCS)
Proceedings of the 6th international conference on Information processing in sensor networks
Characterizing and reasoning about probabilistic and non-probabilistic expectation
Journal of the ACM (JACM)
A network flow approach to the minimum common integer partition problem
Theoretical Computer Science
Efficient implementation of Aho–Corasick pattern matching automata using Unicode
Software—Practice & Experience
The link-prediction problem for social networks
Journal of the American Society for Information Science and Technology
Optimized stratified sampling for approximate query processing
ACM Transactions on Database Systems (TODS)
Google news personalization: scalable online collaborative filtering
Proceedings of the 16th international conference on World Wide Web
Randomized local search, evolutionary algorithms, and the minimum spanning tree problem
Theoretical Computer Science
On the cover time and mixing time of random geometric graphs
Theoretical Computer Science
Presence: Teleoperators and Virtual Environments
On synopses for distinct-value estimation under multiset operations
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Conflict-free coloring for rectangle ranges using O(n.382) colors
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Energy efficient randomised communication in unknown AdHoc networks
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Joint data streaming and sampling techniques for detection of super sources and destinations
IMC '05 Proceedings of the 5th ACM SIGCOMM conference on Internet Measurement
Publius: a robust, tamper-evident, censorship-resistant web publishing system
SSYM'00 Proceedings of the 9th conference on USENIX Security Symposium - Volume 9
The Strangest Thing About Software
Computer
Building high accuracy bloom filters using partitioned hashing
Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Randomized Protocols for Duplicate Elimination in Peer-to-Peer Storage Systems
IEEE Transactions on Parallel and Distributed Systems
Optimization of continuous queries with shared expensive filters
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Near optimal multiple alignment within a band in polynomial time
Journal of Computer and System Sciences
Best of both: a hybridized centroid-medoid clustering heuristic
Proceedings of the 24th international conference on Machine learning
Induction for positive almost sure termination
Proceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming
Navigating low-dimensional and hierarchical population networks
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
On the runtime analysis of the 1-ANT ACO algorithm
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Do additional objectives make a problem harder?
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Approximating covering problems by randomized search heuristics using multi-objective models
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Analysis of evolutionary algorithms for the longest common subsequence problem
Proceedings of the 9th annual conference on Genetic and evolutionary computation
A building-block royal road where crossover is provably essential
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Web site personalization based on link analysis and navigational patterns
ACM Transactions on Internet Technology (TOIT)
Computing the types of the relationships between autonomous systems
IEEE/ACM Transactions on Networking (TON)
Theoretical Computer Science
Extending the capacity of ad hoc networks beyond network coding
IWCMC '07 Proceedings of the 2007 international conference on Wireless communications and mobile computing
Towards fast decentralized construction of locality-aware overlay networks
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Hierarchical mixture models: a probabilistic analysis
Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
The self-protection problem in wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
A near linear time constant factor approximation for Euclidean bichromatic matching (cost)
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Analytic combinatorics: a calculus of discrete structures
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Pull-based data broadcast with dependencies: be fair to users, not to items
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Matroids, secretary problems, and online mechanisms
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Estimating the distance to a monotone function
Random Structures & Algorithms
Approximate frequency counts over data streams
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Challenges: towards truly scalable ad hoc networks
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Simulated Annealing versus Metropolis for a TSP instance
Information Processing Letters
Capacity scaling in delay tolerant networks with heterogeneous mobile nodes
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
The multicast capacity of large multihop wireless networks
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
ACM Transactions on Algorithms (TALG)
Approximating the fixed linear crossing number
Discrete Applied Mathematics
Finding large cliques in sparse semi-random graphs by simple randomized search heuristics
Theoretical Computer Science
Efficient bufferless packet switching on trees and leveled networks
Journal of Parallel and Distributed Computing
A linear time deterministic algorithm to find a small subset that approximates the centroid
Information Processing Letters
A general comparison of language learning from examples and from queries
Theoretical Computer Science
Efficient and Scalable Algorithms for Inferring Likely Invariants in Distributed Systems
IEEE Transactions on Knowledge and Data Engineering
Memory-limited execution of windowed stream joins
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Objectrank: authority-based keyword search in databases
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
A generic theoretical framework for modeling gossip-based algorithms
ACM SIGOPS Operating Systems Review - Gossip-based computer networking
The power of choice in random walks: An empirical study
Computer Networks: The International Journal of Computer and Telecommunications Networking
Information Processing Letters
Distributed probabilistic inferencing in sensor networks using variational approximation
Journal of Parallel and Distributed Computing
Optimal integration error on anisotropic classes for restricted Monte Carlo and quantum algorithms
Journal of Approximation Theory
Randomized minimum spanning tree algorithms using exponentially fewer random bits
ACM Transactions on Algorithms (TALG)
Implementing the maximum of monotone algorithms
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
Authority-based keyword search in databases
ACM Transactions on Database Systems (TODS)
DirichletRank: Solving the zero-one gap problem of PageRank
ACM Transactions on Information Systems (TOIS)
Foundations and Trends® in Networking
Improved random graph isomorphism
Journal of Discrete Algorithms
Balls and bins with structure: balanced allocations on hypergraphs
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Fast approximation of the permanent for very dense problems
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Ranged hash functions and the price of churn
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Approximating connected facility location problems via random facility sampling and core detouring
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Approximating the online set multicover problems via randomized winnowing
Theoretical Computer Science
Decoherence in quantum walks – a review
Mathematical Structures in Computer Science
The distant-2 chromatic number of random proximity and random geometric graphs
Information Processing Letters
International Journal of Advanced Media and Communication
International Journal of Information and Computer Security
Sparse geometric graphs with small dilation
Computational Geometry: Theory and Applications
Nonstochastic bandits: Countable decision set, unbounded costs and reactive environments
Theoretical Computer Science
RaWMS - Random Walk Based Lightweight Membership Service for Wireless Ad Hoc Networks
ACM Transactions on Computer Systems (TOCS)
Approximate continuous querying over distributed streams
ACM Transactions on Database Systems (TODS)
Binary Search Trees, Recurrent Properties andWave Equations
Fundamenta Informaticae
Compact name-independent routing with minimum stretch
ACM Transactions on Algorithms (TALG)
How to meet in anonymous network
Theoretical Computer Science
Interfacing sensor network to grid computing with database support
ICCOMP'05 Proceedings of the 9th WSEAS International Conference on Computers
Fountain Codes Based Distributed Storage Algorithms for Large-Scale Wireless Sensor Networks
IPSN '08 Proceedings of the 7th international conference on Information processing in sensor networks
Probabilistic packet marking for large-scale IP traceback
IEEE/ACM Transactions on Networking (TON)
RT oblivious erasure correcting
IEEE/ACM Transactions on Networking (TON)
The capacity and energy efficiency of wireless ad hoc networks with multi-packet reception
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Ranking queries on uncertain data: a probabilistic threshold approach
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Query answering techniques on uncertain and probabilistic data: tutorial summary
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Proceedings of the twenty-fourth annual symposium on Computational geometry
Improved approximations for multiprocessor scheduling under uncertainty
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Dense subgraph problems with output-density conditions
ACM Transactions on Algorithms (TALG)
Atomic congestion games among coalitions
ACM Transactions on Algorithms (TALG)
A randomized competitive algorithm for evaluating priced AND/OR trees
Theoretical Computer Science
Sketches for size of join estimation
ACM Transactions on Database Systems (TODS)
Simulated annealing, its parameter settings and the longest common subsequence problem
Proceedings of the 10th annual conference on Genetic and evolutionary computation
Comparing global and local mutations on bit strings
Proceedings of the 10th annual conference on Genetic and evolutionary computation
Scheduling to maximize participation
Theoretical Computer Science
Randomness-Efficient Sampling within NC1
Computational Complexity
Adaptive work-stealing with parallelism feedback
ACM Transactions on Computer Systems (TOCS)
Population size versus runtime of a simple evolutionary algorithm
Theoretical Computer Science
Tight bounds for asynchronous randomized consensus
Journal of the ACM (JACM)
On the false-positive rate of Bloom filters
Information Processing Letters
Approximate String Matching with Address Bit Errors
CPM '08 Proceedings of the 19th annual symposium on Combinatorial Pattern Matching
Finding Additive Biclusters with Random Background
CPM '08 Proceedings of the 19th annual symposium on Combinatorial Pattern Matching
Computing Frequent Elements Using Gossip
SIROCCO '08 Proceedings of the 15th international colloquium on Structural Information and Communication Complexity
Absorbing Random Walks and the NAE2SAT Problem
FAW '08 Proceedings of the 2nd annual international workshop on Frontiers in Algorithmics
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Secure Forwarding in DHTs - Is Redundancy the Key to Robustness?
Euro-Par '08 Proceedings of the 14th international Euro-Par conference on Parallel Processing
Robust Kinetic Convex Hulls in 3D
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Ignoble Trails - Where Crossover Is Provably Harmful
Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X
Matrix Signatures: From MACs to Digital Signatures in Distributed Systems
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
A probabilistic language based on sampling functions
ACM Transactions on Programming Languages and Systems (TOPLAS)
Partially controlled deployment strategies for wireless sensors
Ad Hoc Networks
Approximate lineage for probabilistic databases
Proceedings of the VLDB Endowment
Building castles out of mud: practical access pattern privacy and correctness on untrusted storage
Proceedings of the 15th ACM conference on Computer and communications security
Dr. Searcher and Mr. Browser: a unified hyperlink-click graph
Proceedings of the 17th ACM conference on Information and knowledge management
Randomized strategies for the plurality problem
Discrete Applied Mathematics
A Knapsack Secretary Problem with Applications
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
BRICK: a novel exact active statistics counter architecture
Proceedings of the 4th ACM/IEEE Symposium on Architectures for Networking and Communications Systems
HRS: A Hybrid Replication Strategy for Exhaustive P2P Search
NPC '08 Proceedings of the IFIP International Conference on Network and Parallel Computing
On the choice of the parent population size*
Evolutionary Computation
A comparative runtime analysis of heuristic algorithms for satisfiability problems
Artificial Intelligence
The hitting and cover times of random walks on finite graphs using local degree information
Theoretical Computer Science
Efficient tag detection in RFID systems
Journal of Parallel and Distributed Computing
Improved Constructions of Quantum Automata
Theory of Quantum Computation, Communication, and Cryptography
Atomic Congestion Games: Fast, Myopic and Concurrent
SAGT '08 Proceedings of the 1st International Symposium on Algorithmic Game Theory
Frugal Routing on Wireless Ad-Hoc Networks
SAGT '08 Proceedings of the 1st International Symposium on Algorithmic Game Theory
Ensemble Engineering and Emergence
Software-Intensive Systems and New Computing Paradigms
FRAPP: a framework for high-accuracy privacy-preserving mining
Data Mining and Knowledge Discovery
Parameterizing above or below guaranteed values
Journal of Computer and System Sciences
Electronic Notes in Theoretical Computer Science (ENTCS)
Perfect matchings via uniform sampling in regular bipartite graphs
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Comparison-based time-space lower bounds for selection
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Expanders via random spanning trees
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Dimension detection via slivers
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
A polynomial-time approximation scheme for embedding hypergraph in a cycle
ACM Transactions on Algorithms (TALG)
Gossiping by processors prone to omission failures
Information Processing Letters
Finding paths of length k in O∗(2k) time
Information Processing Letters
Biased Voting and the Democratic Primary Problem
WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
Ant Colony Optimization and the Minimum Spanning Tree Problem
Learning and Intelligent Optimization
Analytic modeling of network processors for parallel workload mapping
ACM Transactions on Embedded Computing Systems (TECS)
Broadcasting in sensor networks: the role of local information
IEEE/ACM Transactions on Networking (TON)
The average-case complexity of counting distinct elements
Proceedings of the 12th International Conference on Database Theory
An optimal overlay topology for routing peer-to-peer searches
Proceedings of the ACM/IFIP/USENIX 2005 International Conference on Middleware
Lower bounds for processing data with few random accesses to external memory
Journal of the ACM (JACM)
Improved bounds on the average length of longest common subsequences
Journal of the ACM (JACM)
New lower bounds for online k-server routing problems
Information Processing Letters
Improved Approximation Algorithms for Item Pricing with Bounded Degree and Valuation
IEICE - Transactions on Information and Systems
Improved constructions of quantum automata
Theoretical Computer Science
Nearest-neighbor caching for content-match applications
Proceedings of the 18th international conference on World wide web
On the impact of the mutation-selection balance on the runtime of evolutionary algorithms
Proceedings of the tenth ACM SIGEVO workshop on Foundations of genetic algorithms
Analysis of a simple evolutionary algorithm for the multiobjective shortest path problem
Proceedings of the tenth ACM SIGEVO workshop on Foundations of genetic algorithms
Exact Solutions to the Traveling Salesperson Problem by a Population-Based Evolutionary Algorithm
EvoCOP '09 Proceedings of the 9th European Conference on Evolutionary Computation in Combinatorial Optimization
Non-monotone submodular maximization under matroid and knapsack constraints
Proceedings of the forty-first annual ACM symposium on Theory of computing
Detecting Motifs in a Large Data Set: Applying Probabilistic Insights to Motif Finding
BICoB '09 Proceedings of the 1st International Conference on Bioinformatics and Computational Biology
On the bias of traceroute sampling: Or, power-law degree distributions in regular graphs
Journal of the ACM (JACM)
On the multicast throughput capacity of network coding in wireless ad-hoc networks
Proceedings of the 2nd ACM international workshop on Foundations of wireless ad hoc and sensor networking and computing
Theoretical Computer Science
Energy efficient randomised communication in unknown AdHoc networks
Theoretical Computer Science
Smoothed analysis of probabilistic roadmaps
Computational Geometry: Theory and Applications
Approximate voronoi cell computation on spatial data streams
The VLDB Journal — The International Journal on Very Large Data Bases
Near-linear approximation algorithms for geometric hitting sets
Proceedings of the twenty-fifth annual symposium on Computational geometry
Approximation algorithms for maximum independent set of pseudo-disks
Proceedings of the twenty-fifth annual symposium on Computational geometry
On the set multi-cover problem in geometric settings
Proceedings of the twenty-fifth annual symposium on Computational geometry
Using the doubling dimension to analyze the generalization of learning algorithms
Journal of Computer and System Sciences
On the Dynamics of Social Balance on General Networks (with an application to XOR-SAT)
Fundamenta Informaticae - Machines, Computations and Universality, Part II
Optimal deterministic broadcasting in known topology radio networks
Distributed Computing
How to avoid drastic software process change (using stochastic stability)
ICSE '09 Proceedings of the 31st International Conference on Software Engineering
Self-organising agent organisations
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Sybil-resilient online content voting
NSDI'09 Proceedings of the 6th USENIX symposium on Networked systems design and implementation
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
Distinct-value synopses for multiset operations
Communications of the ACM - A View of Parallel Computing
Small synopses for group-by query verification on outsourced data streams
ACM Transactions on Database Systems (TODS)
Triangulation and embedding using small sets of beacons
Journal of the ACM (JACM)
Fixed-parameter evolutionary algorithms and the vertex cover problem
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Insight knowledge in search based software testing
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Dynamic evolutionary optimisation: an analysis of frequency and magnitude of change
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
A Kademlia-Based Node Lookup System for Anonymization Networks
ISA '09 Proceedings of the 3rd International Conference and Workshops on Advances in Information Security and Assurance
AFRICACRYPT '09 Proceedings of the 2nd International Conference on Cryptology in Africa: Progress in Cryptology
The structure and complexity of Nash equilibria for a selfish routing game
Theoretical Computer Science
Tight Bounds for the Cover Time of Multiple Random Walks
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
BloomCast: Efficient Full-Text Retrieval over Unstructured P2Ps with Guaranteed Recall
CCGRID '09 Proceedings of the 2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid
On randomized representations of graphs using short labels
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
Randomized shortest-path problems: Two related models
Neural Computation
Bootstrapping a hop-optimal network in the weak sensor model
ACM Transactions on Algorithms (TALG)
Does the turing test demonstrate intelligence or not?
AAAI'06 proceedings of the 21st national conference on Artificial intelligence - Volume 2
An Efficient Rescaled Perceptron Algorithm for Conic Systems
Mathematics of Operations Research
Multiple Round Random Ball Placement: Power of Second Chance
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
Neighbor discovery in wireless networks and the coupon collector's problem
Proceedings of the 15th annual international conference on Mobile computing and networking
Combinatorial Problems for Horn Clauses
Graph Theory, Computational Intelligence and Thought
Breaking Anonymity by Learning a Unique Minimum Hitting Set
CSR '09 Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications
Constant Factor Approximation of Edit Distance of Bounded Height Unordered Trees
SPIRE '09 Proceedings of the 16th International Symposium on String Processing and Information Retrieval
Faster Algorithms for Sampling and Counting Biological Sequences
SPIRE '09 Proceedings of the 16th International Symposium on String Processing and Information Retrieval
An Approximation Algorithm for Optimizing Multiple Path Tracking Queries over Sensor Data Streams
DEXA '09 Proceedings of the 20th International Conference on Database and Expert Systems Applications
Implementing the maximum of monotone algorithms
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
On the value of good advice: the complexity of A* search with accurate heuristics
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
Quantum computing and phase transitions in combinatorial search
Journal of Artificial Intelligence Research
The Gn,mphase transition is not hard for the Hamiltonian cycle problem
Journal of Artificial Intelligence Research
An analysis of reduced error pruning
Journal of Artificial Intelligence Research
Approximating the longest path length of a stochastic DAG by a normal distribution in linear time
Journal of Discrete Algorithms
Navigable Small-World networks with few random bits
Theoretical Computer Science
Approximate string matching with address bit errors
Theoretical Computer Science
Web page ranking based on fuzzy and learning automata
Proceedings of the International Conference on Management of Emergent Digital EcoSystems
ACM Transactions on Algorithms (TALG)
The trichotomy of HAVING queries on a probabilistic database
The VLDB Journal — The International Journal on Very Large Data Bases
Automatic retrieval of similar content using search engine query interface
Proceedings of the 18th ACM conference on Information and knowledge management
Structural filtering: a paradigm for efficient and exact geometric programs
Computational Geometry: Theory and Applications - Special issue: The 11th Candian conference on computational geometry - CCCG 99
Computer Vision and Image Understanding
Bounds on the throughput gain of network coding in unicast and multicast wireless networks
IEEE Journal on Selected Areas in Communications - Special issue on network coding for wireless communication networks
Capacity scaling of wireless networks with inhomogeneous node density: upper bounds
IEEE Journal on Selected Areas in Communications - Special issue on stochastic geometry and random graphs for the analysis and designof wireless networks
IEEE Journal on Selected Areas in Communications - Special issue on stochastic geometry and random graphs for the analysis and designof wireless networks
Lower and upper bounds for linkage discovery
IEEE Transactions on Evolutionary Computation
On the effects of adding objectives to plateau functions
IEEE Transactions on Evolutionary Computation
Peak power reduction of OFDM signals with sign adjustment
IEEE Transactions on Communications
Journal of Discrete Algorithms
Journal of Discrete Algorithms
Adaptive chosen-ciphertext attack on secure arithmetic coding
IEEE Transactions on Signal Processing
Sensor selection via convex optimization
IEEE Transactions on Signal Processing
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Many-to-many communication for mobile ad hoc networks
IEEE Transactions on Wireless Communications
Succinct approximate counting of skewed data
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
IBM Journal of Research and Development
Capacity scaling in ad hoc networks with heterogeneous mobile nodes: the super-critical regime
IEEE/ACM Transactions on Networking (TON)
Analysis of diversity-preserving mechanisms for global exploration*
Evolutionary Computation
Dynamic algorithms for multicast with intra-session network coding
IEEE Transactions on Information Theory
Multicast throughput order of network coding in wireless ad-hoc networks
SECON'09 Proceedings of the 6th Annual IEEE communications society conference on Sensor, Mesh and Ad Hoc Communications and Networks
Sort vs. Hash revisited: fast join implementation on modern multi-core CPUs
Proceedings of the VLDB Endowment
Summarizing relational databases
Proceedings of the VLDB Endowment
Output space sampling for graph patterns
Proceedings of the VLDB Endowment
When is an estimation of distribution algorithm better than an evolutionary algorithm?
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Rigorous time complexity analysis of univariate marginal distribution algorithm with margins
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
On Profit-Maximizing Pricing for the Highway and Tollbooth Problems
SAGT '09 Proceedings of the 2nd International Symposium on Algorithmic Game Theory
Throughput loss in task scheduling due to server state uncertainty
Proceedings of the Fourth International ICST Conference on Performance Evaluation Methodologies and Tools
Reducing repair traffic for erasure coding-based storage via interference alignment
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
Existence and construction of capacity-achieving network codes for distributed storage
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
Real royal road functions-where crossover provably is essential
Discrete Applied Mathematics - Special issue: Boolean and pseudo-boolean funtions
Balanced vertex-orderings of graphs
Discrete Applied Mathematics
Subset-conjunctive rules for breast cancer diagnosis
Discrete Applied Mathematics - Special issue: Discrete mathematics & data mining II (DM & DM II)
A randomized satisfiability procedure for arithmetic and uninterpreted function symbols
Information and Computation - Special issue: 19th international conference on automated deduction (CADE-19)
A simple and deterministic competitive algorithm for online facility location
Information and Computation
Broadcast in the rendezvous model
Information and Computation
Performance analysis of a greedy algorithm for inferring Boolean functions
Information Processing Letters
On a simple randomized algorithm for finding a 2-factor in sparse graphs
Information Processing Letters
A framework for pursuit evasion games in Rn
Information Processing Letters
A generalization of the 0--1 principle for sorting
Information Processing Letters
On the hardness of approximating Max-Satisfy
Information Processing Letters
Eigenvectors of directed graphs and importance scores: dominance, T-Rank, and sink remedies
Data Mining and Knowledge Discovery
Algorithms for K-means clustering problem with balancing constraint
CCDC'09 Proceedings of the 21st annual international conference on Chinese control and decision conference
Analysis of the (1 + 1)-EA for finding approximate solutions to vertex cover problems
IEEE Transactions on Evolutionary Computation
User capacity scaling laws for fading multiple-access channels
IEEE Transactions on Wireless Communications
Capacity scaling in ad hoc networks with heterogeneous mobile nodes: the subcritical regime
IEEE/ACM Transactions on Networking (TON)
Comparison-based time-space lower bounds for selection
ACM Transactions on Algorithms (TALG)
Perfect matchings via uniform sampling in regular bipartite graphs
ACM Transactions on Algorithms (TALG)
Decentralized coding algorithms for distributed storage in wireless sensor networks
IEEE Journal on Selected Areas in Communications
Cooperative recovery of distributed storage systems from multiple losses with network coding
IEEE Journal on Selected Areas in Communications
Existence and construction of capacity-achieving network codes for distributed storage
IEEE Journal on Selected Areas in Communications
Adaptive Stream Mining: Pattern Learning and Mining from Evolving Data Streams
Proceedings of the 2010 conference on Adaptive Stream Mining: Pattern Learning and Mining from Evolving Data Streams
A Plant Location Guide for the Unsure: Approximation Algorithms for Min-Max Location Problems
Mathematics of Operations Research
Analysis of an asymmetric mutation operator
Evolutionary Computation
A new approximation algorithm for the multilevel facility location problem
Discrete Applied Mathematics
The ideal membership problem and polynomial identity testing
Information and Computation
Note: The hitting and cover times of Metropolis walks
Theoretical Computer Science
Average-case analysis for the MAX-2SAT problem
Theoretical Computer Science
Comparing First-Fit and Next-Fit for online edge coloring
Theoretical Computer Science
eSciGrid: A P2P-based e-science Grid for scalable and efficient data sharing
Future Generation Computer Systems
Real royal road functions for constant population size
GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartII
Quantum sampling for balanced allocations
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
Combinatorial and geometric problems related to digital halftoning
Proceedings of the 11th international conference on Theoretical foundations of computer vision
Generalized framework for selectors with applications in optimal group testing
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Approximation algorithm for directed telephone multicast problem
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Impact of local topological information on random walks on finite graphs
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Identity-based traitor tracing
PKC'07 Proceedings of the 10th international conference on Practice and theory in public-key cryptography
Exploring the explorative advantage of the cooperative coevolutionary (1+1) EA
GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartI
On the optimization of monotone polynomials by the (1+1) EA and randomized local search
GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartI
Analysis of the (1+1) EA for a dynamically bitwise changing ONEMAX
GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartI
Core instances for testing: a case study
WEA'03 Proceedings of the 2nd international conference on Experimental and efficient algorithms
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Experimental comparison of two evolutionary algorithms for the independent set problem
EvoWorkshops'03 Proceedings of the 2003 international conference on Applications of evolutionary computing
Robust information-theoretic private information retrieval
SCN'02 Proceedings of the 3rd international conference on Security in communication networks
Applications of metric coinduction
CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
Comparing variants of MMAS ACO algorithms on pseudo-boolean functions
SLS'07 Proceedings of the 2007 international conference on Engineering stochastic local search algorithms: designing, implementing and analyzing effective heuristics
Low-density graph codes that are optimal for binning and coding with side information
IEEE Transactions on Information Theory
The capacity of wireless ad hoc networks with multi-packet reception
IEEE Transactions on Communications
Runtime analysis of a binary particle swarm optimizer
Theoretical Computer Science
Spanders: distributed spanning expanders
Proceedings of the 2010 ACM Symposium on Applied Computing
Ant Colony Optimization and the minimum spanning tree problem
Theoretical Computer Science
An algorithmic theory of mobile agents
TGC'06 Proceedings of the 2nd international conference on Trustworthy global computing
Scheduling to maximize participation
TGC'06 Proceedings of the 2nd international conference on Trustworthy global computing
A randomized algorithm for BBCSPs in the prover-verifier model
ICTAC'07 Proceedings of the 4th international conference on Theoretical aspects of computing
On the running time analysis of the (1+1) evolutionary algorithm for the subset sum problem
LSMS'07 Proceedings of the Life system modeling and simulation 2007 international conference on Bio-Inspired computational intelligence and applications
Non-clairvoyant batch sets scheduling: fairness is fair enough
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Anonymity in the wild: mixes on unstructured networks
PET'07 Proceedings of the 7th international conference on Privacy enhancing technologies
On mixing and edge expansion properties in randomized broadcasting
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Depth of field and cautious-greedy routing in social networks
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
The monomial ideal membership problem and polynomial identity testing
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Faster algorithms for all-pairs small stretch distances in weighted graphs
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
A note on maximizing the spread of influence in social networks
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
Temporal partition in sensor networks
SSS'07 Proceedings of the 9h international conference on Stabilization, safety, and security of distributed systems
Resilient coding algorithms for sensor network data persistence
EWSN'08 Proceedings of the 5th European conference on Wireless sensor networks
Randomized priority algorithms
Theoretical Computer Science
Martingales on trees and the empire chromatic number of random trees
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
Integer optimization by local search: a domain-independent approach
Integer optimization by local search: a domain-independent approach
Efficient algorithms for model-based motif discovery from multiple sequences
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
Locating hidden groups in communication networks using hidden Markov models
ISI'03 Proceedings of the 1st NSF/NIJ conference on Intelligence and security informatics
Codes against online adversaries
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Perfect matchings in o(n log n) time in regular bipartite graphs
Proceedings of the forty-second ACM symposium on Theory of computing
An optimal algorithm for the distinct elements problem
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Constructing and exploring composite items
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Revenue maximization with a single sample
Proceedings of the 11th ACM conference on Electronic commerce
Parallel approximation algorithms for facility-location problems
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
Finding shortest non-trivial cycles in directed graphs on surfaces
Proceedings of the twenty-sixth annual symposium on Computational geometry
New constructions of SSPDs and their applications
Proceedings of the twenty-sixth annual symposium on Computational geometry
Capacity of wireless networks with heterogeneous traffic
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Randomness: a computational complexity perspective
CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
How to design a linear cover time random walk on a finite graph
SAGA'09 Proceedings of the 5th international conference on Stochastic algorithms: foundations and applications
Repetition-free longest common subsequence
Discrete Applied Mathematics
Proceedings of the 6th International Wireless Communications and Mobile Computing Conference
Network coding does not change the multicast throughput order of wireless ad hoc networks
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Analysis of computational time of simple estimation of distribution algorithms
IEEE Transactions on Evolutionary Computation
On distributed scheduling in wireless networks exploiting broadcast and network coding
IEEE Transactions on Communications
Formal analysis of the effectiveness and predictability of random testing
Proceedings of the 19th international symposium on Software testing and analysis
Making the case for random access scheduling in wireless multi-hop networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Collaborative measurements of upload speeds in P2P systems
INFOCOM'10 Proceedings of the 29th conference on Information communications
The capacity of ad hoc networks with heterogeneous traffic using cooperation
INFOCOM'10 Proceedings of the 29th conference on Information communications
Reliability in layered networks with random link failures
INFOCOM'10 Proceedings of the 29th conference on Information communications
Expansion and the cover time of parallel random walks
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Mining uncertain data with probabilistic guarantees
Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
Cross-layer wireless video adaptation: Tradeoff between distortion and delay
Computer Communications
Asymptotically optimal dynamic tree evolution by rapidly mixing random walks on regular networks
Journal of Parallel and Distributed Computing
On the tradeoffs of implementing randomized network coding in multicast networks
IEEE Transactions on Communications
Probabilistic quorum systems in wireless Ad Hoc networks
ACM Transactions on Computer Systems (TOCS)
Network delay inference from additive metrics
Random Structures & Algorithms
Opportunistic computing: a new paradigm for scalable realism on many-cores
HotPar'09 Proceedings of the First USENIX conference on Hot topics in parallelism
Geographic routing with limited information in sensor networks
IEEE Transactions on Information Theory
Spreading of messages in random graphs
CATS '09 Proceedings of the Fifteenth Australasian Symposium on Computing: The Australasian Theory - Volume 94
Reasoning about a distributed probabilistic system
CATS '09 Proceedings of the Fifteenth Australasian Symposium on Computing: The Australasian Theory - Volume 94
Taxes for linear atomic congestion games
ACM Transactions on Algorithms (TALG)
Capacity scaling of large wireless networks with heterogeneous clusters
Performance Evaluation
Restricted mobility improves delay-throughput tradeoffs in mobile ad hoc networks
IEEE Transactions on Information Theory
Order-optimal consensus through randomized path averaging
IEEE Transactions on Information Theory
Cardinality estimation and dynamic length adaptation for Bloom filters
Distributed and Parallel Databases
A 1.43-competitive online graph edge coloring algorithm in the random order arrival model
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
1-pass relative-error Lp-sampling with applications
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Randomized Shellsort: a simple oblivious sorting algorithm
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Leveling-up in heroes of might and magic III
FUN'10 Proceedings of the 5th international conference on Fun with algorithms
Fighting censorship with algorithms
FUN'10 Proceedings of the 5th international conference on Fun with algorithms
Thresholded covering algorithms for robust and max-min optimization
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Improved sublinear time algorithm for width-bounded separators
FAW'10 Proceedings of the 4th international conference on Frontiers in algorithmics
Design and performance analysis of a DRAM-based statistics counter array architecture
Proceedings of the 5th ACM/IEEE Symposium on Architectures for Networking and Communications Systems
Average case analysis of algorithms
Algorithms and theory of computation handbook
Algorithms and theory of computation handbook
Algorithms and theory of computation handbook
Approximation algorithms for NP-hard optimization problems
Algorithms and theory of computation handbook
Optimal fixed and adaptive mutation rates for the leadingones problem
PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part I
Better size estimation for sparse matrix products
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Near optimal solutions for maximum quasi-bicliques
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Constant time approximation scheme for largest well predicted subset
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Randomisation and derandomisation in descriptive complexity theory
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
Fast randomized test-and-set and renaming
DISC'10 Proceedings of the 24th international conference on Distributed computing
Improved bounds for online stochastic matching
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Estimating the average of a Lipschitz-continuous function from one sample
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Conditional e-payments with transferability
Journal of Parallel and Distributed Computing
Lossy source compression using low-density generator matrix codes: analysis and algorithms
IEEE Transactions on Information Theory
The throughput order of ad hoc networks employing network coding and broadcasting
MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications
Specification of network services and mapping algorithms
MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications
Distributed coloring in Õ (√log n) Bit Rounds
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Algorithm engineering: bridging the gap between algorithm theory and practice
Algorithm engineering: bridging the gap between algorithm theory and practice
A note on maximizing the spread of influence in social networks
Information Processing Letters
Ranking continuous probabilistic datasets
Proceedings of the VLDB Endowment
Discovering almost any hidden motif from multiple sequences
ACM Transactions on Algorithms (TALG)
On the approximability of robust spanning tree problems
Theoretical Computer Science
Average-case competitive analyses for one-way trading
Journal of Combinatorial Optimization
Computational complexity and information asymmetry in election audits with low-entropy randomness
EVT/WOTE'10 Proceedings of the 2010 international conference on Electronic voting technology/workshop on trustworthy elections
In-network coding for resilient sensor data storage and efficient data mule collection
ALGOSENSORS'10 Proceedings of the 6th international conference on Algorithms for sensor systems, wireless adhoc networks, and autonomous mobile entities
YAGA: automated analysis of quantitative safety specifications in probabilistic B
ATVA'10 Proceedings of the 8th international conference on Automated technology for verification and analysis
On the hardness of counting and sampling center strings
SPIRE'10 Proceedings of the 17th international conference on String processing and information retrieval
Discrete Applied Mathematics
Click-graph modeling for facet attribute estimation of web search queries
RIAO '10 Adaptivity, Personalization and Fusion of Heterogeneous Information
Ranking queries on uncertain data
The VLDB Journal — The International Journal on Very Large Data Bases
(Approximate) uncertain skylines
Proceedings of the 14th International Conference on Database Theory
On the Boolean-width of a graph: structure and applications
WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
Second order centrality: Distributed assessment of nodes criticity in complex networks
Computer Communications
Approximating covering problems by randomized search heuristics using multi-objective models*
Evolutionary Computation
Exploring the runtime of an evolutionary algorithm for the multi-objective shortest path problem**
Evolutionary Computation
Extrapolation to speed-up query-dependent link analysis ranking algorithms
Proceedings of the 8th International Conference on Frontiers of Information Technology
Delaunay triangulations in O(sort(n)) time and more
Journal of the ACM (JACM)
TQC'10 Proceedings of the 5th conference on Theory of quantum computation, communication, and cryptography
New models and algorithms for throughput maximization in broadcast scheduling
WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
Runtime analysis of the 1-ANT ant colony optimizer
Theoretical Computer Science
Free lunches on the discrete Lipschitz class
Theoretical Computer Science
Proceedings of the 14th International Conference on Extending Database Technology
A course on probability theory for computer scientists
Proceedings of the 42nd ACM technical symposium on Computer science education
$O(\sqrt{\logn})$ Approximation to SPARSEST CUT in $\tilde{O}(n^2)$ Time
SIAM Journal on Computing
Selfish Traffic Allocation for Server Farms
SIAM Journal on Computing
The Computational Hardness of Estimating Edit Distance
SIAM Journal on Computing
Local Monotonicity Reconstruction
SIAM Journal on Computing
Probabilistic Analysis of a Motif Discovery Algorithm for Multiple Sequences
SIAM Journal on Discrete Mathematics
Maximizing Nonmonotone Submodular Functions under Matroid or Knapsack Constraints
SIAM Journal on Discrete Mathematics
Design is as Easy as Optimization
SIAM Journal on Discrete Mathematics
Capacity scaling of wireless networks with inhomogeneous node density: lower bounds
IEEE/ACM Transactions on Networking (TON)
An IEEE 802.11 EDCA model with support for analysing networks with misbehaving nodes
EURASIP Journal on Wireless Communications and Networking
Similarity join size estimation using locality sensitive hashing
Proceedings of the VLDB Endowment
Resource aware distributed knowledge discovery
Ubiquitous knowledge discovery
Proceedings of the 33rd International Conference on Software Engineering
Resource aware distributed knowledge discovery
Ubiquitous knowledge discovery
The power of simple tabulation hashing
Proceedings of the forty-third annual ACM symposium on Theory of computing
A general framework for graph sparsification
Proceedings of the forty-third annual ACM symposium on Theory of computing
Distributed graph coloring in a few rounds
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Fault-tolerant spanners: better and simpler
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Voting almost maximizes social welfare despite limited communication
Artificial Intelligence
Stochastic minimum spanning trees in euclidean spaces
Proceedings of the twenty-seventh annual symposium on Computational geometry
Multi-sensor activation for temporally correlated event monitoring with renewable energy sources
International Journal of Sensor Networks
Finding mount everest and handling voids
Evolutionary Computation
Fast computation of small cuts via cycle space sampling
ACM Transactions on Algorithms (TALG)
Indexing strategies for graceful degradation of search quality
Proceedings of the 34th international ACM SIGIR conference on Research and development in Information Retrieval
On mixing in continuous-time quantum walks on some circulant graphs
Quantum Information & Computation
Robust cryptography in the noisy-quantum-storage model
Quantum Information & Computation
Towards a complexity theory of randomized search heuristics: ranking-based black-box complexity
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Approximability of capacitated network design
IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
Randomized selection on the GPU
Proceedings of the ACM SIGGRAPH Symposium on High Performance Graphics
What's the difference?: efficient set reconciliation without prior context
Proceedings of the ACM SIGCOMM 2011 conference
Ranking individuals and groups by influence propagation
PAKDD'11 Proceedings of the 15th Pacific-Asia conference on Advances in knowledge discovery and data mining - Volume Part II
Almost tight upper bound for finding Fourier coefficients of bounded pseudo-Boolean functions
Journal of Computer and System Sciences
A methodology for testing intersection related Vehicle-2-X applications
Computer Networks: The International Journal of Computer and Telecommunications Networking
Studies in complexity and cryptography
Variation in artificial immune systems: hypermutations with mutation potential
ICARIS'11 Proceedings of the 10th international conference on Artificial immune systems
Algorithms for testing monomials in multivariate polynomials
COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
Complexity of the stamp folding problem
COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
Quantum property testing for bounded-degree graphs
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Static load balancing of parallel mining of frequent itemsets using reservoir sampling
MLDM'11 Proceedings of the 7th international conference on Machine learning and data mining in pattern recognition
Faster coupon collecting via replication with applications in gossiping
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Toward a fair review-management system
ECML PKDD'11 Proceedings of the 2011 European conference on Machine learning and knowledge discovery in databases - Volume Part II
Optimal scaling of average queue sizes in an input-queued switch: an open problem
Queueing Systems: Theory and Applications
Classical and quantum parallelism in the quantum fingerprinting method
PaCT'11 Proceedings of the 11th international conference on Parallel computing technologies
BRICK: a novel exact active statistics counter architecture
IEEE/ACM Transactions on Networking (TON)
Efficiently speeding up sequential computation through the n-way programming model
Proceedings of the 2011 ACM international conference on Object oriented programming systems languages and applications
Randomized Shellsort: A Simple Data-Oblivious Sorting Algorithm
Journal of the ACM (JACM)
Inexact computing for ultra low-power nanometer digital circuit design
NANOARCH '11 Proceedings of the 2011 IEEE/ACM International Symposium on Nanoscale Architectures
A note on labeling schemes for graph connectivity
Information Processing Letters
ACM Transactions on Algorithms (TALG)
Optimal time bounds for approximate clustering
UAI'02 Proceedings of the Eighteenth conference on Uncertainty in artificial intelligence
Randomized consensus in expected O(n2) total work using single-writer registers
DISC'11 Proceedings of the 25th international conference on Distributed computing
A Randomized Cutting Plane Method with Probabilistic Geometric Convergence
SIAM Journal on Optimization
Uncoordinated Two-Sided Matching Markets
SIAM Journal on Computing
SIAM Journal on Computing
An Expansion Tester for Bounded Degree Graphs
SIAM Journal on Computing
Diversity loss in general estimation of distribution algorithms
PPSN'06 Proceedings of the 9th international conference on Parallel Problem Solving from Nature
Sequential importance sampling of binary sequences
Statistics and Computing
Sparse reliable graph backbones
Information and Computation
Lightweight causal cluster consistency
IICS'05 Proceedings of the 5th international conference on Innovative Internet Community Systems
Implementing credential networks
iTrust'06 Proceedings of the 4th international conference on Trust Management
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Sparser Johnson-Lindenstrauss transforms
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Weighted capacitated, priority, and geometric set cover via improved quasi-uniform sampling
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Kolmogorov complexity with error
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Estimating entropy and entropy norm on data streams
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Conflict-Free colorings of rectangles ranges
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Forbidden substrings, kolmogorov complexity and almost periodic sequences
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Linear advice for randomized logarithmic space
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
On robust and effective k-anonymity in large databases
PAKDD'06 Proceedings of the 10th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining
Mobile agent rendezvous: a survey
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
How to meet in anonymous network
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Further reflections on a theory for basic algorithms
AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
UAI'03 Proceedings of the Nineteenth conference on Uncertainty in Artificial Intelligence
Defensive universal learning with experts
ALT'05 Proceedings of the 16th international conference on Algorithmic Learning Theory
Randomized accuracy-aware program transformations for efficient approximate computations
POPL '12 Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Towards optimal multiple selection
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Balanced allocation and dictionaries with tightly packed constant size bins
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Optimal cover time for a graph-based coupon collector process
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Stability and similarity of link analysis ranking algorithms
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
Neighbor discovery in wireless networks with multipacket reception
MobiHoc '11 Proceedings of the Twelfth ACM International Symposium on Mobile Ad Hoc Networking and Computing
Memoryless routing in convex subdivisions: Random walks are optimal
Computational Geometry: Theory and Applications
Query planning in the presence of overlapping sources
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
Maintaining moving sums over data streams
ADMA'06 Proceedings of the Second international conference on Advanced Data Mining and Applications
Online selection of diverse results
Proceedings of the fifth ACM international conference on Web search and data mining
Text clustering for peer-to-peer networks with probabilistic guarantees
ECIR'2010 Proceedings of the 32nd European conference on Advances in Information Retrieval
Largest induced acyclic tournament in random digraphs: a 2-point concentration
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Dense subgraph problems with output-density conditions
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Simple and efficient greedy algorithms for hamilton cycles in random intersection graphs
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Randomized algorithm for the sum selection problem
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Basic computations in wireless networks
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Sampling bounds for stochastic optimization
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
Derandomized constructions of k-wise (almost) independent permutations
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
Using the linking model to understand the performance of DHT routing algorithms
ISPA'04 Proceedings of the Second international conference on Parallel and Distributed Processing and Applications
Rumor spreading and vertex expansion on regular graphs
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Secretary problems: laminar matroid and interval scheduling
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
On parity check (0, 1)-matrix over Zp
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
AAIM'05 Proceedings of the First international conference on Algorithmic Applications in Management
An approximation algorithm for embedding a directed hypergraph on a ring
AAIM'05 Proceedings of the First international conference on Algorithmic Applications in Management
Design is as easy as optimization
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
HYBRID: from atom-clusters to molecule-clusters
FSKD'05 Proceedings of the Second international conference on Fuzzy Systems and Knowledge Discovery - Volume Part I
COLT'05 Proceedings of the 18th annual conference on Learning Theory
The spectral method for general mixture models
COLT'05 Proceedings of the 18th annual conference on Learning Theory
On the parameterized complexity of exact satisfiability problems
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Distributed maintenance of a spanning tree using labeled tree encoding
Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
New bounds on the competitiveness of randomized online call control in cellular networks
Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
Quickly routing searches without having to move content
IPTPS'05 Proceedings of the 4th international conference on Peer-to-Peer Systems
Worst-case and average-case approximations by simple randomized search heuristics
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Three optimal algorithms for balls of three colors
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
On weighted balls-into-bins games
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
New constructions of SSPDs and their applications
Computational Geometry: Theory and Applications
OPODIS'04 Proceedings of the 8th international conference on Principles of Distributed Systems
Improved combinatorial group testing for real-world problem sizes
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Approximating the online set multicover problems via randomized winnowing
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Derandomization of dimensionality reduction and SDP based algorithms
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Deterministic parallel random-number generation for dynamic-multithreading platforms
Proceedings of the 17th ACM SIGPLAN symposium on Principles and Practice of Parallel Programming
Randomized insertion and deletion in point quad trees
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Approximated two choices in randomized load balancing
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Detecting fuzzy amino acid tandem repeats in protein sequences
Proceedings of the 2nd ACM Conference on Bioinformatics, Computational Biology and Biomedicine
Development via refinement in probabilistic b: foundation and case study
ZB'05 Proceedings of the 4th international conference on Formal Specification and Development in Z and B
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Divide and conquer is almost optimal for the bounded-hop MST problem on random euclidean instances
SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity
On trip planning queries in spatial databases
SSTD'05 Proceedings of the 9th international conference on Advances in Spatial and Temporal Databases
How to tame a very large ER diagram (using link analysis and force-directed drawing algorithms)
ER'05 Proceedings of the 24th international conference on Conceptual Modeling
“Copasetic clustering": making sense of large-scale images
CASDMKM'04 Proceedings of the 2004 Chinese academy of sciences conference on Data Mining and Knowledge Management
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Information theory and the security of binary data perturbation
INDOCRYPT'04 Proceedings of the 5th international conference on Cryptology in India
Fault detection of hierarchical networks with probabilistic testing algorithms
TestCom'05 Proceedings of the 17th IFIP TC6/WG 6.1 international conference on Testing of Communicating Systems
Spatial Link Scheduling for SCDMA Multihop Cellular Networks: A Cross Layer Framework
Wireless Personal Communications: An International Journal
Some results on approximate 1-median selection in metric spaces
Theoretical Computer Science
On rainbow-k-connectivity of random graphs
Information Processing Letters
Parameterizing MAX SNP problems above guaranteed values
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Online minimization knapsack problem
WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
Security of encryption schemes in weakened random oracle models
PKC'10 Proceedings of the 13th international conference on Practice and Theory in Public Key Cryptography
Topology control with limited geometric information
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
Better approximations for the minimum common integer partition problem
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
A fast random sampling algorithm for sparsifying matrices
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
Covering analysis of the greedy algorithm for partial cover
Algorithms and Applications
On approximation algorithms for data mining applications
Efficient Approximation and Online Algorithms
Approximation algorithms for edge-disjoint paths and unsplittable flow
Efficient Approximation and Online Algorithms
List scheduling in order of α-points on a single machine
Efficient Approximation and Online Algorithms
Decentralized approaches for self-adaptation in agent organizations
ACM Transactions on Autonomous and Adaptive Systems (TAAS) - Special section on formal methods in pervasive computing, pervasive adaptation, and self-adaptive systems: Models and algorithms
The power of semidefinite programming relaxations for MAX-SAT
CPAIOR'06 Proceedings of the Third international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Balanced cut approximation in random geometric graphs
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Randomized leader election protocols in noisy radio networks with a single transceiver
ISPA'06 Proceedings of the 4th international conference on Parallel and Distributed Processing and Applications
Stable sets of threshold-based cascades on the erdős-rényi random graphs
IWOCA'11 Proceedings of the 22nd international conference on Combinatorial Algorithms
Efficient conditional expectation algorithms for constructing hash families
IWOCA'11 Proceedings of the 22nd international conference on Combinatorial Algorithms
An anti-collision algorithm using two-functioned estimation for RFID tags
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part IV
An optimal overlay topology for routing peer-to-peer searches
Middleware'05 Proceedings of the ACM/IFIP/USENIX 6th international conference on Middleware
TCC'06 Proceedings of the Third conference on Theory of Cryptography
The power and weakness of randomness in computation
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
On behalf of the seller and society: bicriteria mechanisms for unit-demand auctions
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Robust network supercomputing without centralized control
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
Broadcast analysis in dense duty-cycle sensor networks
Proceedings of the 6th International Conference on Ubiquitous Information Management and Communication
Randomized Algorithms for Matrices and Data
Foundations and Trends® in Machine Learning
Immune size approximation algorithms in ad hoc radio network
EWSN'12 Proceedings of the 9th European conference on Wireless Sensor Networks
Partitioned multi-indexing: bringing order to social search
Proceedings of the 21st international conference on World Wide Web
On power-law distributed balls in bins and its applications to view size estimation
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Randomized group testing both query-optimal and minimal adaptive
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
Local vs. global models for effort estimation and defect prediction
ASE '11 Proceedings of the 2011 26th IEEE/ACM International Conference on Automated Software Engineering
A large population size can be unhelpful in evolutionary algorithms
Theoretical Computer Science
List update with probabilistic locality of reference
Information Processing Letters
Prior-free auctions with ordered bidders
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
The Power of Simple Tabulation Hashing
Journal of the ACM (JACM)
Don't lose sleep over availability: the GreenUp decentralized wakeup service
NSDI'12 Proceedings of the 9th USENIX conference on Networked Systems Design and Implementation
Smoothed analysis of left-to-right maxima with applications
ACM Transactions on Algorithms (TALG)
A new perspective on list update: probabilistic locality and working set
WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms
ACM Transactions on Sensor Networks (TOSN)
The K-armed dueling bandits problem
Journal of Computer and System Sciences
High-multiplicity cyclic job shop scheduling
Operations Research Letters
Triggering cascades on undirected connected graphs
Information Processing Letters
Computer Science Review
Survey: The cook-book approach to the differential equation method
Computer Science Review
Research paper: The saga of minimum spanning trees
Computer Science Review
Computer Science Review
On the cut-off phenomenon for the transitivity of randomly generated subgroups
Random Structures & Algorithms
On-line scheduling to minimize max flow time: an optimal preemptive algorithm
Operations Research Letters
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
Efficient computation of distance sketches in distributed networks
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
Repetition Maximization based Texture Rectification
Computer Graphics Forum
Enriching introductory programming courses with non-intuitive probability experiments component
Proceedings of the 17th ACM annual conference on Innovation and technology in computer science education
Runtime analysis of convex evolutionary search
Proceedings of the 14th annual conference on Genetic and evolutionary computation
Computational complexity analysis of multi-objective genetic programming
Proceedings of the 14th annual conference on Genetic and evolutionary computation
Evolutionary algorithms for the project scheduling problem: runtime analysis and improved design
Proceedings of the 14th annual conference on Genetic and evolutionary computation
The max problem revisited: the importance of mutation in genetic programming
Proceedings of the 14th annual conference on Genetic and evolutionary computation
Virtual indexing based methods for estimating node connection degrees
Computer Networks: The International Journal of Computer and Telecommunications Networking
Proceedings of the VLDB Endowment
Estimating entity importance via counting set covers
Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining
Local Versus Global Properties of Metric Spaces
SIAM Journal on Computing
Buying Cheap Is Expensive: Approximability of Combinatorial Pricing Problems
SIAM Journal on Computing
Submodular Approximation: Sampling-based Algorithms and Lower Bounds
SIAM Journal on Computing
A dense hierarchy of sublinear time approximation schemes for bin packing
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
Synopses for Massive Data: Samples, Histograms, Wavelets, Sketches
Foundations and Trends in Databases
Fully dynamic randomized algorithms for graph spanners
ACM Transactions on Algorithms (TALG)
Near-optimal radio use for wireless network synchronization
Theoretical Computer Science
On Approximating Non-regular Languages by Regular Languages
Fundamenta Informaticae - Theory that Counts: To Oscar Ibarra on His 70th Birthday
On the Dynamics of Social Balance on General Networks (with an application to XOR-SAT)
Fundamenta Informaticae - Machines, Computations and Universality, Part II
Compression functions using a dedicated blockcipher for lightweight hashing
ICISC'11 Proceedings of the 14th international conference on Information Security and Cryptology
Convergence of set-based multi-objective optimization, indicators and deteriorative cycles
Theoretical Computer Science
Strengthening hash families and compressive sensing
Journal of Discrete Algorithms
Reliability in layered networks with random link failures
IEEE/ACM Transactions on Networking (TON)
Approximating concept stability
ICFCA'12 Proceedings of the 10th international conference on Formal Concept Analysis
Binary Search Trees, Recurrent Properties andWave Equations
Fundamenta Informaticae
Hypergraph coloring games and voter models
WAW'12 Proceedings of the 9th international conference on Algorithms and Models for the Web Graph
Quick detection of nodes with large degrees
WAW'12 Proceedings of the 9th international conference on Algorithms and Models for the Web Graph
On approximating string selection problems with outliers
CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
Observe and remain silent (communication-less agent location discovery)
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
DRAM-based statistics counter array architecture with performance guarantee
IEEE/ACM Transactions on Networking (TON)
Fundamenta Informaticae
Towards Ambitious Approximation Algorithms in Stubborn Set Optimization
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2002), Part 1
Sublinear optimization for machine learning
Journal of the ACM (JACM)
Finite Markov Chain Results in Evolutionary Computation: A Tour d'Horizon
Fundamenta Informaticae
Practical perfect hashing in nearly optimal space
Information Systems
Instant ray tracing: the bounding interval hierarchy
EGSR'06 Proceedings of the 17th Eurographics conference on Rendering Techniques
Quantum walks: a comprehensive review
Quantum Information Processing
A polynomial time approximation scheme for embedding a directed hypergraph on a weighted ring
Journal of Combinatorial Optimization
Large-scale energy-efficient graph traversal: a path to efficient data-intensive supercomputing
SC '12 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis
On the set multicover problem in geometric settings
ACM Transactions on Algorithms (TALG)
A graph clustering approach to weak motif recognition
WABI'07 Proceedings of the 7th international conference on Algorithms in Bioinformatics
Pushing random walk beyond golden ratio
CSR'07 Proceedings of the Second international conference on Computer Science: theory and applications
Kolmogorov complexity, Lovász local lemma and critical exponents
CSR'07 Proceedings of the Second international conference on Computer Science: theory and applications
Optimal randomized comparison based algorithms for collision
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Security analysis of constructions combining FIL random oracles
FSE'07 Proceedings of the 14th international conference on Fast Software Encryption
Estimating sum by weighted sampling
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Initializing sensor networks of non-uniform density in the weak sensor model
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
The effectiveness of lloyd-type methods for the k-means problem
Journal of the ACM (JACM)
Approximating the min-max (regret) selecting items problem
Information Processing Letters
Data structures on event graphs
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Forbidden subgraph colorings and the oriented chromatic number
European Journal of Combinatorics
Computing longest common subsequences with the B-cell algorithm
ICARIS'12 Proceedings of the 11th international conference on Artificial Immune Systems
Searching for pareto-optimal randomised algorithms
SSBSE'12 Proceedings of the 4th international conference on Search Based Software Engineering
On the Hardness of Counting and Sampling Center Strings
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
An early-stopping protocol for computing aggregate functions in Sensor Networks
Journal of Parallel and Distributed Computing
Parikh matching in the streaming model
SPIRE'12 Proceedings of the 19th international conference on String Processing and Information Retrieval
Bounding the sizes of dynamic monopolies and convergent sets for threshold-based cascades
Theoretical Computer Science
Black-box complexities of combinatorial problems
Theoretical Computer Science
International Journal of Grid and Utility Computing
An effective and efficient parallel approach for random graph generation over GPUs
Journal of Parallel and Distributed Computing
ACM Computing Surveys (CSUR)
Document selection for tiered indexing in commerce search
Proceedings of the sixth ACM international conference on Web search and data mining
Asymptotic Throughput Capacity Analysis of Multi-Channel, Multi-Interface Wireless Mesh Networks
Wireless Personal Communications: An International Journal
Faster Ranking Using Extrapolation Techniques
International Journal of Computer Vision and Image Processing
Triadic consensus: a randomized algorithm for voting in a crowd
WINE'12 Proceedings of the 8th international conference on Internet and Network Economics
A new distributed cooperative MIMO scheme for mobile ad hoc networks
Information Sciences: an International Journal
The time complexity of A* with approximate heuristics on multiple-solution search spaces
Journal of Artificial Intelligence Research
Using the crowd for top-k and group-by queries
Proceedings of the 16th International Conference on Database Theory
An in-depth analysis of stochastic Kronecker graphs
Journal of the ACM (JACM)
Optimal cover time for a graph-based coupon collector process
Journal of Discrete Algorithms
Skyline probability over uncertain preferences
Proceedings of the 16th International Conference on Extending Database Technology
Exploiting independent subformulas: A faster approximation scheme for #k-SAT
Information Processing Letters
When do evolutionary algorithms optimize separable functions in parallel?
Proceedings of the twelfth workshop on Foundations of genetic algorithms XII
A runtime analysis of simple hyper-heuristics: to mix or not to mix operators
Proceedings of the twelfth workshop on Foundations of genetic algorithms XII
How slow, or fast, are standard random walks?: analysis of hitting and cover times on trees
CATS '11 Proceedings of the Seventeenth Computing: The Australasian Theory Symposium - Volume 119
Proceedings of the 34th ACM SIGPLAN conference on Programming language design and implementation
Proceedings of the 15th annual conference on Genetic and evolutionary computation
ε-Matching: event processing over noisy sequences in real time
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Nearest neighbor searching under uncertainty II
Proceedings of the 32nd symposium on Principles of database systems
Resolving the conflict between generality and plausibility in verified computation
Proceedings of the 8th ACM European Conference on Computer Systems
International Journal of Applied Cryptography
Fast error-tolerant quartet phylogeny algorithms
Theoretical Computer Science
Bisimplicial edges in bipartite graphs
Discrete Applied Mathematics
Efficient training set use for blood pressure prediction in a large scale learning classifier system
Proceedings of the 15th annual conference companion on Genetic and evolutionary computation
How slow, or fast, are standard random walks?: analysis of hitting and cover times on trees
CATS 2011 Proceedings of the Seventeenth Computing on The Australasian Theory Symposium - Volume 119
On the complexity of universal leader election
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures
STRIP: stream learning of influence probabilities
Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining
Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining
Bottom-k and priority sampling, set similarity and subset sums with minimal independence
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Compressed matrix multiplication
ACM Transactions on Computation Theory (TOCT) - Special issue on innovations in theoretical computer science 2012
Streaming algorithms for language recognition problems
Theoretical Computer Science
Understanding RFID counting protocols
Proceedings of the 19th annual international conference on Mobile computing & networking
A sample-based hierarchical adaptive K-means clustering method for large-scale video retrieval
Knowledge-Based Systems
Efficient algorithms for neighbor discovery in wireless networks
IEEE/ACM Transactions on Networking (TON)
Mobility increases the connectivity of wireless networks
IEEE/ACM Transactions on Networking (TON)
On the necessity of irrelevant variables
The Journal of Machine Learning Research
Studying from electronic textbooks
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Image retrieval based on augmented relational graph representation
Applied Intelligence
On testing monomials in multivariate polynomials
Theoretical Computer Science
On approximating string selection problems with outliers
Theoretical Computer Science
Probabilistic program analysis with martingales
CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
Unions of onions: preprocessing imprecise points for fast onion layer decomposition
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
Access privacy and correctness on untrusted storage
ACM Transactions on Information and System Security (TISSEC)
The Yin and Yang of processing data warehousing queries on GPU devices
Proceedings of the VLDB Endowment
Capacity of non-malleable codes
Proceedings of the 5th conference on Innovations in theoretical computer science
Why do simple algorithms for triangle enumeration work in the real world?
Proceedings of the 5th conference on Innovations in theoretical computer science
Sparser Johnson-Lindenstrauss Transforms
Journal of the ACM (JACM)
A query scrambler for search privacy on the internet
Information Retrieval
Fitness levels with tail bounds for the analysis of randomized search heuristics
Information Processing Letters
Hardness of learning loops, monoids, and semirings
Discrete Applied Mathematics
Runtime analysis of the (1+1) EA on computing unique input output sequences
Information Sciences: an International Journal
Reasoning about almost-certain convergence properties using Event-B
Science of Computer Programming
On the efficiency of CSMA-CA scheduling in wireless multihop networks
IEEE/ACM Transactions on Networking (TON)
Approximation algorithms for throughput maximization in wireless networks with delay constraints
IEEE/ACM Transactions on Networking (TON)
Decoherence in quantum Markov chains
Quantum Information Processing
Algorithmic probabilistic game semantics
Formal Methods in System Design
On the Multiple-Unicast Capacity of 3-Source, 3-Terminal Directed Acyclic Networks
IEEE/ACM Transactions on Networking (TON)
Energy-efficient filtering for skyline queries in cluster-based sensor networks
Computers and Electrical Engineering
Hi-index | 0.45 |
This text by two well-known experts in the field presents the basic concepts in the design and analysis of randomized algorithms at a level accessible to beginning graduate students, professionals and researchers.