- Unifying the Landscape of Cell-Probe Lower Bounds
2010/10/19 by Mihai Patrascu, Mihai Pǎtraşcu, Patrascu, Mihai · 4 citations
Computer Science · Mathematics · #Advanced Graph Theory Research #Combinatorics #Complexity and Algorithms in Graphs #Computational Complexity (cs.CC) #Computational Geometry (cs.CG) #Computer science #Constant (computer programming) #Cryptography and Data Security #Data Structures and Algorithms (cs.DS) #Discrete mathematics #FOS: Computer and information sciences #Fraction (chemistry) #Linear space #Mathematical analysis #Mathematics #Omega #Physics #Range (aeronautics) #Reachability #Set (abstract data type) #Space (punctuation) #Upper and lower bounds #cs.CC #cs.CG #cs.DS
- New Order Relations in Set Optimization
2010/10/15 by Johannes Jahn, Truong Xuan Duc Ha, Trúóng Xuân Dúc Hā · 8 citations
Computer Science · Mathematics · #Advanced Optimization Algorithms Research #Algorithm #Combinatorics #Completeness (order theory) #Computer science #Constraint Satisfaction and Optimization #Discrete mathematics #Geometry #Linear space #Mathematical analysis #Mathematical optimization #Mathematics #Optimization and Variational Analysis #Optimization problem #Order (exchange) #Power set #Regular polygon #Set (abstract data type) #Space (punctuation) #Theory of computation #Topological space #Vector optimization
- On Finding Lowest Common Ancestors: Simplification and Parallelization
1988/12/01 by Baruch Schieber, Uzi Vishkin · 8 citations
Computer Science · Mathematics · #Algorithms and Data Compression #Machine Learning and Algorithms #Error Correcting Code Techniques #Parallelizable manifold #Computer science #Preprocessor #Logarithm #Data structure #Combinatorics #Simple (philosophy) #Linear space #Parallel algorithm #Tree (set theory) #Time complexity #Algorithm #Parallel computing #Mathematics #Discrete mathematics
- Fast Algorithms for Finding Nearest Common Ancestors
1984/05/01 by Dov Harel, Robert E. Tarjan, Robert Endre Tarjan · 55 citations
Biochemistry, Genetics and Molecular Biology · Computer Science · Mathematics · #Algorithm #Algorithms and Data Compression #Artificial intelligence #Binary logarithm #Combinatorics #Computer science #DNA and Biological Computing #Data mining #Data structure #Discrete mathematics #Linear space #Mathematics #Measure (data warehouse) #Omega #Pointer (user interface) #Preprocessor #Time complexity #Upper and lower bounds #semigroups and automata theory
- A data structure for orthogonal range queries
1978/10/01 by George S. Lueker · 4 citations
Computer Science · Mathematics · #Advanced Image and Video Retrieval Techniques #Algorithm #Arithmetic #Combinatorics #Computational Geometry and Mesh Generation #Computer science #Constant (computer programming) #Data Management and Algorithms #Data structure #Discrete mathematics #Linear space #Mathematics #Notation #Range (aeronautics) #Range query (database) #Search engine #Set (abstract data type) #Space (punctuation) #Theoretical computer science #Tree (set theory)
- Reflexivity and the sup of linear functionals
1972/09/01 by Robert C. James · 1 citation
Computer Science · Mathematics · #Advanced Banach Space Theory #Advanced Topics in Algebra #Banach space #Continuous linear operator #Discrete mathematics #Eberlein–Šmulian theorem #Functional analysis #Interpolation space #Linear form #Linear space #Lp space #Mathematical analysis #Mathematics #Optimization and Variational Analysis #Pure mathematics #Reflexive space #Regular polygon #Separable space #Uniformly convex space #Unit sphere
- A counterexample for a sup theorem in normed spaces
1971/02/01 by Robert C. James · 1 citation
Computer Science · Mathematics · #Advanced Banach Space Theory #Algebra over a field #Combinatorics #Computer science #Counterexample #Discrete mathematics #Fixed Point Theorems Analysis #Functional analysis #Infimum and supremum #Linear space #Mathematics #Normed algebra #Normed vector space #Optimization and Variational Analysis #Pure mathematics #Space (punctuation) #Unit sphere