:: Library Catalog

Imagen de Portada

Guardado en:

Detalles Bibliográficos
Autores principales:	Bellamkonda, Anjan, Bharani, Laksh, Selvam, Harivatsan
Formato:	Preprint
Publicado:	2025
Materias:	Programming Languages Data Structures and Algorithms
Acceso en línea:	https://arxiv.org/abs/2504.04302
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

A Coalgebraic Dijkstra Algorithm
por: Sanada, Takahiro, et al.
Publicado: (2026)

Efficient Dynamic Algorithms to Predict Short Races
por: Zhang, Minjian, et al.
Publicado: (2026)

Simpler Universally Optimal Dijkstra
por: van der Hoog, Ivor, et al.
Publicado: (2025)

Exploring Monotone Priority Queues for Dijkstra Optimization
por: Costa, Jonas, et al.
Publicado: (2024)

Near-Optimal Heaps and Dijkstra on Pointer Machines
por: van der Hoog, Ivor, et al.
Publicado: (2026)

Generic Dijkstra
por: Szcześniak, Ireneusz, et al.
Publicado: (2022)

A Note on Dynamic Bidirected Dyck-Reachability with Cycles
por: Zhang, Qirun
Publicado: (2024)

Optimizations and extensions for fair join pattern matching
por: Karras, Ioannis
Publicado: (2025)

Towards Efficient Hash Maps in Functional Array Languages
por: Due, William Henrich, et al.
Publicado: (2025)

Implementing Binary Search Trees in GP 2 (Extended Abstract)
por: Alaoui, Ziad Ismaili, et al.
Publicado: (2026)

Diagram Control and Model Order for Sugiyama Layouts
por: Domrös, Sören, et al.
Publicado: (2024)

Parsing Millions of URLs per Second
por: Nizipli, Yagiz, et al.
Publicado: (2023)

Bidirectional Dijkstra's Algorithm is Instance-Optimal
por: Haeupler, Bernhard, et al.
Publicado: (2024)

Adapting Dijkstra for Buffers and Unlimited Transfers
por: Katkalo, Denys, et al.
Publicado: (2026)

Declarative Concurrent Data Structures
por: Raza, Aun, et al.
Publicado: (2024)

Amortized Analysis via Coalgebra
por: Grodin, Harrison, et al.
Publicado: (2024)

Redefining Lexicographical Ordering: Optimizing Pauli String Decompositions for Quantum Compiling
por: Huang, Qunsheng, et al.
Publicado: (2024)

High-level quantum algorithm programming using Silq
por: Bezganovic, Viktorija, et al.
Publicado: (2024)

Deep Learning and Machine Learning -- Python Data Structures and Mathematics Fundamental: From Theory to Practice
por: Chen, Silin, et al.
Publicado: (2024)

Quantum Backtracking in Qrisp Applied to Sudoku Problems
por: Seidel, Raphael, et al.
Publicado: (2024)

InfTDA: A Simple TopDown Mechanism for Hierarchical Differentially Private Counting Queries
por: Boninsegna, Fabrizio
Publicado: (2025)

A Faster Deterministic Algorithm for Kidney Exchange via Representative Set
por: Tian, Kangyi, et al.
Publicado: (2026)

A bargain for mergesorts -- How to prove your mergesort correct and stable, almost for free
por: Cohen, Cyril, et al.
Publicado: (2024)

Corecursive Coding of High Computational Derivatives and Power Series
por: Karczmarczuk, Jerzy
Publicado: (2025)

Verified Purely Functional Catenable Real-Time Deques
por: Viennot, Jules, et al.
Publicado: (2025)

Automated Expected Amortised Cost Analysis of Probabilistic Data Structures
por: Leutgeb, Lorenz, et al.
Publicado: (2022)

Outperforming Dijkstra on Sparse Graphs: The Lightning Network Use Case
por: Valko, Danila, et al.
Publicado: (2025)

A Fast Algorithm for Computing Prefix Probabilities
por: Nowak, Franz, et al.
Publicado: (2023)

A faster FPRAS for #NFA
por: Meel, Kuldeep S., et al.
Publicado: (2023)

Enabling AI ASICs for Zero Knowledge Proof
por: Tong, Jianming, et al.
Publicado: (2026)

Boundaried Kernelization via Representative Sets
por: Antipov, Leonid, et al.
Publicado: (2025)

Fair Diversity Maximization with Few Representatives
por: Adriaens, Florian, et al.
Publicado: (2025)

Multiway Cuts with a Choice of Representatives
por: Bérczi, Kristóf, et al.
Publicado: (2024)

Algorithmically Establishing Trust in Evaluators
por: de Wynter, Adrian
Publicado: (2025)

Universal Optimality of Dijkstra via Beyond-Worst-Case Heaps
por: Haeupler, Bernhard, et al.
Publicado: (2023)

Algorithmical Aspects of Some Bio Inspired Operations
por: Dumitran, Marius
Publicado: (2025)

Safe Memory Reclamation Techniques
por: Singh, Ajay
Publicado: (2025)

Efficient Decrease-and-Conquer Linearizability Monitoring
por: Han, Lee Zheng, et al.
Publicado: (2024)

Flashback: A Reversible Bilateral Run-Peeling Decomposition of Strings
por: Konstantinovsky, Thomas, et al.
Publicado: (2026)

Neuro-symbolic Syntactic Parsing: Shaping a Neural Network with the CYK Algorithm
por: Zanzotto, Fabio Massimo, et al.
Publicado: (2026)