🏛️ The Data Structures & Algorithms Crypt

R.I.P. 👻 Ghosted

Sorting Lists with Equal Keys Using Mergesort in Linear Time

Albert Tedja

cs.DS 🏛 arXiv 📚 0 cites 5 years ago

R.I.P. 👻 Ghosted

Instance Optimal Join Size Estimation

Mahmoud Abo-Khamis, Sungjin Im, ... (+3 more)

cs.DS 🏛 Latin-American Algorithms, Graphs and Optimization Symposium 📚 0 cites 5 years ago

R.I.P. 👻 Ghosted

Uniform Capacitated Facility Location Problems with Penalties/Outliers

Rajni Dabas, Neelima Gupta

cs.DS 🏛 arXiv 📚 0 cites 5 years ago

R.I.P. 👻 Ghosted

Matrix Multiplication and Binary Space Partitioning Trees : An Exploration

CNP Slagle, Lance Fortnow

cs.DS 🏛 arXiv 📚 0 cites 5 years ago

R.I.P. 👻 Ghosted

r-Gathering Problems on Spiders:Hardness, FPT Algorithms, and PTASes

Soh Kumabe, Takanori Maehara

cs.DS 🏛 ICAC W 📚 0 cites 5 years ago

R.I.P. 👻 Ghosted

Huskysort

R. C. Hillyard, Yunlu Liaozheng, Sai Vineeth K. R

cs.DS 🏛 arXiv 📚 0 cites 5 years ago

R.I.P. 👻 Ghosted

Windowed Prophet Inequalities

William Marshall, Nolan Miranda, Albert Zuo

cs.DS 🏛 arXiv 📚 0 cites 5 years ago

R.I.P. 👻 Ghosted

Near-Optimal Algorithms for Reachability, Strongly-Connected Components and Shortest Paths in Partially Dynamic Digraphs

Maximilian Probst Gutenberg

cs.DS 🏛 arXiv 📚 0 cites 5 years ago

R.I.P. 👻 Ghosted

Solving the r-pseudoforest Deletion Problem in Time Independent of r

Bin Sheng

cs.DS 🏛 arXiv 📚 0 cites 5 years ago

R.I.P. 👻 Ghosted

Analysis of the Harmonic Function Used in Bin-Packing

Eklavya Sharma

cs.DS 🏛 arXiv 📚 0 cites 5 years ago

R.I.P. 👻 Ghosted

Illustrating the Suitability of Greedy and Dynamic Algorithms Using The Economics Concept of "Opportunity Cost"

Eugene Callahan, Robert Murphy, Anas Elghafari

cs.DS 🏛 arXiv 📚 0 cites 5 years ago

R.I.P. 👻 Ghosted

Efficient stream-based Max-Min diversification with minimal failure rate

Argyris Kalogeratos, Yutai Nazir Zhao, Mathilde Fekom

cs.DS 🏛 arXiv 📚 0 cites 5 years ago

R.I.P. 👻 Ghosted

Faster connectivity in low-rank hypergraphs via expander decomposition

Calvin Beideman, Karthekeyan Chandrasekaran, ... (+2 more)

cs.DS 🏛 IPCO 📚 0 cites 5 years ago

R.I.P. 👻 Ghosted

To Close Is Easier Than To Open: Dual Parameterization To k-Median

Jarosław Byrka, Szymon Dudycz, ... (+3 more)

cs.DS 🏛 ICAOA W 📚 0 cites 5 years ago

R.I.P. 👻 Ghosted

Matching through Embedding in Dense Graphs

Nitish K. Panigrahy, Prithwish Basu, Don Towsley

cs.DS 🏛 arXiv 📚 0 cites 5 years ago

R.I.P. 👻 Ghosted

An Instance-Based Algorithm for Deciding the Bias of a Coin

Luís Fernando Schultz Xavier da Silveira, Michiel Smid

cs.DS 🏛 Discret. Math. Algorithms Appl. 📚 0 cites 5 years ago

R.I.P. 👻 Ghosted

A Lower Bound for Dynamic Fractional Cascading

Peyman Afshani

cs.DS 🏛 SODA 📚 0 cites 5 years ago

R.I.P. 👻 Ghosted

A more Pragmatic Implementation of the Lock-free, Ordered, Linked List

Jesper Larsson Träff, Manuel Pöter

cs.DS 🏛 ACM SIGPLAN Symposium on Principles & Practice of Parallel Programming 📚 0 cites 5 years ago

R.I.P. 👻 Ghosted

On Minimum Generalized Manhattan Connections

Antonios Antoniadis, Margarita Capretto, ... (+6 more)

cs.DS 🏛 ICADS W 📚 0 cites 5 years ago

R.I.P. 👻 Ghosted

Competitive Analysis of Move-to-Front-or-Middle (MFM) Online List Update Algorithm

Baisakh, Rakesh Mohanty

cs.DS 🏛 arXiv 📚 0 cites 5 years ago

R.I.P. 👻 Ghosted

An Improved Sketching Algorithm for Edit Distance

Ce Jin, Jelani Nelson, Kewen Wu

cs.DS 🏛 arXiv 📚 0 cites 5 years ago

R.I.P. 👻 Ghosted

The complexity of finding and enumerating optimal subgraphs to represent spatial correlation

Jessica Enright, Duncan Lee, ... (+3 more)

cs.DS 🏛 Algorithmica 📚 0 cites 5 years ago

R.I.P. 👻 Ghosted

Solving Shisen-Sho boards

Michiel de Bondt

cs.DS 🏛 arXiv 📚 0 cites 5 years ago

R.I.P. 👻 Ghosted

Graph Square Roots of Small Distance from Degree One Graphs

Petr A. Golovach, Paloma T. Lima, Charis Papadopoulos

cs.DS 🏛 ToCS 📚 0 cites 5 years ago