The following pages link to Kurt Mehlhorn (Q270030):
Displaying 50 items.
- (Q62745) (redirect page) (← links)
- Fair matchings and related problems (Q270032) (← links)
- Improved balanced flow computation using parametric flow (Q284342) (← links)
- An analysis of the highest-level selection rule in the preflow-push max-flow algorithm (Q294662) (← links)
- Cycle bases in graphs characterization, algorithms, complexity, and applications (Q458496) (← links)
- Certifying algorithms (Q465678) (← links)
- Computing real roots of real polynomials (Q491245) (← links)
- Towards more practical linear programming-based techniques for algorithmic mechanism design (Q506527) (← links)
- Certifying 3-edge-connectivity (Q513265) (← links)
- A deterministic algorithm for isolating real roots of a real polynomial (Q607163) (← links)
- Arrangements on parametric surfaces. I: General framework and infrastructure (Q626974) (← links)
- New approximation algorithms for minimum cycle bases of graphs (Q633843) (← links)
- A general approach to the analysis of controlled perturbation algorithms (Q654290) (← links)
- Maintaining dynamic sequences under equality tests in polylogarithmic time (Q675314) (← links)
- Earning limits in Fisher markets with spending-constraint utilities (Q681846) (← links)
- Randomized incremental construction of abstract Voronoi diagrams (Q685599) (← links)
- Four results on randomized incremental constructions (Q686138) (← links)
- Tail estimates for the efficiency of randomized incremental algorithms for line segment intersection (Q686143) (← links)
- Cycle bases of graphs and sampled manifolds (Q733440) (← links)
- On randomized fictitious play for approximating saddle points over convex sets (Q747628) (← links)
- On the construction of abstract Voronoi diagrams (Q757052) (← links)
- Space sweep solves intersection of convex polyhedra (Q759486) (← links)
- Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories (Q799371) (← links)
- Partial match retrieval in implicit data structures (Q800083) (← links)
- Dynamic fractional cascading (Q908708) (← links)
- Hidden line elimination for isooriented rectangles (Q911768) (← links)
- Bounded ordered dictionaries in O(log log N) time and O(n) space (Q915434) (← links)
- Dynamic deferred data structuring (Q917273) (← links)
- Note on the paper ``K-vertex guarding simple polygons'' (Q924091) (← links)
- Faster algorithms for computing Hong's bound on absolute positiveness (Q972846) (← links)
- An \(\tilde{O}(m^{2}n)\) algorithm for minimum cycle basis of graphs (Q1006382) (← links)
- Optimal search for rationals (Q1007565) (← links)
- On BF-orderable graphs (Q1084116) (← links)
- Area-time optimal division for \(T=\Omega ((\log \,n)^{1+\epsilon})\) (Q1091140) (← links)
- Channel routing in knock-knee mode: Simplified algorithms and proofs (Q1091149) (← links)
- Parallel algorithms for computing maximal independent sets in trees and for updating minimum spanning trees (Q1098631) (← links)
- (Q1108024) (redirect page) (← links)
- A log log n data structure for three-sided range queries (Q1108025) (← links)
- Some remarks on Boolean sums (Q1133518) (← links)
- On the average number of rebalancing operations in weight-balanced trees (Q1140428) (← links)
- Optimal dynamization of decomposable searching problems (Q1153688) (← links)
- A new data structure for representing sorted lists (Q1162362) (← links)
- Effiziente Algorithmen: Ein Beispiel (Q1166927) (← links)
- A lower bound for the nondeterministic space complexity of context-free recognition (Q1198017) (← links)
- \(k\) versus \(k+1\) index registers and modifiable versus non-modifiable programs (Q1201728) (← links)
- Simultaneous inner and outer approximation of shapes (Q1201744) (← links)
- Approximate motion planning and the complexity of the boundary of the union of simple geometric figures (Q1201745) (← links)
- On local routing of two-terminal nets (Q1210582) (← links)
- Monotone switching circuits and Boolean matrix product (Q1224550) (← links)
- Polynomial and abstract subrecursive classes (Q1227276) (← links)
