| Algorithms that Access the Input via Queries
|
2021 |
Erlebach, Thomas |
| Asymptotic Approximation by Regular Languages
|
2021 |
Sin’ya, Ryoma |
| Using the Metro-Map Metaphor for Drawing Hypergraphs
|
2021 |
Frank, Fabian |
| Clusters of Repetition Roots: Single Chains
|
2021 |
Fazekas, Szilárd Zsolt |
| Web Test Automation: Insights from the Grey Literature
|
2021 |
Ricca, Filippo |
| Metadata Management on Data Processing in Data Lakes
|
2021 |
Megdiche, Imen |
| Sorting by Multi-cut Rearrangements
|
2021 |
Bulteau, Laurent |
| Graphs Cannot Be Indexed in Polynomial Time for Sub-quadratic Time String Matching, Unless SETH Fails
|
2021 |
Equi, Massimo |
| Invited Talk: Resilient Distributed Algorithms
|
2021 |
Parter, Merav |
| Bike Assisted Evacuation on a Line
|
2021 |
Jawhar, Khaled |
| Concatenation Operations and Restricted Variants of Two-Dimensional Automata
|
2021 |
Smith, Taylor J. |
| Distance Hedonic Games
|
2021 |
Flammini, Michele |
| Iterated Uniform Finite-State Transducers on Unary Languages
|
2021 |
Kutrib, Martin |
| Hierarchical b-Matching
|
2021 |
Emek, Yuval |
| New Bounds on the Half-Duplex Communication Complexity
|
2021 |
Dementiev, Yuriy |
| On the Redundancy of D-Ary Fano Codes
|
2021 |
Cicalese, Ferdinando |
| Parameterized Complexity of d-Hitting Set with Quotas
|
2021 |
Gupta, Sushmita |
| On the Terminal Connection Problem
|
2021 |
Melo, Alexsander A. de |
| Tightness of Sensitivity and Proximity Bounds for Integer Linear Programs
|
2021 |
Berndt, Sebastian |
| A Normal Sequence Compressed by PPM* But Not by Lempel-Ziv 78
|
2021 |
Jordon, Liam |
Tag hinzufügen