Jirí Matousek - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 100 from 197

2018

2017

A novel architecture for LZSS compression of configuration bitstreams within FPGARadek Isa, Jirí Matousek. ddecs 2017: 171-176 [doi]

ClassBench-ng: Recasting ClassBench after a Decade of Network EvolutionJirí Matousek, Gianni Antichi, Adam Lucansky, Andrew W. Moore 0002, Jan Korenek. ancs 2017: 204-216 [doi]

2015

2014

Curves in Rd intersecting every hyperplane at most d + 1 timesImre Bárány, Jirí Matousek, Attila Pór. compgeom 2014: 565 [doi]

Computing All Maps into a SphereMartin Cadek, Marek Krcál, Jirí Matousek, Francis Sergeraert, Lukás Vokrínek, Uli Wagner. JACM, 61(3):17, 2014. [doi]

Extendability of Continuous Maps Is UndecidableMartin Cadek, Marek Krcál, Jirí Matousek, Lukás Vokrínek, Uli Wagner. dcg, 51(1):24-66, 2014. [doi]

Polynomial-Time Computation of Homotopy Groups and Postnikov Systems in Fixed DimensionMartin Cadek, Marek Krcál, Jirí Matousek, Lukás Vokrínek, Uli Wagner. SICOMP, 43(5):1728-1780, 2014. [doi]

Lower Bounds on Geometric Ramsey FunctionsMarek Elias, Jirí Matousek, Edgardo Roldán-Pensado, Zuzana Safernová. siamdm, 28(4):1960-1970, 2014. [doi]

Lower bounds on geometric Ramsey functionsMarek Elias, Jirí Matousek, Edgardo Roldán-Pensado, Zuzana Safernová. compgeom 2014: 558 [doi]

Fast lookup for dynamic packet filtering in FPGALukas Kekely, Martin Zádník, Jirí Matousek, Jan Korenek. ddecs 2014: 219-222 [doi]

Near-Optimal Separators in String GraphsJirí Matousek. cpc, 23(1):135-139, 2014. [doi]

On Gromov's Method of Selecting Heavily Covered PointsJirí Matousek, Uli Wagner. dcg, 52(1):1-33, 2014. [doi]

String graphs and separatorsJirí Matousek. In Jirí Matousek, Jaroslav Nesetril, Marco Pellegrini, editors, Geometry, Structure and Randomness in Combinatorics. Volume 18 of Centro di Ricerca Matematica Ennio De Giorgi (CRM) Series, pages 61-97, Springer, 2014. [doi]

Embeddability in the 3-sphere is decidableJirí Matousek, Eric Sedgwick, Martin Tancer, Uli Wagner. compgeom 2014: 78 [doi]

2013

On Range Searching with Semialgebraic Sets. IIPankaj K. Agarwal, Jirí Matousek, Micha Sharir. SICOMP, 42(6):2039-2062, 2013. [doi]

Extending continuous maps: polynomiality and undecidabilityMartin Cadek, Marek Krcál, Jirí Matousek, Lukás Vokrínek, Uli Wagner. stoc 2013: 595-604 [doi]

Polynomial-Time Homology for Simplicial Eilenberg-MacLane SpacesMarek Krcál, Jirí Matousek, Francis Sergeraert. focm, 13(6):935-963, 2013. [doi]

On Lipschitz Mappings Onto a SquareJirí Matousek. In Ronald L. Graham, Jaroslav Nesetril, Steve Butler, editors, The Mathematics of Paul Erdős I. pages 533-540, Springer, 2013. [doi]

Towards hardware architecture for memory efficient IPv4/IPv6 Lookup in 100 Gbps networksJirí Matousek, Martin Skacan, Jan Korenek. ddecs 2013: 108-111 [doi]

Memory efficient IP lookup in 100 GBPS networksJirí Matousek, Martin Skacan, Jan Korenek. fpl 2013: 1-8 [doi]

Untangling Two Systems of Noncrossing CurvesJirí Matousek, Eric Sedgwick, Martin Tancer, Uli Wagner. gd 2013: 472-483 [doi]

2012

On Range Searching with Semialgebraic Sets IIPankaj K. Agarwal, Jirí Matousek, Micha Sharir. focs 2012: 420-429 [doi]

Reachability by paths of bounded curvature in a convex polygonHee-Kap Ahn, Otfried Cheong, Jirí Matousek, Antoine Vigneron. comgeo, 45(1-2):21-32, 2012. [doi]

Vectors in a boxKevin Buchin, Jirí Matousek, Robin A. Moser, Dömötör Pálvölgyi. mp, 135(1-2):323-335, 2012. [doi]

Computing all maps into a sphereMartin Cadek, Marek Krcál, Jirí Matousek, Francis Sergeraert, Lukás Vokrínek, Uli Wagner. soda 2012: 1-10 [doi]

Minimum and maximum against k liesMichael Hoffmann, Jirí Matousek, Yoshio Okamoto, Philipp Zumstein. cjtcs, 2012, 2012. [doi]

Unit Distances in Three DimensionsHaim Kaplan, Jirí Matousek, Zuzana Safernová, Micha Sharir. cpc, 21(4):597-610, 2012. [doi]

Simple Proofs of Classical Theorems in Discrete Geometry via the Guth-Katz Polynomial Partitioning TechniqueHaim Kaplan, Jirí Matousek, Micha Sharir. dcg, 48(3):499-517, 2012. [doi]

A Geometric Proof of the Colored Tverberg TheoremJirí Matousek, Martin Tancer, Uli Wagner. dcg, 47(2):245-265, 2012. [doi]

2011

A Doubly Exponentially Crumbled CakeTobias Christ, Andrea Francke, Heidi Gebauer, Jirí Matousek, Takeaki Uno. endm, 38:265-271, 2011. [doi]

tMichael Hoffmann, Jirí Matousek, Yoshio Okamoto, Philipp Zumstein. combinatorics, 18(1), 2011. [doi]

On the Nonexistence of ::::k::::-reptile TetrahedraJirí Matousek, Zuzana Safernová. dcg, 46(3):599-609, 2011. [doi]

Precise IPv4/IPv6 packet generator based on NetCOPE platformJirí Matousek, Pavol Korcek. ddecs 2011: 319-324 [doi]

2010

2009

Computing D-convex hulls in the planeVojtech Franek, Jirí Matousek. comgeo, 42(1):81-89, 2009. [doi]

Invitation to Discrete Mathematics (2. ed.)Jirí Matousek, Jaroslav Nesetril. Oxford University Press, 2009.

Hardness of embedding simplicial complexes in ::::R:::::::d:::Jirí Matousek, Martin Tancer, Uli Wagner. soda 2009: 855-864 [doi]

2008

Graph Colouring with No Large Monochromatic ComponentsNathan Linial, Jirí Matousek, Or Sheffet, Gábor Tardos. cpc, 17(4):577-589, 2008. [doi]

Inapproximability for Metric Embeddings into R^dJirí Matousek, Anastasios Sidiropoulos. focs 2008: 405-413 [doi]

Large Monochromatic Components in Two-Colored GridsJirí Matousek, Ales Prívetivý. siamdm, 22(1):295-311, 2008. [doi]

On variants of the Johnson-Lindenstrauss lemmaJirí Matousek. rsa, 33(2):142-156, 2008. [doi]

LC reductions yield isomorphic simplicial complexesJirí Matousek. cdm, 3(2), 2008. [doi]

Induced Trees in Triangle-Free GraphsJirí Matousek, Robert Sámal. combinatorics, 15(1), 2008. [doi]

2007

Zone diagrams: existence, uniqueness and algorithmic challengeTetsuo Asano, Jirí Matousek, Takeshi Tokuyama. soda 2007: 756-765 [doi]

Zone Diagrams: Existence, Uniqueness, and Algorithmic ChallengeTetsuo Asano, Jirí Matousek, Takeshi Tokuyama. SICOMP, 37(4):1182-1198, 2007. [doi]

Packing Cones and Their Negatives in SpaceImre Bárány, Jirí Matousek. dcg, 38(2):177-187, 2007. [doi]

Quadratically Many Colorful SimplicesImre Bárány, Jirí Matousek. siamdm, 21(1):191-198, 2007. [doi]

Online Conflict-Free Coloring for IntervalsKe Chen, Amos Fiat, Haim Kaplan, Meital Levy, Jirí Matousek, Elchanan Mossel, János Pach, Micha Sharir, Shakhar Smorodinsky, Uli Wagner, Emo Welzl. SICOMP, 36(5):1342-1359, 2007. [doi]

Graph coloring with no large monochromatic componentsNathan Linial, Jirí Matousek, Or Sheffet, Gábor Tardos. endm, 29:115-122, 2007. [doi]

Large Monochromatic Components in Two-colored GridsJirí Matousek, Ales Prívetivý. endm, 29:3-9, 2007. [doi]

How many points can be reconstructed from k projections?Jirí Matousek, Ales Prívetivý, Petr Skovron. endm, 29:427-434, 2007. [doi]

Removing Degeneracy May Require a Large Dimension IncreaseJirí Matousek, Petr Skovron. toc, 3(1):159-177, 2007. [doi]

Removing degeneracy may require unbounded dimension increaseJirí Matousek, Petr Skovron. endm, 29:107-113, 2007. [doi]

Induced trees in triangle-free graphsJirí Matousek, Robert Sámal. endm, 29:307-313, 2007. [doi]

2006

Segmenting object space by geometric reference structuresPankaj K. Agarwal, David J. Brady, Jirí Matousek. tosn, 2(4):455-465, 2006. [doi]

The distance trisector curveTetsuo Asano, Jirí Matousek, Takeshi Tokuyama. stoc 2006: 336-343 [doi]

Bounded-Degree Graphs have Arbitrarily Large Geometric ThicknessJános Barát, Jirí Matousek, David R. Wood. combinatorics, 13(1), 2006. [doi]

Berge s theorem, fractional Helly, and art galleriesImre Bárány, Jirí Matousek. DM, 306(19-20):2303-2313, 2006. [doi]

Violator Spaces: Structure and AlgorithmsBernd Gärtner, Jirí Matousek, Leo Rüst, Petr Skovron. esa 2006: 387-398 [doi]

The Minimum Independence Number of a Hasse DiagramJirí Matousek, Ales Prívetivý. cpc, 15(3):473-475, 2006. [doi]

The Number Of Unique-Sink Orientations of the Hypercube*Jirí Matousek. combinatorica, 26(1):91-99, 2006. [doi]

k-Sets in Four DimensionsJirí Matousek, Micha Sharir, Shakhar Smorodinsky, Uli Wagner. dcg, 35(2):177-191, 2006. [doi]

2005

2004

The One-Round Voronoi GameOtfried Cheong, Sariel Har-Peled, Nathan Linial, Jirí Matousek. dcg, 31(1):125-138, 2004. [doi]

No Helly Theorem for Stabbing Translates by Lines in R :::3:::Andreas Holmsen, Jirí Matousek. dcg, 31(3):405-410, 2004. [doi]

Expected Length of the Longest Common Subsequence for Large AlphabetsMarcos A. Kiwi, Martin Loebl, Jirí Matousek. latin 2004: 302-311 [doi]

Crossing number, pair-crossing number, and expansionPetr Kolman, Jirí Matousek. JCT, 92(1):99-113, 2004. [doi]

Triangles in random graphsMartin Loebl, Jirí Matousek, Ondrej Pangrác. DM, 289(1-3):181-185, 2004. [doi]

Random Edge Can Be Exponential on Abstract CubesJirí Matousek, Tibor Szabó. focs 2004: 92-100 [doi]

New Constructions of Weak epsilon-NetsJirí Matousek, Uli Wagner. dcg, 32(2):195-206, 2004. [doi]

Nonexistence of 2-Reptile SimplicesJirí Matousek. jcdcg 2005: 151-160 [doi]

Bounded VC-Dimension Implies a Fractional Helly TheoremJirí Matousek. dcg, 31(2):251-255, 2004. [doi]

A Combinatorial Proof of Kneser s ConjectureJirí Matousek. combinatorica, 24(1):163-170, 2004. [doi]

2003

Low-Distortion Embeddings of TreesRobert Babilon, Jirí Matousek, Jana Maxová, Pavel Valtr. jgaa, 7(4):399-409, 2003. [doi]

On restricted min-wise independence of permutationsJirí Matousek, Milos Stojakovic. rsa, 23(4):397-408, 2003. [doi]

A Lower Bound on the Size of Lipschitz Subsets in Dimension 3Jirí Matousek. cpc, 12(4):427-430, 2003.

2002

Separating an object from its castHee-Kap Ahn, Mark de Berg, Prosenjit Bose, Siu-Wing Cheng, Dan Halperin, Jirí Matousek, Otfried Schwarzkopf. cad, 34(8):547-559, 2002. [doi]

Random lifts of graphs: Independence and chromatic numberAlon Amit, Nathan Linial, Jirí Matousek. rsa, 20(1):1-22, 2002.

Equipartition of Two Measures by a 4-FanImre Bárány, Jirí Matousek. dcg, 27(3):293-301, 2002. [doi]

The one-round Voronoi gameOtfried Cheong, Sariel Har-Peled, Nathan Linial, Jirí Matousek. compgeom 2002: 97-101 [doi]

A Lower Bound for Weak epsilon-Nets in High DimensionJirí Matousek. dcg, 28(1):45-48, 2002. [doi]

2001

Random lifts of graphsAlon Amit, Nathan Linial, Jirí Matousek, Eyal Rozenman. soda 2001: 883-894 [doi]

Low-Distortion Embeddings of TreesRobert Babilon, Jirí Matousek, Jana Maxová, Pavel Valtr. gd 2002: 343-351 [doi]

Simultaneous Partitions of Measures by ::::k::::-FansImre Bárány, Jirí Matousek. dcg, 25(3):317-334, 2001. [doi]

On Directional ConvexityJirí Matousek. dcg, 25(3):389-403, 2001. [doi]

Lower bound on the minus-domination numberJirí Matousek. DM, 233(1-3):361-370, 2001. [doi]

Lower Bounds on the Transversal Numbers of ::::d::::-IntervalsJirí Matousek. dcg, 26(3):283-287, 2001. [doi]

Transversals of hypergraphs with geometric flavorJirí Matousek. endm, 10:194-197, 2001. [doi]

All Publications

Filter by Year

[-]
OR AND NOT 1

Filter by Type
OR AND NOT 1

Filter by Tag
OR AND NOT 1

Filter by Venue

[+]
OR AND NOT 1

Filter by Author

[+]
OR AND NOT 1

Filter by Top Terms

[+]
OR AND NOT 1

Researchr

Publications by 'Jirí Matousek'

Viewing Publication 1 - 100 from 197

2018

2017

2015

2014

2013

2012

2011

2010

2009

2008

2007

2006

2005

2004

2003

2002

2001

All Publications

Filter by Year [-]OR AND NOT 1

Filter by TypeOR AND NOT 1

Filter by TagOR AND NOT 1

Filter by Venue [+]OR AND NOT 1

Filter by Author [+]OR AND NOT 1

Filter by Top Terms [+]OR AND NOT 1

Researchr

Publications by 'Jirí Matousek'

Viewing Publication 1 - 100 from 197

2018

2017

2015

2014

2013

2012

2011

2010

2009

2008

2007

2006

2005

2004

2003

2002

2001

Filter by Year

[-]
OR AND NOT 1

Filter by Type
OR AND NOT 1

Filter by Tag
OR AND NOT 1

Filter by Venue

[+]
OR AND NOT 1

Filter by Author

[+]
OR AND NOT 1

Filter by Top Terms

[+]
OR AND NOT 1