| Piercing Pairwise Intersecting Convex Shapes in the Plane
|
2022 |
Bazargani, Saman |
| Bounds on Oblivious Multiparty Quantum Communication Complexity
|
2022 |
Le Gall, François |
| MCSP is Hard for Read-Once Nondeterministic Branching Programs
|
2022 |
Glinskih, Ludmila |
| A General Approach to Ammann Bars for Aperiodic Tilings
|
2022 |
Porrier, Carole |
| On the Zombie Number of Various Graph Classes
|
2022 |
Bose, Prosenjit |
| Patterns in Ordered (random) Matchings
|
2022 |
Dudek, Andrzej |
| Embedding Arbitrary Boolean Circuits into Fungal Automata
|
2022 |
Modanese, Augusto |
| Conelikes and Ranker Comparisons
|
2022 |
Henriksson, Viktor |
| Multidimensional Manhattan Preferences
|
2022 |
Chen, Jiehua |
| On the Subfield Codes of a Subclass of Optimal Cyclic Codes and Their Covering Structures
|
2022 |
Hernández, Félix |
| On APN Functions Whose Graphs are Maximal Sidon Sets
|
2022 |
Carlet, Claude |
| Theoretical Analysis of git bisect
|
2022 |
Courtiel, Julien |
| Klee’s Measure Problem Made Oblivious
|
2022 |
Thießen, Thore |
| Elastic-Degenerate String Matching with 1 Error
|
2022 |
Bernardini, Giulia |
| Cutting a Tree with Subgraph Complementation is Hard, Except for Some Small Trees
|
2022 |
Antony, Dhanyamol |
| A Combinatorial Link Between Labelled Graphs and Increasingly Labelled Schröder Trees
|
2022 |
Bodini, Olivier |
| How Many Times Do You Need to Go Back to the Future in Unary Temporal Logic?
|
2022 |
Place, Thomas |
| String Attractors and Infinite Words
|
2022 |
Restivo, Antonio |
| The Net Automaton of a Rational Expression
|
2022 |
Lombardy, Sylvain |
| Approximation Schemes for Packing Problems with [ell _p]-norm Diversity Constraints
|
2022 |
Gálvez, Waldo |
Tag hinzufügen