A new polynomial-time algorithm for linear programming
Combinatorica
Generating quasi-random sequences from semi-random sources
Journal of Computer and System Sciences
Mathematical Programming: Series A and B
Mathematical Programming: Series A and B
On the probable performance of Heuristics for bandwidth minimization
SIAM Journal on Computing
A probabilistic analysis of the simplex method
A probabilistic analysis of the simplex method
Probabilistic models for linear programming
Mathematics of Operations Research
A subexponential randomized simplex algorithm (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Some applications of the rank revealing QR factorization
SIAM Journal on Scientific and Statistical Computing
Some perturbation theory for linear programming
Mathematical Programming: Series A and B
Coloring random and semi-random k-colorable graphs
Journal of Algorithms
Linear programming, complexity theory and elementary functional analysis
Mathematical Programming: Series A and B
A primal-dual interior point method whose running time depends only on the constraint matrix
Mathematical Programming: Series A and B
Heuristics for Finding Large Independent Sets, with Applications to Coloring Semi-random Graphs
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,
Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,
Controlled perturbation for Delaunay triangulations
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
MaxSolver: an efficient exact algorithm for (weighted) maximum satisfiability
Artificial Intelligence
SIGACT news online algorithms column 8
ACM SIGACT News
Nash Equilibria in Random Games
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Improved Smoothed Analysis of the Shadow Vertex Simplex Method
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
A randomized polynomial-time simplex algorithm for linear programming
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
How slow is the k-means method?
Proceedings of the twenty-second annual symposium on Computational geometry
On the Probabilistic Foundations of Probabilistic Roadmap Planning
International Journal of Robotics Research
Veracity radius: capturing the locality of distributed computations
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Mechanism design for policy routing
Distributed Computing - Special issue: PODC 04
Topology matters: smoothed competitiveness of metrical task systems
Theoretical Computer Science
Decision-making based on approximate and smoothed Pareto curves
Theoretical Computer Science
Smoothed analysis of binary search trees
Theoretical Computer Science
Average-Case and Smoothed Competitive Analysis of the Multilevel Feedback Algorithm
Mathematics of Operations Research
The condition number of a randomly perturbed matrix
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Worst case and probabilistic analysis of the 2-Opt algorithm for the TSP: extended abstract
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Why simple hash functions work: exploiting the entropy in a data stream
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Computational Geometry: Theory and Applications
Online auctions and generalized secretary problems
ACM SIGecom Exchanges
The Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization
IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
Why Greed Works for Shortest Common Superstring Problem
CPM '08 Proceedings of the 19th annual symposium on Combinatorial Pattern Matching
Smoothed Analysis of Binary Search Trees and Quicksort under Additive Noise
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Analysis of QoS in cooperative services for real time applications
Data & Knowledge Engineering
On smoothed k-CNF formulas and the Walksat algorithm
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Improved smoothed analysis of the k-means method
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
SubPolyhedra: A (More) Scalable Approach to Infer Linear Inequalities
VMCAI '09 Proceedings of the 10th International Conference on Verification, Model Checking, and Abstract Interpretation
Settling the complexity of computing two-player Nash equilibria
Journal of the ACM (JACM)
Smoothed analysis of probabilistic roadmaps
Computational Geometry: Theory and Applications
Visibility maps of realistic terrains have linear smoothed complexity
Proceedings of the twenty-fifth annual symposium on Computational geometry
k-means requires exponentially many iterations even in the plane
Proceedings of the twenty-fifth annual symposium on Computational geometry
Large-scale behavioral targeting
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
Mining discrete patterns via binary matrix factorization
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
Smoothed analysis: an attempt to explain the behavior of algorithms in practice
Communications of the ACM - A View of Parallel Computing
Smoothed Analysis of Balancing Networks
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Uncoordinated two-sided matching markets
ACM SIGecom Exchanges
On Smoothed Analysis of Quicksort and Hoare's Find
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
Smooth Analysis of the Condition Number and the Least Singular Value
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Why greed works for shortest common superstring problem
Theoretical Computer Science
MaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability
Artificial Intelligence
Practical lessons of data mining at Yahoo!
Proceedings of the 18th ACM conference on Information and knowledge management
Worst-Case and Smoothed Analysis of k-Means Clustering with Bregman Divergences
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
On the approximation and smoothed complexity of Leontief market equilibria
FAW'07 Proceedings of the 1st annual international conference on Frontiers in algorithmics
Behavioral Targeting: The Art of Scaling Up Simple Algorithms
ACM Transactions on Knowledge Discovery from Data (TKDD)
Utilitarian mechanism design for multi-objective optimization
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Local search: simple, successful, but sometimes sluggish
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Theoretical properties of two ACO approaches for the traveling salesman problem
ANTS'10 Proceedings of the 7th international conference on Swarm intelligence
Algorithm engineering: bridging the gap between algorithm theory and practice
Algorithm engineering: bridging the gap between algorithm theory and practice
Maintaining consistency of probabilistic databases: a linear programming approach
ER'10 Proceedings of the 29th international conference on Conceptual modeling
On the decomposition method for linear programming decoding of LDPC codes
IEEE Transactions on Communications
Braess's paradox in large sparse graphs
WINE'10 Proceedings of the 6th international conference on Internet and network economics
Pareto optimal solutions for smoothed analysts
Proceedings of the forty-third annual ACM symposium on Theory of computing
Subexponential lower bounds for randomized pivoting rules for the simplex algorithm
Proceedings of the forty-third annual ACM symposium on Theory of computing
Bounds on the complexity of halfspace intersections when the bounded faces have small dimension
Proceedings of the twenty-seventh annual symposium on Computational geometry
Path trading: fast algorithms, smoothed analysis, and hardness results
SEA'11 Proceedings of the 10th international conference on Experimental algorithms
Lower bounds for the smoothed number of pareto optimal solutions
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Stochastic mean payoff games: smoothed analysis and approximation schemes
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Settling the complexity of local max-cut (almost) completely
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Smoothed Analysis of the k-Means Method
Journal of the ACM (JACM)
Smoothed analysis of partitioning algorithms for Euclidean functionals
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
The bounded search tree algorithm for the closest string problem has quadratic smoothed complexity
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Smoothed performance guarantees for local search
ESA'11 Proceedings of the 19th European conference on Algorithms
Smoothed Analysis of Moore-Penrose Inversion
SIAM Journal on Matrix Analysis and Applications
Making economic theory operational
WINE'06 Proceedings of the Second international conference on Internet and Network Economics
WINE'06 Proceedings of the Second international conference on Internet and Network Economics
PoweRGen: A power-law based generator of RDFS schemas
Information Systems
Smoothed analysis of algorithms and heuristics
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Alternative measures of computational complexity with applications to agnostic learning
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
Smoothed analysis of binary search trees
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Decision making based on approximate and smoothed pareto curves
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Smoothed analysis of integer programming
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
Smoothed analysis of integer programming
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
Column subset selection via sparse approximation of SVD
Theoretical Computer Science
Guarantees for the success frequency of an algorithm for finding dodgson-election winners
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
The smoothed analysis of algorithms
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
A new look at the automatic synthesis of linear ranking functions
Information and Computation
Improved smoothed analysis of multiobjective optimization
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
A complementary pivot algorithm for markets under separable, piecewise-linear concave utilities
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Smoothed analysis of left-to-right maxima with applications
ACM Transactions on Algorithms (TALG)
Learning with stochastic inputs and adversarial outputs
Journal of Computer and System Sciences
Recent development in computational complexity characterization of Nash equilibrium
Computer Science Review
George B. Dantzig and systems optimization
Discrete Optimization
George Dantzig's impact on the theory of computation
Discrete Optimization
The smoothed complexity of edit distance
ACM Transactions on Algorithms (TALG)
Viewsheds on terrains in external memory
SIGSPATIAL Special
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
An EFSM-based passive fault detection approach
TestCom'07/FATES'07 Proceedings of the 19th IFIP TC6/WG6.1 international conference, and 7th international conference on Testing of Software and Communicating Systems
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Sub-polyhedral scheduling using (unit-)two-variable-per-inequality polyhedra
POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Near optimal tree size bounds on a simple real root isolation algorithm
Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation
Complexity analysis of random geometric structures made simpler
Proceedings of the twenty-ninth annual symposium on Computational geometry
Approximating independent set in perturbed graphs
Discrete Applied Mathematics
Finding short paths on polytopes by the shadow vertex algorithm
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Attribute-efficient evolvability of linear functions
Proceedings of the 5th conference on Innovations in theoretical computer science
A probabilistic PTAS for shortest common superstring
Theoretical Computer Science
Implementing the simplex method as a cutting-plane method, with a view to regularization
Computational Optimization and Applications
Maximum Matching and Linear Programming in Fixed-Point Logic with Counting
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
Sharpened graph ensemble for semi-supervised learning
Intelligent Data Analysis
| Hi-index | 0.01 |
We introduce the smoothed analysis of algorithms, which continuously interpolates between the worst-case and average-case analyses of algorithms. In smoothed analysis, we measure the maximum over inputs of the expected performance of an algorithm under small random perturbations of that input. We measure this performance in terms of both the input size and the magnitude of the perturbations. We show that the simplex algorithm has smoothed complexity polynomial in the input size and the standard deviation of Gaussian perturbations.