| 2025 | FPL | Connection Tracking at 400 Gbps. | David Vodk, Oliver Gurka, Jir Matousek, Daniel Kondys |
| 2023 | ISCC | Accelerating IDS Using TLS Pre-Filter in FPGA. | Vlastimil Kosar, Luks Sismis, Jir Matousek, Jan Korenek |
| 2021 | ISCC | Scalability of Hash-Based Pattern Matching for High-Speed Network Security and Monitoring. | Toms Fukac, Jan Korenek, Jir Matousek |
| 2020 | LCN | Increasing Throughput of Intrusion Detection Systems by Hash-Based Short String Pre-filter. | Toms Fukac, Vlastimil Kosar, Jan Korenek, Jir Matousek |
| 2019 | FCCM | Deep Packet Inspection in FPGAs via Approximate Nondeterministic Automata. | Milan Ceska, Vojtech Havlena, Luks Holk, Jan Korenek, Ondrej Lengl, Denis Matousek, Jir Matousek, Jakub Semric, Toms Vojnar |
| 2018 | FCCM | High-Speed Regular Expression Matching with Pipelined Memory-Based Automata. | Denis Matousek, Jir Matousek, Jan Korenek |
| 2017 | DDECS | A novel architecture for LZSS compression of configuration bitstreams within FPGA. | Radek Isa, Jir Matousek |
| 2014 | DDECS | Fast lookup for dynamic packet filtering in FPGA. | Lukas Kekely, Martin Zdnk, Jir Matousek, Jan Korenek |
| 2013 | DDECS | Towards hardware architecture for memory efficient IPv4/IPv6 Lookup in 100 Gbps networks. | Jir Matousek, Martin Skacan, Jan Korenek |
| 2013 | FPL | Memory efficient IP lookup in 100 GBPS networks. | Jir Matousek, Martin Skacan, Jan Korenek |
| 2013 | GD | Untangling Two Systems of Noncrossing Curves. | Jir Matousek, Eric Sedgwick, Martin Tancer, Uli Wagner |
| 2013 | STOC | Extending continuous maps: polynomiality and undecidability. | Martin Cadek, Marek Krcl, Jir Matousek, Luks Vokrnek, Uli Wagner |
| 2012 | FOCS | On Range Searching with Semialgebraic Sets II. | Pankaj K. Agarwal, Jir Matousek, Micha Sharir |
| 2012 | SODA | Computing all maps into a sphere. | Martin Cadek, Marek Krcl, Jir Matousek, Francis Sergeraert, Luks Vokrnek, Uli Wagner |
| 2011 | DDECS | Precise IPv4/IPv6 packet generator based on NetCOPE platform. | Jir Matousek, Pavol Korcek |
| 2009 | SODA | Hardness of embedding simplicial complexes in | Jir Matousek, Martin Tancer, Uli Wagner |
| 2008 | FOCS | Inapproximability for Metric Embeddings into R^d. | Jir Matousek, Anastasios Sidiropoulos |
| 2007 | SODA | Zone diagrams: existence, uniqueness and algorithmic challenge. | Tetsuo Asano, Jir Matousek, Takeshi Tokuyama |
| 2006 | ESA | Violator Spaces: Structure and Algorithms. | Bernd Grtner, Jir Matousek, Leo Rst, Petr Skovron |
| 2006 | STOC | The distance trisector curve. | Tetsuo Asano, Jir Matousek, Takeshi Tokuyama |
| 2005 | SODA | Online conflict-free coloring for intervals. | Amos Fiat, Meital Levy, Jir Matousek, Elchanan Mossel, Jnos Pach, Micha Sharir, Shakhar Smorodinsky, Uli Wagner, Emo Welzl |
| 2005 | STOC | Towards asymptotic optimality in probabilistic packet marking. | Micah Adler, Jeff Edmonds, Jir Matousek |
| 2004 | FOCS | Random Edge Can Be Exponential on Abstract Cubes. | Jir Matousek, Tibor Szab |
| 2004 | LATIN | Expected Length of the Longest Common Subsequence for Large Alphabets. | Marcos A. Kiwi, Martin Loebl, Jir Matousek |
| 2001 | GD | Low-Distortion Embeddings of Trees. | Robert Babilon, Jir Matousek, Jana Maxov, Pavel Valtr |
| 2001 | SODA | Random lifts of graphs. | Alon Amit, Nathan Linial, Jir Matousek, Eyal Rozenman |
| 1999 | GD | The Anatomy of a Geometric Algorithm. | Jir Matousek |
| 1998 | FOCS | Geometric Computation and the Art of Sampling. | Jir Matousek |
| 1993 | FOCS | Product Range Spaces, Sensitive Sampling, and Derandomization | Herv Brnnimann, Bernard Chazelle, Jir Matousek |
| 1993 | SODA | On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed Dimensions. | Bernard Chazelle, Jir Matousek |
| 1993 | SODA | Efficient Randomized Algorithms for the Repeated Median Line Estimator. | Jir Matousek, David M. Mount, Nathan S. Netanyahu |
| 1993 | STOC | Piecewise linear paths among convex obstacles. | Mark de Berg, Jir Matousek, Otfried Schwarzkopf |
| 1993 | STOC | A deterministic algorithm for the three-dimensional diameter problem. | Jir Matousek, Otfried Schwarzkopf |
| 1992 | FOCS | Dynamic Half-Space Reporting, Geometric Optimization, and Minimum Spanning Trees | Pankaj K. Agarwal, David Eppstein, Jir Matousek |
| 1992 | ICALP | A Tail Estimate for Mulmuley's Segment Intersection Algorithm. | Jir Matousek, Raimund Seidel |
| 1992 | MFCS | On Range Searching with Semialgebraic Sets. | Pankaj K. Agarwal, Jir Matousek |
| 1992 | SODA | Relative Neighborhood Graphs in Three Dimensions. | Pankaj K. Agarwal, Jir Matousek |
| 1992 | STOC | Ray Shooting and Parametric Search | Pankaj K. Agarwal, Jir Matousek |
| 1992 | STOC | Ham-Sandwich Cuts in R^d | Chi-Yuan Lo, Jir Matousek, William L. Steiger |
| 1991 | FOCS | Reporting Points in Halfspaces | Jir Matousek |
| 1991 | FOCS | Fat Triangles Determine Linearly Many Holes | Jir Matousek, Nathaly Miller, Jnos Pach, Micha Sharir, Shmuel Sifrony, Emo Welzl |
| 1991 | FOCS | Discrepancy and epsilon-approximations for bounded VC-dimension | Jir Matousek, Emo Welzl, Lorenz Wernisch |
| 1991 | STOC | Approximations and Optimal Geometric Divide-And-Conquer | Jir Matousek |
| 1991 | WADS | Farthest Neighbours, Maximum Spanning Trees and Related Problems in Higher Dimensions. | Pankaj K. Agarwal, Jir Matousek, Subhash Suri |