Forschungspapier (75)
421.
Forschungspapier
Tree Edit Distance Cannot be Computed in Strongly Subcubic Time (unless APSP can). (2017), 25 S.
422.
Forschungspapier
On Algebraic Branching Programs of Small Width. (2017), 30 S.
423.
Forschungspapier
A Note on Hardness of Diameter Approximation. (2017), 11 S.
424.
Forschungspapier
Causal Inference by Stochastic Complexity. (2017), 15 S.
425.
Forschungspapier
Practical Distance Functions for Path-Planning in Planar Domains. (2017), 20 S.
426.
Forschungspapier
Path Planning with Divergence-Based Distance Functions. (2017), 16 S.
427.
Forschungspapier
Triaging Content Severity in Online Mental Health Forums. (2017), 19 S.
428.
Forschungspapier
Tight Conditional Lower Bounds for Longest Common Increasing Subsequence. (2017), 18 S.
429.
Forschungspapier
Symbolic Versus Numerical Computation and Visualization of Parameter Regions for Multistationarity of Biological Networks. (2017), 15 S.
430.
Forschungspapier
Faster and Simpler Distributed Algorithms for Testing and Correcting Graph Properties in the CONGEST-Model. (2017), 14 S.
431.
Forschungspapier
Subtropical Satisfiability. (2017), 17 S.
432.
Forschungspapier
Content-aware Traffic Engineering. (2017), 14 S.
433.
Forschungspapier
Approximating the Nash Social Welfare with Budget-Additive Valuations. (2017), 22 S.
434.
Forschungspapier
Combinatorial Secretary Problems with Ordinal Information. (2017), 16 S.
435.
Forschungspapier
The Universal Fragment of Presburger Arithmetic with Unary Uninterpreted Predicates is Undecidable. (2017), 22 S.
436.
Forschungspapier
On the Combination of the Bernays-Schönfinkel-Ramsey Fragment with Simple Linear Integer Arithmetic. (2017), 29 S.
437.
Forschungspapier
PACRR: A Position-Aware Neural IR Model for Relevance Matching. (2017), 10 S.
438.
Forschungspapier
RE-PACRR: A Context and Density-Aware Neural Information Retrieval Model. (2017), 8 S.
439.
Forschungspapier
Strassen's 2x2 Matrix Multiplication Algorithm: A Conceptual Perspective. (2017), 5 pages S.
440.
Forschungspapier
On the Complexity of Hazard-free Circuits. (2017), 21 S.