Imagen de Portada

Eliminating Left Recursion without the Epsilon

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Smith, James
Formato:	Preprint
Publicado:	2019
Materias:	Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Fast Pattern Matching with Epsilon Transitions
por: Cotumaccio, Nicola
Publicado: (2025)

On Fair Epsilon Net and Geometric Hitting Set
por: Dehghankar, Mohsen, et al.
Publicado: (2025)

HENN: A Hierarchical Epsilon Net Navigation Graph for Approximate Nearest Neighbor Search
por: Dehghankar, Mohsen, et al.
Publicado: (2025)

A Comprehensive Evaluation of Vertex Elimination Algorithms for Algorithmic Differentiation
por: Crane, Alex, et al.
Publicado: (2026)

Relating Left and Right Extensions of Maximal Repeats
por: Inenaga, Shunsuke, et al.
Publicado: (2024)

A Simple Average-case Analysis of Recursive Randomized Greedy MIS
por: Dalirrooyfard, Mina, et al.
Publicado: (2026)

Recursive lattice reduction -- A framework for finding short lattice vectors
por: Aggarwal, Divesh, et al.
Publicado: (2023)

Recursive and iterative approaches to generate rotation Gray codes for stamp foldings and semi-meanders
por: Liu, Bowie, et al.
Publicado: (2024)

Epsilon*: Privacy Metric for Machine Learning Models
por: Negoescu, Diana M., et al.
Publicado: (2023)

Complexity Classes for Online Problems with and without Predictions
por: Berg, Magnus, et al.
Publicado: (2024)

Data reduction for directed feedback vertex set on graphs without long induced cycles
por: Dirks, Jona, et al.
Publicado: (2023)

Multidimensional Quantum Walks, Recursion, and Quantum Divide & Conquer
por: Jeffery, Stacey, et al.
Publicado: (2024)

Graded Projection Recursion (GPR): Corrections, Obstructions, and Conservative Approximate Matrix Multiplication
por: Uhlmann, Jeffrey
Publicado: (2025)

Structural Optimal Jacobian Accumulation and Minimum Edge Count are NP-Complete Under Vertex Elimination
por: Bentert, Matthias, et al.
Publicado: (2025)

Erdős-Gyárfás conjecture on graphs without long induced paths
por: Hegde, Anand Shripad, et al.
Publicado: (2024)

Privately Evaluating Untrusted Black-Box Functions
por: Linder, Ephraim, et al.
Publicado: (2025)

Actively Learning Halfspaces without Synthetic Data
por: Black, Hadley, et al.
Publicado: (2025)

A Sierpinski Triangle Data Structure for Efficient Array Value Update and Prefix Sum Calculation
por: Harrison, Brent, et al.
Publicado: (2024)

From Incremental Transitive Cover to Strongly Polynomial Maximum Flow
por: Dadush, Daniel, et al.
Publicado: (2025)

Low depth amplitude estimation without really trying
por: Vu, Dinh-Long, et al.
Publicado: (2024)

The Power of Recursive Embeddings for $\ell_p$ Metrics
por: Krauthgamer, Robert, et al.
Publicado: (2025)

Heisenberg-limited Hamiltonian learning without short-time control
por: Shin, Myeongjin, et al.
Publicado: (2026)

Space-Efficient Quantum Error Reduction without log Factors
por: Belovs, Aleksandrs, et al.
Publicado: (2025)

Recursive Modified Pattern Search on High-dimensional Simplex : A Blackbox Optimization Technique
por: Das, Priyam
Publicado: (2016)

Coreset for Robust Geometric Median: Eliminating Size Dependency on Outliers
por: Fang, Ziyi, et al.
Publicado: (2025)

Robustifying Learning-Augmented Caching Efficiently without Compromising 1-Consistency
por: Chen, Peng, et al.
Publicado: (2025)

Self-referential instances of the dominating set problem are irreducible
por: Zhou, Guangyan
Publicado: (2026)

Finding perfect matchings in bridgeless cubic multigraphs without dynamic (2-)connectivity
por: Gawrychowski, Paweł, et al.
Publicado: (2024)

Quantum singular value transformation without block encodings: Near-optimal complexity with minimal ancilla
por: Chakraborty, Shantanav, et al.
Publicado: (2025)

Round Elimination via Self-Reduction: Closing Gaps for Distributed Maximal Matching
por: Khoury, Seri, et al.
Publicado: (2025)

New Distributed Interactive Proofs for Planarity: A Matter of Left and Right
por: Gil, Yuval, et al.
Publicado: (2025)

Time-Aware Projections: Truly Node-Private Graph Statistics under Continual Observation
por: Jain, Palak, et al.
Publicado: (2024)

Deep Learning Service for Efficient Data Distribution Aware Sorting
por: Zhu, Xiaoke, et al.
Publicado: (2019)

Online Computation with Untrusted Advice
por: Angelopoulos, Spyros, et al.
Publicado: (2019)

Composing dynamic programming tree-decomposition-based algorithms
por: Baste, Julien
Publicado: (2019)

Analysis of Two-variable Recurrence Relations with Application to Parameterized Approximations
por: Kulik, Ariel, et al.
Publicado: (2019)

The self-concordant perceptron is efficient on a sub-family feasibility instances
por: Chan-Hon-Tong, Adrien
Publicado: (2019)

Waiting is not easy but worth it: the online TSP on the line revisited
por: Chen, Pei-Chuan, et al.
Publicado: (2019)

The Competitive Ratio of Threshold Policies for Online Unit-density Knapsack Problems
por: Ma, Will, et al.
Publicado: (2019)

Graph and String Parameters: Connections Between Pathwidth, Cutwidth and the Locality Number
por: Casel, Katrin, et al.
Publicado: (2019)