The Normalized Algorithmic Information Distance Can Not Be Approximated
|
2020 |
Bauwens, Bruno |
On Embeddability of Unit Disk Graphs onto Straight Lines
|
2020 |
Çağırıcı, Onur |
Nested Regular Expressions Can Be Compiled to Small Deterministic Nested Word Automata
|
2020 |
Boneva, lovka |
Computational Hardness of Multidimensional Subtraction Games
|
2020 |
Gurvich, Vladimir |
A Lower Bound for the Query Phase of Contraction Hierarchies and Hub Labels
|
2020 |
Rupp, Tobias |
The Untold Story of SBP
|
2020 |
Volkovich, Ilya |
Groupoid Action and Rearrangement Problem of Bicolor Arrays by Prefix Reversals
|
2020 |
Yamamura, Akihiro |
Quantum Hashing and Fingerprinting for Quantum Cryptography and Computations
|
2020 |
Ablayev, Farid |
Second-Order Finite Automata
|
2020 |
Melo, Alexsander Andrade de |
Definable Subsets of Polynomial-Time Algebraic Structures
|
2020 |
Bazhenov, Nikolay |
Families of Monotonic Trees: Combinatorial Enumeration and Asymptotics
|
2020 |
Bodini, Olivier |
On the Decision Tree Complexity of Threshold Functions
|
2020 |
Chistopolskaya, Anastasiya |
On the Transformation of LL(k)-linear Grammars to LL(1)-linear
|
2020 |
Okhotin, Alexander |
The Complexity of Controlling Condorcet, Fallback, and k-Veto Elections by Replacing Candidates or Voters
|
2020 |
Neveling, Marc |
The subtrace order and counting first-order logic
|
2020 |
Kuske, Dietrich |
Central Positions in Social Networks
|
2020 |
Brandes, Ulrik |
Isomorphic Distances Among Elections
|
2020 |
Faliszewski, Piotr |
Tandem Duplications, Segmental Duplications and Deletions, and Their Applications
|
2020 |
Zhu, Binhai |
Faster 2-Disjoint-Shortest-Paths Algorithm
|
2020 |
Akhmedov, Maxim |
Randomized and Symmetric Catalytic Computation
|
2020 |
Datta, Samir |