| 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 |
| The Power of Leibniz-Like Functions as Oracles
|
2020 |
Kim, Jaeyoon |
| Optimal Skeleton Huffman Trees Revisited
|
2020 |
Kosolobov, Dmitry |
| On Computing the Hamiltonian Index of Graphs
|
2020 |
Philip, Geevarghese |
| Kernelization of ARC DISJOINT CYCLE PACKING in α-Bounded Digraphs
|
2020 |
Sahu, Abhishek |
| Weighted Rooted Trees: Fat or Tall?
|
2020 |
Wu, Yaokun |
| On Subquadratic Derivational Complexity of Semi-Thue Systems
|
2020 |
Talambutsa, Alexey |
| The Normalized Algorithmic Information Distance Can Not Be Approximated
|
2020 |
Bauwens, Bruno |
Tag hinzufügen