| Dynamically Optimal Self-adjusting Single-Source Tree Networks
|
2020 |
Avin, Chen |
| Tight Bounds on Sensitivity and Block Sensitivity of Some Classes of Transitive Functions
|
2020 |
Chaubal, Siddhesh |
| On Symmetry and Initialization for Neural Networks
|
2020 |
Nachum, Ido |
| Lower Bounds for Max-Cut via Semidefinite Programming
|
2020 |
Carlson, Charles |
| On Minimal-Perimeter Lattice Animals
|
2020 |
Barequet, Gill |
| A Method to Prove the Nonrationality of Some Combinatorial Generating Functions
|
2020 |
Bóna, Miklós |
| On Some Subclasses of Split B1-EPG Graphs
|
2020 |
Deniz, Zakir |
| 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 |
Tag hinzufügen