44 citations · 279 across the 33 of their papers we have counts for
40 papers
Deep Packet Inspection in FPGAs via Approximate Nondeterministic Automata
Milan Češka, Vojtěch Havlena, Lukáš Holík +6
Deep packet inspection via regular expression (RE) matching is a crucial task of network intrusion detection systems (IDSes), which secure Internet connection against attacks and s…
Using Brouwer's fixed point theorem
Anders Björner, Jiří Matoušek, Günter M. Ziegler
Brouwer's fixed point theorem from 1911 is a basic result in topology - with a wealth of combinatorial and geometric consequences. In these lecture notes we present some of them, r…
Factorization Norms and Hereditary Discrepancy
Jiri Matousek, Aleksandar Nikolov, Kunal Talwar
The norm of a real matrix is the minimum number such that the column vectors of are contained in a -centered ellipsoid whi…
Multilevel polynomial partitions and simplified range searching
Jiri Matousek, Zuzana Patakova
The polynomial partitioning method of Guth and Katz [arXiv:1011.4105] has numerous applications in discrete and computational geometry. It partitions a given -point set $P\subse…
Three-monotone interpolation
Josef Cibulka, Jiří Matoušek, Pavel Paták
A function is called \emph{-monotone} if it is -times differentiable and its nd derivative is convex. A point set $P\subset\mathbb R…
Embeddability in the 3-sphere is decidable
Jiří Matoušek, Eric Sedgwick, Martin Tancer +1
We show that the following algorithmic problem is decidable: given a -dimensional simplicial complex, can it be embedded (topologically, or equivalently, piecewise linearly) in…