Facet browsing currently unavailable
Page 8 of 4077 results
Sort by: relevance publication year
The Hardness of Sampling Connected Subgraphs BOOK CHAPTER published 2020 in LATIN 2020: Theoretical Informatics |
Emerging Behavior as Binary Search Trees Are Symmetrically Updated BOOK CHAPTER published 2000 in Lecture Notes in Computer Science |
A General Approach to Ammann Bars for Aperiodic Tilings BOOK CHAPTER published 2022 in LATIN 2022: Theoretical Informatics |
The CREW PRAM complexity of modular inversion BOOK CHAPTER published 1998 in LATIN'98: Theoretical Informatics |
An Eilenberg theorem for words on countable ordinals BOOK CHAPTER published 1998 in LATIN'98: Theoretical Informatics |
MCSP is Hard for Read-Once Nondeterministic Branching Programs BOOK CHAPTER published 2022 in LATIN 2022: Theoretical Informatics |
Compact Self-Stabilizing Leader Election for General Networks BOOK CHAPTER published 2018 in LATIN 2018: Theoretical Informatics |
Exponential-Time Quantum Algorithms for Graph Coloring Problems BOOK CHAPTER published 2020 in LATIN 2020: Theoretical Informatics |
Submodular Maximization with Uncertain Knapsack Capacity BOOK CHAPTER published 2018 in LATIN 2018: Theoretical Informatics |
Combinatorics of Beacon-Based Routing in Three Dimensions BOOK CHAPTER published 2018 in LATIN 2018: Theoretical Informatics |
On Approximate Colored Path Counting BOOK CHAPTER published 2024 in Lecture Notes in Computer Science |
Recognizable sets of numbers in nonstandard bases BOOK CHAPTER published 1995 in LATIN '95: Theoretical Informatics |
Rank Inequalities for Packing Designs and Sparse Triple Systems BOOK CHAPTER published 2000 in Lecture Notes in Computer Science |
Analyzing Glauber dynamics by comparison of Markov chains BOOK CHAPTER published 1998 in LATIN'98: Theoretical Informatics |
Fundamental structures in Well-Structured infinite Transition Systems BOOK CHAPTER published 1998 in LATIN'98: Theoretical Informatics |
Analysis of the Continued Logarithm Algorithm BOOK CHAPTER published 2018 in LATIN 2018: Theoretical Informatics |
Definability in o-minimal expansions of the real numbers JOURNAL ARTICLE published October 2002 in Electronic Notes in Theoretical Computer Science |
Leafy Spanning Arborescences in DAGs BOOK CHAPTER published 2020 in LATIN 2020: Theoretical Informatics |
Suffix Trees, DAWGs and CDAWGs for Forward and Backward Tries BOOK CHAPTER published 2020 in LATIN 2020: Theoretical Informatics |
Computing and Listing Avoidable Vertices and Paths BOOK CHAPTER published 2022 in LATIN 2022: Theoretical Informatics |