Advanced search    

Search: authors:"Karl Bringmann"

12 papers found.
Use AND, OR, NOT, +word, -word, "long phrase", (parentheses) to fine-tune your search.

Sketching, Streaming, and Fine-Grained Complexity of (Weighted) LCS

of Computer Science , pages 51 - 60 , 2016 . Karl Bringmann . Why Walking the Dog Takes Time: Frechet Distance Has No Strongly Subquadratic Algorithms Unless SETH Fails . In Proc. 55th Annual IEEE ... Symposium on Foundations of Computer Science (FOCS'14) , pages 661 - 670 , 2014 . doi: 10 .1109/FOCS. Karl Bringmann and Marvin K?nnemann . Quadratic Conditional Lower Bounds for String Problems and Dynamic

Efficient Sampling Methods for Discrete Distributions

We study the fundamental problem of the exact and efficient generation of random values from a finite and discrete probability distribution. Suppose that we are given n distinct events with associated probabilities \(p_1, \dots , p_n\). First, we consider the problem of sampling from the distribution where the i-th event has probability proportional to \(p_i\). Second, we study...

Clique-Based Lower Bounds for Parsing Tree-Adjoining Grammars

/LIPIcs.ICALP. 2016 . 81 . Arturs Backurs and Christos Tzamos . Improving Viterbi is hard: Better runtimes imply faster clique algorithms , 2016 . arXiv: 1607 . 04229 . Karl Bringmann , Allan Gr?nlund, and Kasper

Sampling Geometric Inhomogeneous Random Graphs in Linear Time

Real-world networks, like social networks or the internet infrastructure, have structural properties such as large clustering coefficients that can best be described in terms of an underlying geometry. This is why the focus of the literature on theoretical models for real-world networks shifted from classic models without geometry, such as Chung-Lu random graphs, to modern...

On Algebraic Branching Programs of Small Width

In 1979 Valiant showed that the complexity class VP_e of families with polynomially bounded formula size is contained in the class VP_s of families that have algebraic branching programs (ABPs) of polynomially bounded size. Motivated by the problem of separating these classes we study the topological closure VP_e-bar, i.e. the class of polynomials that can be approximated...

Improved Algorithms for Computing the Cycle of Minimum Cost-to-Time Ratio in Directed Graphs

We study the problem of finding the cycle of minimum cost-to-time ratio in a directed graph with n nodes and m edges. This problem has a long history in combinatorial optimization and has recently seen interesting applications in the context of quantitative verification. We focus on strongly polynomial algorithms to cover the use-case where the weights are relatively large...

Maximum Volume Subset Selection for Anchored Boxes

Let B be a set of n axis-parallel boxes in d-dimensions such that each box has a corner at the origin and the other corner in the positive quadrant, and let k be a positive integer. We study the problem of selecting k boxes in B that maximize the volume of the union of the selected boxes. The research is motivated by applications in skyline queries for databases and in...

Hitting Set for Hypergraphs of Low VC-dimension

We study the complexity of the Hitting Set problem in set systems (hypergraphs) that avoid certain sub-structures. In particular, we characterize the classical and parameterized complexity of the problem when the Vapnik-Chervonenkis dimension (VC-dimension) of the input is small. VC-dimension is a natural measure of complexity of set systems. Several tractable instances of...

Approximability of the Discrete Fr\'echet Distance

S o C G ' Approximability of the Discrete Fréchet Distance Karl Bringmann 0 Wolfgang Mulzer 0 0 Institute of Theoretical Computer Science, ETH Zurich, Switzerland Institut für Informatik, Freie ... between two polygonal curves . Internat. J. Comput. Geom. Appl. , 5 ( 1 -2): 78 - 99 , 1995 . Karl Bringmann . Why walking the dog takes time: Fréchet distance has no strongly subquadratic algorithms unless

Approximability of the Discrete Fr\'echet Distance

S o C G ' Approximability of the Discrete Fr?chet Distance Karl Bringmann 0 Wolfgang Mulzer 0 0 Institute of Theoretical Computer Science, ETH Zurich, Switzerland Institut fu?r Informatik, Freie ... polygonal curves . Internat. J. Comput. Geom. Appl. , 5 ( 1 -2): 78 - 99 , 1995 . Karl Bringmann . Why walking the dog takes time: Fr?chet distance has no strongly subquadratic algorithms unless SETH fails

Approximability of the Discrete Fr\'echet Distance

S o C G ' Approximability of the Discrete Fr?chet Distance Karl Bringmann 0 Wolfgang Mulzer 0 0 Institute of Theoretical Computer Science, ETH Zurich, Switzerland Institut fu?r Informatik, Freie ... polygonal curves . Internat. J. Comput. Geom. Appl. , 5 ( 1 -2): 78 - 99 , 1995 . Karl Bringmann . Why walking the dog takes time: Fr?chet distance has no strongly subquadratic algorithms unless SETH fails

Balls into bins via local search: cover time and maximum load

Subject Classification G.3 Mathematics of Computing: Probability and Statistics ? Karl Bringmann is a recipient of the Google Europe Fellowship in Randomized Algorithms, and this research is supported in