Jiří Matoušek | Academic Influence

Jiří Matoušek 's AcademicInfluence.com Rankings

Jiří Matoušek

Mathematics

#1166

World Rank

#1959

Historical Rank

Measure Theory

#666

World Rank

#907

Historical Rank

mathematics Degrees

Download Badge

Mathematics

Jiří Matoušek 's Degrees

PhD Mathematics Charles University

Why Is Jiří Matoušek Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Jiří Matoušek was a Czech mathematician working in computational geometry and algebraic topology. He was a professor at Charles University in Prague and the author of several textbooks and research monographs.

(See a Problem?)

Jiří Matoušek 's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Lectures on discrete geometry (2002) (1475)
Using The Borsuk-Ulam Theorem (2003) (724)
A subexponential bound for linear programming (1992) (439)
Understanding and using linear programming (2007) (396)
Efficient partition trees (1991) (395)
Using the Borsuk-Ulam Theorem: Lectures on Topological Methods in Combinatorics and Geometry (2007) (358)
Geometric Discrepancy: An Illustrated Guide (2009) (330)
Reporting Points in Halfspaces (1992) (272)
Range searching with efficient hierarchical cuttings (1992) (261)
On variants of the Johnson–Lindenstrauss lemma (2008) (259)
On linear-time deterministic algorithms for optimization problems in fixed dimension (1996) (242)
Ray shooting and parametric search (1992) (223)
On the L2-Discrepancy for Anchored Boxes (1998) (214)
Low-Distortion Embeddings of Finite Metric Spaces (2004) (212)
On range searching with semialgebraic sets (1992) (194)
Intersection Graphs of Segments (1994) (181)
Approximations and optimal geometric divide-and-conquer (1991) (176)
Invitation to discrete mathematics (1998) (174)
Approximation Algorithms and Semidefinite Programming (2012) (171)
On the complexity of finding iso- and other morphisms for partial k-trees (1992) (170)
Fat Triangles Determine Linearly Many Holes (1994) (149)
On geometric optimization with few violated constraints (1994) (142)
Constructing levels in arrangements and higher order Voronoi diagrams (1994) (140)
Cutting hyperplane arrangements (1990) (137)
Linear optimization queries (1992) (132)
Discrepancy and approximations for bounded VC-dimension (1991) (130)
On embedding expanders into ℓp spaces (1997) (126)
How to net a lot with little: small ε-nets for disks and halfspaces (1990) (125)
On the distortion required for embedding finite metric spaces into normed spaces (1996) (122)
On Approximate Geometric k -Clustering (2000) (106)
Transversal numbers for hypergraphs arising in geometry (2002) (105)
Hardness of embedding simplicial complexes in Rd (2008) (103)
Topological lower bounds for the chromatic number: A hierarchy (2002) (101)
Computing Dominances in E^n (1991) (100)
Geometric range searching (1994) (97)
String graphs requiring exponential representations (1991) (93)
Algorithms Finding Tree-Decompositions of Graphs (1991) (91)
Randomized Optimal Algorithm for Slope Selection (1991) (89)
Online conflict-free coloring for intervals (2005) (88)
Product range spaces, sensitive sampling, and derandomization (1993) (88)
Simple Proofs of Classical Theorems in Discrete Geometry via the Guth–Katz Polynomial Partitioning Technique (2011) (87)
Tight upper bounds for the discrepancy of half-spaces (1995) (83)
Construction of ɛ-nets (1990) (83)
Expected Length of the Longest Common Subsequence for Large Alphabets (2003) (83)
Dynamic half-space range reporting and its applications (2005) (80)
Farthest Neighbors, Maximum Spanning Trees and Related Problems in Higher Dimensions (1991) (78)
Discrepancy in arithmetic progressions (1996) (77)
The One-Round Voronoi Game (2002) (76)
On the chromatic number of Kneser hypergraphs (2002) (74)
On Enclosing k Points by a Circle (1995) (67)
Bounded VC-Dimension Implies a Fractional Helly Theorem (2004) (66)
Unit Distances in Three Dimensions (2011) (66)
On Functional Separately Convex Hulls (1998) (65)
Bounded-Degree Graphs have Arbitrarily Large Geometric Thickness (2005) (64)
A Combinatorial Proof of Kneser’s Conjecture* (2004) (63)
On Range Searching with Semialgebraic Sets II (2012) (62)
A Ramsey-type result for convex sets (1994) (61)
Derandomizing an Output-sensitive Convex Hull Algorithm in Three Dimensions (1995) (60)
Computing many faces in arrangements of lines and segments (1994) (59)
Polynomial-Time Computation of Homotopy Groups and Postnikov Systems in Fixed Dimension (2012) (59)
Lower bounds for weak epsilon-nets and stair-convexity (2008) (57)
Random lifts of graphs: Independence and chromatic number (2002) (56)
Stabbing Simplices by Points and Flats (2008) (55)
Lower Bounds for a Subexponential Optimization Algorithm (1994) (55)
On Gromov’s Method of Selecting Heavily Covered Points (2011) (54)
Intersection Patterns of Convex Sets (2002) (54)
Topics in Discrete Mathematics (2006) (52)
Computing All Maps into a Sphere (2011) (52)
Separating an object from its cast (1997) (51)
On ray shooting in convex polytopes (1993) (49)
Derandomization in Computational Geometry (1996) (49)
Near-Optimal Separators in String Graphs (2013) (47)
On embedding trees into uniformly convex Banach spaces (1999) (47)
Bi-Lipschitz embeddings into low-dimensional Euclidean spaces (1990) (45)
Thirty-three Miniatures: Mathematical and Algorithmic Applications of Linear Algebra (2010) (45)
Violator spaces: Structure and algorithms (2006) (44)
Random edge can be exponential on abstract cubes (2004) (43)
Multilevel Polynomial Partitions and Simplified Range Searching (2014) (42)
Relative neighborhood graphs in three dimensions (1992) (42)
Graph Colouring with No Large Monochromatic Components (2007) (41)
A fractional Helly theorem for convex lattice sets (2003) (41)
Random lifts of graphs (2001) (41)
Equipartition of Two Measures by a 4-Fan (2002) (38)
On the sum of squares of cell complexities in hyperplane arrangements (1991) (37)
Efficient Randomized Algorithms for the Repeated Median Line Estimator (1998) (36)
Simultaneous partitions of measures by K-fans (2001) (35)
Epsilon-Nets and Computational Geometry (1993) (35)
Dynamic half-space reporting, geometric optimization, and minimum spanning trees (1992) (35)
New Constructions of Weak ε-Nets (2004) (35)
Factorization Norms and Hereditary Discrepancy (2014) (34)
A deterministic algorithm for the three-dimensional diameter problem (1993) (34)
No Helly Theorem for Stabbing Translates by Lines in R3 (2004) (33)
Guarding galleries where every point sees a large area (1997) (32)
Spanning trees with low crossing number (1991) (32)
Extendability of Continuous Maps Is Undecidable (2013) (32)
Extension of Lipschitz mappings on metric trees (1990) (30)
Higher-order Erdös: Szekeres theorems (2011) (30)
Good splitters for counting points in triangles (1989) (30)
Construction of epsilon nets (1989) (30)
NP-hardness results for intersection graphs (1989) (29)
The distance trisector curve (2006) (29)
The determinant bound for discrepancy is almost tight (2011) (29)
The Probabilistic Method Lecture Notes (2009) (29)
Polynomial-Time Homology for Simplicial Eilenberg–MacLane Spaces (2012) (28)
Erdős–Szekeres-type statements: Ramsey function and decidability in dimension $1$ (2012) (28)
New constructions of weak epsilon-nets (2003) (27)
An elementary approach to lower bounds in geometric discrepancy (1995) (25)
A highly non-smooth norm on Hilbert space (1999) (25)
Zone diagrams: existence, uniqueness and algorithmic challenge (2007) (25)
On Constants for Cuttings in the Plane (1998) (24)
ClassBench-ng: Recasting ClassBench after a Decade of Network Evolution (2017) (24)
A Helly-Type Theorem for Unions of Convex Sets (1995) (23)
Blocking Visibility for Points in General Position (2009) (23)
Geometric Set Systems (1998) (22)
LC reductions yield isomorphic simplicial complexes (2008) (22)
Dimension Gaps between Representability and Collapsibility (2009) (21)
Embeddability in the 3-Sphere Is Decidable (2014) (21)
The Number Of Unique-Sink Orientations of the Hypercube* (2006) (21)
On Ramsey Sets in Spheres (1995) (21)
Quadratically Many Colorful Simplices (2007) (21)
Computing the Center of Planar Point Sets (1990) (21)
Intersection graphs of segments and $\exists\mathbb{R}$ (2014) (21)
Ramsey-like properties for bi-Lipschitz mappings of finite metric spaces (1992) (20)
Inapproximability for Metric Embeddings into R^d (2008) (20)
Crossing number, pair-crossing number, and expansion (2004) (20)
An Lp Version of the Beck-Fiala Conjecture (1998) (20)
Approximations and Optimal Geometric Divide-an-Conquer (1995) (19)
k-Sets in Four Dimensions (2006) (19)
Embedding Finite Metric Spaces into Normed Spaces (2002) (19)
Vertical decomposition of arrangements of hyperplanes in four dimensions (1995) (18)
Computing D-convex hulls in the plane (2009) (18)
Open problems on embeddings of finite metric spaces (2014) (18)
Improved upper bounds for approximation by zonotopes (1996) (18)
Low-Distortion Embeddings of Trees (2001) (17)
On polynomial time decidability of induced-minor-closed classes (1988) (17)
Reachability by Paths of Bounded Curvature in a Convex Polygon (2010) (17)
On directional convexity (2001) (17)
On Vertical Ray Shooting in Arrangements (1993) (16)
Note on bi-Lipschitz embeddings into normed spaces (1992) (15)
String graphs and separators (2013) (15)
A Geometric Proof of the Colored Tverberg Theorem (2010) (14)
Fat triangles determine linearly many holes (computational geometry) (1991) (14)
On discrepancy bounds via dual shatter function (1997) (14)
Reachability by paths of bounded curvature in convex polygons (2000) (14)
Ham-sandwich cuts in Rd (1992) (14)
On the Nonexistence of k-reptile Tetrahedra (2010) (13)
Lower bounds on the length of monotone paths in arrangements (1991) (13)
Large Monochromatic Components in Two-colored Grids (2007) (13)
Distance k-sectors exist (2009) (13)
Zone diagrams in Euclidean spaces and in other normed spaces (2009) (13)
Lower bounds on geometric Ramsey functions (2013) (13)
INAPPROXIMABILITY FOR METRIC EMBEDDINGS INTO R (2010) (13)
Untangling two systems of noncrossing curves (2013) (13)
Triangles in random graphs (2004) (13)
On restricted min‐wise independence of permutations (2003) (13)
Piecewise linear paths among convex obstacles (1993) (12)
Induced Trees in Triangle-Free Graphs (2007) (12)
On visibility and covering by convex sets (1999) (12)
Characterization of PEEK, PET and PI implanted with Mn ions and sub-sequently annealed (2014) (12)
On dominatedl1 metrics (2001) (12)
The Exponent of Discrepancy Is at Least 1.0669 (1998) (11)
How many points can be reconstructed from k projections? (2007) (11)
A Lower Bound for Weak ɛ -Nets in High Dimension (2002) (11)
Curves in Rd intersecting every hyperplane at most d + 1 times (2013) (11)
Integer Programming and LP Relaxation (2007) (10)
Where is the triangle (2010) (10)
Lower Bounds on the Transversal Numbers of d-Intervals (2001) (10)
Hardness of embedding simplicial complexes in $\mathbb {R}^d$ (2011) (10)
Segmenting object space by geometric reference structures (2006) (10)
Invitation to Discrete Mathematics (2. ed.) (2009) (9)
Fast lookup for dynamic packet filtering in FPGA (2014) (9)
Computing higher homotopy groups is W[1]-hard (2013) (9)
Removing Degeneracy in LP-Type Problems Revisited (2009) (9)
On the Signed Domination in Graphs (2000) (9)
Geometry, Structure and Randomness in Combinatorics (2014) (8)
Combinatorial Discrepancy for Boxes via the gamma_2 Norm (2015) (8)
Deep Packet Inspection in FPGAs via Approximate Nondeterministic Automata (2019) (8)
Vectors in a box (2009) (8)
Geometric Computation and the Art of Sampling (1998) (7)
Berge's theorem, fractional Helly, and art galleries (2006) (7)
The Randomized Integer Convex Hull (2005) (7)
Towards asymptotic optimality in probabilistic packet marking (2005) (7)
Discrepancy After Adding A Single Set (2005) (7)
Almost-Tiling the Plane by Ellipses (1998) (6)
Lower bound on the minus-domination number (2001) (6)
Combinatorial Discrepancy for Boxes via the Ellipsoid-Infinity Norm (2014) (6)
2 Combinatorial Discrepancy for Boxes via the γ 2 Norm (2015) (5)
The number of unit distances is almost linear for most norms (2010) (5)
Note on the Colored Tverberg Theorem (1996) (5)
8 LOW-DISTORTION EMBEDDINGS OF FINITE METRIC SPACES (2017) (5)
Nonexistence of 2-Reptile Simplices (2004) (5)
The Dawn of an Algebraic Era in Discrete Geometry? (2011) (5)
Higher-order Erdős–Szekeres theorems (2013) (5)
Counting spanning trees (2010) (5)
A Doubly Exponentially Crumbled Cake (2011) (5)
Packing complete bipartite graphs (2010) (4)
The t-Pebbling Number is Eventually Linear in t (2011) (4)
A Tail Estimate for Mulmuley's Segment Intersection Algorithm (1992) (4)
Discrepancy of point sequences on fractal sets (2000) (4)
Hercules versus Hidden Hydra Helper (1991) (4)
Simplifying Inclusion–Exclusion Formulas (2012) (4)
The Minimum Independence Number of a Hasse Diagram (2006) (4)
Removing Degeneracy May Require a Large Dimension Increase (2007) (4)
On the Linear and Hereditary Discrepancies (2000) (4)
A Lower Bound for Families of Natarajan Dimension d (2001) (4)
The Borsuk–Ulam Theorem (2008) (3)
Approximate Levels in Line Arrangements (1991) (3)
Packing Cones and Their Negatives in Space (2007) (3)
A novel architecture for LZSS compression of configuration bitstreams within FPGA (2017) (3)
Removing degeneracy may require unbounded dimension increase (2007) (3)
On Lipschitz Mappings Onto a Square (2013) (3)
Memory efficient IP lookup in 100 GBPS networks (2013) (3)
Around Brouwer's fixed point theorem (Lecture notes) (2014) (3)
Mathematics++: Selected Topics Beyond the Basic Courses (2015) (3)
Extending continuous maps: polynomiality and undecidability (2013) (3)
Minimum and maximum against k lies (2010) (3)
Curves in $\mathbb R^d$ intersecting every hyperplane at most $d+1$ times (2016) (3)
Precise IPv4/IPv6 packet generator based on NetCOPE platform (2011) (2)
Number of Faces in Arrangements (2002) (2)
Regular expression matching with pipelined delayed input DFAs for high-speed networks (2018) (2)
Quadratic lower bound for the number of colourful simplices (2007) (2)
Complexity of Projected Images of Convex Subdivisions (1994) (2)
An Interior-Point Algorithm for Semidefinite Programming (2012) (2)
Line Arrangements and Range Search (1988) (2)
Convex Independent Subsets (2002) (2)
Embeddability in the 3-sphere is decidable (2014) (1)
What Was It About? An Informal Summary (2002) (1)
Not Only the Simplex Method (2007) (1)
Duality of Linear Programming (2007) (1)
Towards hardware architecture for memory efficient IPv4/IPv6 Lookup in 100 Gbps networks (2013) (1)
On the Discrepancy for Cartesian Products (2000) (1)
A Lower Bound on the Size of Lipschitz Subsets in Dimension 3 (2003) (1)
Farthest Neighbours, Maximum Spanning Trees and Related Problems in Higher Dimensions (1991) (1)
High-dimensional geometry and measure concentration (2015) (1)
Increasing Memory Efficiency of Hash-Based Pattern Matching for High-Speed Networks (2021) (1)
On Gromov’s Method of Selecting Heavily Covered Points (2014) (1)
High-Speed Regular Expression Matching with Pipelined Memory-Based Automata (2018) (1)
Lattices and Minkowski’s Theorem (2002) (1)
Multilevel Polynomial Partitions and Simplified Range Searching (2015) (0)
Shannon capacity of the union: A tale of two fields (2010) (0)
Object Space Segmentation by Geometric Reference Structures (2005) (0)
The clubs of Oddtown (2010) (0)
Set pairs and exterior products (2010) (0)
Increasing Throughput of Intrusion Detection Systems by Hash-Based Short String Pre-filter (2020) (0)
Computing maps into a sphere (2012) (0)
Representations of finite groups (2015) (0)
A Topological Interlude (2008) (0)
Two Applications of High-Dimensional Polytopes (2002) (0)
Colorings with Low Discrepancy (2012) (0)
Are these distances Euclidean (2010) (0)
Extending continuous maps : polynomiality and undecidability ( a survey ) ∗ (2013) (0)
The Anatomy of a Geometric Algorithm (1999) (0)
Only two distances (2010) (0)
Bay Networks SS7-Internet Access Signaling Protocol (1998) (0)
Scalability of Hash-Based Pattern Matching for High-Speed Network Security and Monitoring (2021) (0)
On the gap between representability and collapsibility (2008) (0)
Medium-size intersection is hard to avoid (2010) (0)
Same-size intersections (2010) (0)
A Geometric Proof of the Colored Tverberg Theorem (2011) (0)
Theory of Linear Programming: First Steps (2007) (0)
What Is It, and What For? (2007) (0)
Rounding Via Miniatures (2012) (0)
Kingsley Amis - Lucky Jim and John Brain - Room at the top (1999) (0)
Attempts to Count k-Sets (2002) (0)
A zero-player graph game in NP $\cap$ coNP (2016) (0)
Untangling two systems of noncrossing curves (2016) (0)
More Lower Bounds and the Fourier Transform (1999) (0)
On stabbing triangles by lines in 3-space (2010) (0)
Maximizing a Quadratic Form on a Graph (2012) (0)
Extendability of Continuous Maps Is Undecidable (2013) (0)
Three Petersens are not enough (2010) (0)
Measure Concentration and Almost Spherical Sections (2002) (0)
Volumes in High Dimension (2002) (0)
Reliable Signaling Gateway Protocol (RSGP) (1998) (0)
Zone diagrams in Euclidean spaces and in other normed spaces (2011) (0)
Perfect matchings and determinants (2010) (0)
Introduction: MaxCut Via Semidefinite Programming (2012) (0)
Bay Networks SS7-Internet Gateway Architecture (1998) (0)
Acknowledgement to Referees (2001) (0)
On Voronoi Diagrams with Neutral Zones (2005) (0)
Geometric Selection Theorems (2002) (0)
Sculptural Creations Based on Astronomical Phenomena (2017) (0)
Simple Proofs of Classical Theorems in Discrete Geometry via the Guth–Katz Polynomial Partitioning Technique (2012) (0)
Measure and integral (2015) (0)
Multiple Points of Coincidence (2008) (0)
The end of the small coins (2010) (0)
Covering a cube minus one vertex (2010) (0)
The secret agent and umbrella (2010) (0)
Few colored cuts or cycles in edge colored graphs (1988) (0)
Tiling a rectangle by squares (2010) (0)
Shannon Capacity and Lovász Theta (2012) (0)
Duality and Cone Programming (2012) (0)
Error-correcting codes (2010) (0)
Lower Bounds for the Goemans–Williamson MaxCut Algorithm (2012) (0)
In how many ways can a man tile a board (2010) (0)
C G ] 2 2 A pr 2 00 9 Hardness of embedding simplicial complexes in (2009) (0)
Transversals and Epsilon Nets (2002) (0)
Introduction to Discrete Geometry Lecture Notes (2013) (0)
Chapter 13 – Derandomization in Computational Geometry (2000) (0)
ℤ2-Maps and Nonembeddability (2008) (0)
Vectors in a box (2011) (0)
On-Line Computation of Convolutions (1989) (0)
Approximately Solving Semidefinite Programs (2012) (0)
A Review of Approximation Algorithms and Semidefinite Programming (0)
Turning a ladder over a finite field (2010) (0)
A typical property of the symmetric differential quotient (1989) (0)
Fibonacci numbers, the formula (2010) (0)
VC-Dimension and Discrepancy (1999) (0)
Polynomial-Time Homology for Simplicial Eilenberg–MacLane Spaces (2013) (0)
Discrepancy, Bansal's Algorithm and the Determinant Bound (2012) (0)
Rotating the cube (2010) (0)
More bricks—more walls? (2010) (0)
Integer Points in Rotating Convex Bodies (2003) (0)
On the difficulty of reducing the diameter (2010) (0)
Software and Further Reading (2007) (0)
Petersen, Hoffman–Singleton, and maybe 57 (2010) (0)
Low-Discrepancy Sets for Axis-Parallel Boxes (1999) (0)
The Klee-Grünbaum FESTIVAL OF GEOMETRY, International Conference Ein Gev, Sea of Galilee, Israel (2000) (0)
Coloring 3-Chromatic Graphs (2012) (0)
Constraint Satisfaction Problems, and Relaxing Them Semidefinitely (2012) (0)
Transversals of hypergraphs with geometric flavor (2001) (0)
Fibonacci numbers, quickly (2010) (0)
The Simplex Method (2007) (0)
ClassBench-ng: Benchmarking Packet Classification Algorithms in the OpenFlow Era (2022) (0)
Checking matrix multiplication (2010) (0)
Upper Bounds in the Lebesgue-Measure Setting (1999) (0)
Is it associative (2010) (0)
Direct Applications of Borsuk–Ulam (2008) (0)
Three-Monotone Interpolation (2015) (0)
Three-Monotone Interpolation (2014) (0)
Cutting cheaply using eigenvectors (2010) (0)
Walking in the yard (2010) (0)

This paper list is powered by the following services:

Other Resources About Jiří Matoušek

en.wikipedia.org

What Schools Are Affiliated With Jiří Matoušek ?

Jiří Matoušek is affiliated with the following schools:

Image Attributions

Image Source for Jiří Matoušek