On the Optimality of Some Set Algorithms
Journal of the ACM (JACM)
On the complexity of computing the measure of ∪[ai,bi]
Communications of the ACM
An Extension of Rabin's Complete Proof Concept
Proceedings on Mathematical Foundations of Computer Science
Lower Bounds for Problems Defined by Polynomial Inequalities
FCT '81 Proceedings of the 1981 International FCT-Conference on Fundamentals of Computation Theory
STOC '75 Proceedings of seventh annual ACM symposium on Theory of computing
The computational complexity of continued fractions
SYMSAC '81 Proceedings of the fourth ACM symposium on Symbolic and algebraic computation
A lower bound to finding convex hulls
A lower bound to finding convex hulls
Lower bounds for solving linear diophantine equations on random access machines
Journal of the ACM (JACM)
Applications of Ramsey's theorem to decision tree complexity
Journal of the ACM (JACM)
Quadratic bounds for hidden line elimination
SCG '86 Proceedings of the second annual symposium on Computational geometry
Deferred data structuring: Query-driven preprocessing for geometric search problems
SCG '86 Proceedings of the second annual symposium on Computational geometry
Constructing higher-dimensional convex hulls at logarithmic cost per face
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Limitations to algorithm solvability: Galois methods and models of computation
SYMSAC '86 Proceedings of the fifth ACM symposium on Symbolic and algebraic computation
Establishing order in planar subdivisions
SCG '87 Proceedings of the third annual symposium on Computational geometry
Fast algorithms for N-dimensional restrictions of hard problems
Journal of the ACM (JACM)
Optimal algorithms for approximate clustering
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
A Unified Approach to the Change of Resolution: Space and Gray-Level
IEEE Transactions on Pattern Analysis and Machine Intelligence
Algorithms for vertical and orthogonal L1 linear approximation of points
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Determining sector visibility of a polygon
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
An efficient algorithm for hidden surface removal
SIGGRAPH '89 Proceedings of the 16th annual conference on Computer graphics and interactive techniques
A lower bound for integer greatest common divisor computations
Journal of the ACM (JACM)
A packing problem with applications to lettering of maps
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Circular hulls and orbiforms of simple polygons
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Linear decision trees: volume estimates and topological bounds
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Journal of the ACM (JACM)
An optimal algorithm for intersecting line segments in the plane
Journal of the ACM (JACM)
On the complexity of functions for random access machines
Journal of the ACM (JACM)
Decision trees: old and new results
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Trans-dichotomous algorithms for minimum spanning trees and shortest paths
Journal of Computer and System Sciences - Special issue: 31st IEEE conference on foundations of computer science, Oct. 22–24, 1990
Computational geometry: a retrospective
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Lower bounds for parallel linear programming and other problems
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Decision tree complexity and Betti numbers
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Lower bounds on testing membership to a polyhedron by algebraic decision trees
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
New lower bounds for Hopcroft's problem
Proceedings of the eleventh annual symposium on Computational geometry
An optimal algorithm for closest pair maintenance (extended abstract)
Proceedings of the eleventh annual symposium on Computational geometry
An optimal algorithm for finding segments intersections
Proceedings of the eleventh annual symposium on Computational geometry
An optimal algorithm for area minimization of slicing floorplans
ICCAD '95 Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design
Sorting on a parallel pointer machine with applications to set expression evaluation
Journal of the ACM (JACM)
New lower bounds for convex hull problems in odd dimensions
Proceedings of the twelfth annual symposium on Computational geometry
On bounding the Betti numbers and computing the Euler characteristic of semi-algebraic sets
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
A lower bound for randomized algebraic decision trees
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Randomized Ω(n2) lower bound for knapsack
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Is there an algebraic proof for P ≠ NC? (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Space-time tradeoffs for emptiness queries (extended abstract)
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Randomized complexity lower bounds
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Lower bounds for high dimensional nearest neighbor search and related problems
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
On minimum stars, minimum Steiner stars, and maximum matchings
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Lower bounds for linear satisfiability problems
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Randomized data structures for the dynamic closest-pair problem
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Faster construction of planar two-centers
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Map labeling and its generalizations
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Simplicity and hardness of the maximum traveling salesman problem under geometric distances
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
An optimal algorithm for the maximum two-chain problem
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
New results on server problems
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Output-size sensitive algorithms for finding maximal vectors
SCG '85 Proceedings of the first annual symposium on Computational geometry
Rectilinear shortest paths with rectangular barriers
SCG '85 Proceedings of the first annual symposium on Computational geometry
On the decisional complexity of problems over the reals
Information and Computation
Testing Homotopy for paths in the plane
Proceedings of the eighteenth annual symposium on Computational geometry
Lower bounds for approximate polygon decomposition and minimum gap
Information Processing Letters
Computing in Science and Engineering
Lower bounds for computing statistical depth
Computational Statistics & Data Analysis
Simple randomized algorithms for closest pair problems
Nordic Journal of Computing
New Results of Fault Tolerant Geometric Spanners
WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
Efficient Approximation Algorithms for Multi-label Map Labeling
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
On the Complexity of Integer Programming in the Blum-Shub-Smale Computational Model
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
Exact and Approximate Distances in Graphs - A Survey
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Randomized Complexity of Linear Arrangements and Polyhedra
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
Distribution-sensitive algorithms
Nordic Journal of Computing
Computational topology: ambient isotopic approximation of 2-manifolds
Theoretical Computer Science - Topology in computer science
Preprocessing chains for fast dihedral rotations is hard or even impossible
Computational Geometry: Theory and Applications
On the least median square problem
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Lower bounds for linear degeneracy testing
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Quantum lower bounds for the collision and the element distinctness problems
Journal of the ACM (JACM)
On the symmetric angle-restricted nearest neighbor problem
Information Processing Letters
On the algebraic complexity of set equality and inclusion
Information Processing Letters
Lower bounds for linear degeneracy testing
Journal of the ACM (JACM)
Lower bounds for external algebraic decision trees
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Finding the shortest bottleneck edge in a parametric minimum spanning tree
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Local polyhedra and geometric graphs
Computational Geometry: Theory and Applications - Special issue on the 19th annual symposium on computational geometry - SoCG 2003
A lower bound for computing Oja depth
Information Processing Letters
Range mode and range median queries on lists and trees
Nordic Journal of Computing
A geometric framework for solving subsequence problems in computational biology efficiently
SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
Open problems around exact algorithms
Discrete Applied Mathematics
Covering point sets with two disjoint disks or squares
Computational Geometry: Theory and Applications
A 3D Convex Hull algorithm for modelling medical data in a virtual environment
International Journal of Intelligent Systems Technologies and Applications
A (slightly) faster algorithm for klee's measure problem
Proceedings of the twenty-fourth annual symposium on Computational geometry
Output-sensitive algorithms for Tukey depth and related problems
Statistics and Computing
Cascading divide-and-conquer: A technique for designing parallel algorithms
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Linear Transformations in Boolean Complexity Theory
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Minimal Deductive Systems for RDF
ESWC '07 Proceedings of the 4th European conference on The Semantic Web: Research and Applications
Vapnik-Chervonenkis Dimension of Parallel Arithmetic Computations
ALT '07 Proceedings of the 18th international conference on Algorithmic Learning Theory
Finiteness Properties of Some Families of GP-Trees
Current Topics in Artificial Intelligence
VC Dimension Bounds for Analytic Algebraic Computations
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Matching points with rectangles and squares
Computational Geometry: Theory and Applications
Optimal algorithms for the average-constrained maximum-sum segment problem
Information Processing Letters
On Exact Solutions to the Euclidean Bottleneck Steiner Tree Problem
WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
Algorithms for optimal outlier removal
Journal of Discrete Algorithms
Engineering the divide-and-conquer closest pair algorithm
Journal of Computer Science and Technology
An Ω(n logn) lower bound for computing the sum of even-raked elements
Information Processing Letters
An optimal algorithm for the maximum-density path in a tree
Information Processing Letters
Pointed binary encompassing trees: Simple and optimal
Computational Geometry: Theory and Applications
Delaunay Triangulation of Imprecise Points Simplified and Extended
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
A (slightly) faster algorithm for Klee's measure problem
Computational Geometry: Theory and Applications
Simple and Efficient Minimal RDFS
Web Semantics: Science, Services and Agents on the World Wide Web
Algorithms for testing fault-tolerance of sequenced jobs
Journal of Scheduling
Local polyhedra and geometric graphs
Computational Geometry: Theory and Applications - Special issue on the 19th annual symposium on computational geometry - SoCG 2003
Cryptography and Coding '09 Proceedings of the 12th IMA International Conference on Cryptography and Coding
Optimal Randomized Algorithm for the Density Selection Problem
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
A lower bound for computing Oja depth
Information Processing Letters
On the symmetric angle-restricted nearest neighbor problem
Information Processing Letters
On the algebraic complexity of set equality and inclusion
Information Processing Letters
Annals of Mathematics and Artificial Intelligence
Recursion and parallel algorithms in geometric modeling problems
Cybernetics and Systems Analysis
Determining the visibility of a planar set of line segments in O(n log log n) time
ICCSA'07 Proceedings of the 2007 international conference on Computational science and Its applications - Volume Part II
On exact solutions to the Euclidean bottleneck Steiner tree problem
Information Processing Letters
An algorithmic comparison of three scientific impact indices
Acta Cybernetica
Greedy Algorithm with Weights for Decision Tree Construction
Fundamenta Informaticae - Hardest Boolean Functions and O.B. Lupanov
ALGOSENSORS'10 Proceedings of the 6th international conference on Algorithms for sensor systems, wireless adhoc networks, and autonomous mobile entities
Convex hull of imprecise points in o(n log n) time after preprocessing
Proceedings of the twenty-seventh annual symposium on Computational geometry
Symmetric functions capture general functions
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Tight time bounds for the minimum local convex partition problem
JCDCG'04 Proceedings of the 2004 Japanese conference on Discrete and Computational Geometry
Power domination problem in graphs
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Covering a set of points with a minimum number of lines
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
Approximate range mode and range median queries
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Time complexity of decision trees
Transactions on Rough Sets III
An efficient algorithm for the sign condition problem in the semi-algebraic context
GMP'10 Proceedings of the 6th international conference on Advances in Geometric Modeling and Processing
Lower bounds for geometric diameter problems
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
A comment on a minmax location problem
Operations Research Letters
Unimprovable Upper Bounds on Time Complexity of Decision Trees
Fundamenta Informaticae
Optimal randomized comparison based algorithms for collision
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Range majority in constant time and linear space
Information and Computation
Convex hull of points lying on lines in o(nlogn) time after preprocessing
Computational Geometry: Theory and Applications
GD'12 Proceedings of the 20th international conference on Graph Drawing
Optimal time-convex hull under the Lp metrics
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
An optimal algorithm for the Euclidean bottleneck full Steiner tree problem
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |
A topological method is given for obtaining lower bounds for the height of algebraic computation trees, and algebraic decision trees. Using this method we are able to generalize, and present in a uniform and easy way, almost all the known nonlinear lower bounds for algebraic computations. Applying the method to decision trees we extend all the apparently known lower bounds for linear decision trees to bounded degree algebraic decision trees, thus answering the open questions raised by Steele and Yao [20]. We also show how this new method can be used to establish lower bounds on the complexity of constructions with ruler and compass in plane Euclidean geometry.