| Near-Linear Time Algorithm for Approximate Minimum Degree Spanning Trees
|
2020 |
Duan, Ran |
| Maximizing Happiness in Graphs of Bounded Clique-Width
|
2020 |
Bliznets, Ivan |
| Batched Predecessor and Sorting with Size-Priced Information in External Memory
|
2020 |
Bender, Michael A. |
| An Ω(n3) Lower Bound on the Number of Cell Crossings for Weighted Shortest Paths in 3-Dimensional Polyhedral Structures
|
2020 |
Bauernöppel, Frank |
| Rectilinear Convex Hull of Points in 3D
|
2020 |
Pérez-Lantero, Pablo |
| Tractable Unordered 3-CNF Games
|
2020 |
Rahman, Lutfar |
| Exponential-Time Quantum Algorithms for Graph Coloring Problems
|
2020 |
Shimizu, Kazuya |
| How to Color a French Flag: Biologically Inspired Algorithms for Scale-Invariant Patterning
|
2020 |
Ancona, Bertie |
| Lower Bounds for Testing Complete Positivity and Quantum Separability
|
2020 |
Bădescu, Costin |
| Asymptotics for Push on the Complete Graph
|
2020 |
Daknama, Rami |
| Simple Intrinsic Simulation of Cellular Automata in Oritatami Molecular Folding Model
|
2020 |
Pchelina, Daria |
| Transmitting once to Elect a Leader on Wireless Networks
|
2020 |
Andriambolamalala, Ny Aina |
| Quasi-Random Words and Limits of Word Sequences
|
2020 |
Hàn, Hiệp |
| Thresholds in the Lattice of Subspaces of F n q
|
2020 |
Rossman, Benjamin |
| Improved Upper Bounds on the Growth Constants of Polyominoes and Polycubes
|
2020 |
Barequet, Gill |
| Approximation Algorithms for Cost-Robust Discrete Minimization Problems Based on Their LP-Relaxations
|
2020 |
Elbassioni, Khaled |
| Probabilistically Faulty Searching on a Half-Line: (Extended Abstract)
|
2020 |
Bonato, Anthony |
| Query Minimization Under Stochastic Uncertainty
|
2020 |
Chaplick, Steven |
| Suffix Trees, DAWGs and CDAWGs for Forward and Backward Tries
|
2020 |
Inenaga, Shunsuke |
| Towards a Definitive Measure of Repetitiveness
|
2020 |
Kociumaka, Tomasz |
Tag hinzufügen