Computational bounds for fundamental problems on general-purpose parallel models
Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures
Efficient algorithms for leader election in radio networks
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Lower Bounds for On-Line Single-Machine Scheduling
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Seller-Focused Algorithms for Online Auctioning
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Randomised Mutual Search for k2 Agents
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
Optimal Projective Algorithms for the List Update Problem
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Performance Aspects of Distributed Caches Using TTL-Based Consistency
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Selecting the k Largest Elements with Parity Tests
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
On Randomized Broadcasting and Gossiping in Radio Networks
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
New results for online page replication
APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
Randomized Lower Bounds for Online Path Coloring
RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
Security of Public Watermarking Schemes for Binary Sequences
IH '02 Revised Papers from the 5th International Workshop on Information Hiding
Scheduling Two Machines with Release Times
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
On Quantum Versions of the Yao Principle
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Randomized Approximation Algorithms for Query Optimization Problems on Two Processors
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
On Randomization In Online Computation
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Cuts, Trees and -Embeddings of Graphs
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Regular Languages are Testable with a Constant Number of Queries
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Every decision tree has an in.uential variable
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Lower Bounds for the Noisy Broadcast Problem
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
AdWords and Generalized On-line Matching
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Querying priced information in databases: The conjunctive case
ACM Transactions on Algorithms (TALG)
On queuing lengths in on-line switching
Theoretical Computer Science
Preemptive scheduling on a small number of hierarchical machines
Information and Computation
Lower bounds to randomized algorithms for graph properties
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
The average complexity of deterministic and randomized parallel comparison sorting algorithms
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
The complexity of parallel comparison merging
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Sleeping on the job: energy-efficient and robust broadcast for radio networks
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2
The Complexity of Algorithms Computing Game Trees on Random Assignments
AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
New Algorithms for Online Rectangle Filling with k-Lookahead
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Improved Bounds for Testing Juntas
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
Improved Randomized Results for That Interval Selection Problem
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
On the Complexity of Succinct Zero-Sum Games
Computational Complexity
Randomized strategies for the plurality problem
Discrete Applied Mathematics
Budget Constrained Bidding in Keyword Auctions and Online Knapsack Problems
WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
Fundamenta Informaticae
On randomized algorithms for the majority problem
Discrete Applied Mathematics
New bounds on classical and quantum one-way communication complexity
Theoretical Computer Science
A new perspective on implementation by voting trees
Proceedings of the 10th ACM conference on Electronic commerce
Amortized Communication Complexity of Distributions
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Max registers, counters, and monotone circuits
Proceedings of the 28th ACM symposium on Principles of distributed computing
Finding similar users in social networks: extended abstract
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
Dynamic external hashing: the limit of buffering
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
Online Priority Steiner Tree Problems
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Lower and upper bounds for linkage discovery
IEEE Transactions on Evolutionary Computation
Randomized multi-pass streaming skyline algorithms
Proceedings of the VLDB Endowment
The Roles of Advice to One-Tape Linear-Time Turing Machines and Finite Automata (Extended Abstract)
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
On 2-Player Randomized Mechanisms for Scheduling
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
Randomized Online Algorithms for the Buyback Problem
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
A large lower bound on the query complexity of a simple boolean function
Information Processing Letters
Approximating power indices: theoretical and empirical analysis
Autonomous Agents and Multi-Agent Systems
Improved competitive algorithms for online scheduling with partial job values
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
Testing convexity properties of tree colorings
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Optimal algorithms for k-search with application in option pricing
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Non-clairvoyant batch sets scheduling: fairness is fair enough
ESA'07 Proceedings of the 15th annual European conference on Algorithms
The computational complexity of game trees by eigen-distribution
COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications
Randomized priority algorithms
Theoretical Computer Science
Improved lower bounds for non-utilitarian truthfulness
WAOA'07 Proceedings of the 5th international conference on Approximation and online algorithms
The communication complexity of correlation
IEEE Transactions on Information Theory
Improved randomized results for the interval selection problem
Theoretical Computer Science
On the online unit clustering problem
ACM Transactions on Algorithms (TALG)
On the cell probe complexity of dynamic membership
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Quantum algorithms for highly non-linear Boolean functions
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Algorithms and theory of computation handbook
Testing Boolean function isomorphism
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Algorithms for distributed functional monitoring
ACM Transactions on Algorithms (TALG)
New algorithms for online rectangle filling with k-lookahead
Journal of Combinatorial Optimization
Improved lower bounds for non-utilitarian truthfulness
Theoretical Computer Science
Online ranking for tournament graphs
WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
An Optimal Randomized Cell Probe Lower Bound for Approximate Nearest Neighbor Searching
SIAM Journal on Computing
SIAM Journal on Computing
Distributed verification and hardness of distributed approximation
Proceedings of the forty-third annual ACM symposium on Theory of computing
Black-box complexities of combinatorial problems
Proceedings of the 13th annual conference on Genetic and evolutionary computation
Untestable properties in the kahr-moore-wang class
WoLLIC'11 Proceedings of the 18th international conference on Logic, language, information and computation
Unbounded-error quantum query complexity
Theoretical Computer Science
Recasting mermin's multi-player game into the framework of pseudo-telepathy
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
Online algorithms for maximizing weighted throughput of unit jobs with temperature constraints
FAW-AAIM'11 Proceedings of the 5th joint international frontiers in algorithmics, and 7th international conference on Algorithmic aspects in information and management
Almost tight upper bound for finding Fourier coefficients of bounded pseudo-Boolean functions
Journal of Computer and System Sciences
On the advice complexity of the k-server problem
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Lower bounds for online integer multiplication and convolution in the cell-probe model
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Complexity of coalition structure generation
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
Tracking moving objects with few handovers
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Optimal lower bounds for universal and differentially private steiner trees and TSPs
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Inflatable graph properties and natural property tests
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Local computation of PageRank: the ranking side
Proceedings of the 20th ACM international conference on Information and knowledge management
Fast and flexible unsupervised custering algorithm based on ultrametric properties
Proceedings of the 7th ACM symposium on QoS and security for wireless and mobile networks
Algorithmic Aspects of Property Testing in the Dense Graphs Model
SIAM Journal on Computing
Super-polynomial quantum speed-ups for boolean evaluation trees with hidden structure
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Lower bounds for number-in-hand multiparty communication complexity, made easy
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
The node-weighted steiner problem in graphs of restricted node weights
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Adaptive searching in succinctly encoded binary relations and tree-structured documents
CPM'06 Proceedings of the 17th Annual conference on Combinatorial Pattern Matching
Polylogarithmic concurrent data structures from monotone circuits
Journal of the ACM (JACM)
Page migration in dynamic networks
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
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
Three optimal algorithms for balls of three colors
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Improved algorithms for dynamic page migration
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
An improved algorithm for online rectangle filling
Theoretical Computer Science
On the query complexity of testing orientations for being Eulerian
ACM Transactions on Algorithms (TALG)
Property testing and the branching program size of boolean functions
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Minimum and maximum against k lies
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
Some results on approximate 1-median selection in metric spaces
Theoretical Computer Science
Price fluctuations: to buy or to rent
WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
Computing of trust in ad-hoc networks
CMS'06 Proceedings of the 10th IFIP TC-6 TC-11 international conference on Communications and Multimedia Security
Competitive analysis of scheduling algorithms for aggregated links
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Randomized algorithms for tracking distributed count, frequencies, and ranks
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
The cell probe complexity of dynamic range counting
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Tight bounds for distributed functional monitoring
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
A tight RMR lower bound for randomized mutual exclusion
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
On-line scheduling to minimize max flow time: an optimal preemptive algorithm
Operations Research Letters
Randomized algorithms for on-line scheduling problems: how low can't you go?
Operations Research Letters
Online multi-robot exploration of grid graphs with rectangular obstacles
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
Lower bounds for restricted-use objects: extended abstract
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
Lower bounds for randomized algorithms for online chain partitioning
Information Processing Letters
On the time and space complexity of randomized test-and-set
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Brief announcement: a tight RMR lower bound for randomized mutual exclusion
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Strategyproof approximations of distance rationalizable voting rules
Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Fundamenta Informaticae
Time of anonymous rendezvous in trees: determinism vs. randomization
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
Competitive analysis of maintaining frequent items of a stream
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
Optimal randomized comparison based algorithms for collision
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Theoretical Computer Science
Random Structures & Algorithms
Black-box complexities of combinatorial problems
Theoretical Computer Science
Black-box complexity: from complexity theory to playing mastermind
Proceedings of the 15th annual conference companion on Genetic and evolutionary computation
Randomized loose renaming in o(log log n) time
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Statistical algorithms and a lower bound for detecting planted cliques
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Tight bounds for online vector bin packing
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Optimal lower bounds for projective list update algorithms
ACM Transactions on Algorithms (TALG)
Understanding RFID counting protocols
Proceedings of the 19th annual international conference on Mobile computing & networking
Online algorithms for maximizing weighted throughput of unit jobs with temperature constraints
Journal of Combinatorial Optimization
Direct product via round-preserving compression
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Online selection of intervals and t-intervals
Information and Computation
Lower Bounds for Randomized Exclusive Write PRAMs
Theory of Computing Systems
| Hi-index | 0.07 |