🏛️ The Data Structures & Algorithms Crypt

R.I.P. 👻 Ghosted

Strongly connected components-Algorithm for finding the strongly connected components of a graph

Vlad-Andrei Munteanu

cs.DS 🏛 arXiv 📚 0 cites 8 years ago

R.I.P. 👻 Ghosted

Quantum versus Classical Online Streaming Algorithms with Advice

Kamil Khadiev, Aliya Khadieva, ... (+5 more)

cs.DS 🏛 arXiv 📚 0 cites 8 years ago

R.I.P. 👻 Ghosted

Reducing Compare-and-Swap to Consensus Number One Primitives

Pankaj Khanchandani, Roger Wattenhofer

cs.DS 🏛 arXiv 📚 0 cites 8 years ago

R.I.P. 👻 Ghosted

Searching isomorphic graphs

Anatoly D. Plotnikov

cs.DS 🏛 arXiv 📚 0 cites 8 years ago

R.I.P. 👻 Ghosted

How to select the best set of ads: Can we do better than Greedy Algorithm?

Xinle Liu

cs.DS 🏛 arXiv 📚 0 cites 8 years ago

R.I.P. 👻 Ghosted

Generalized Leapfrogging Samplesort: A Class of $O(n \log^2 n)$ Worst-Case Complexity and $O(n \log n)$ Average-Case Complexity Sorting Algorithms

Eliezer A. Albacea

cs.DS 🏛 arXiv 📚 0 cites 8 years ago

R.I.P. 👻 Ghosted

Faster Approximate(d) Text-to-Pattern L1 Distance

Przemysław Uznański

cs.DS 🏛 arXiv 📚 0 cites 8 years ago

R.I.P. 👻 Ghosted

Finding induced subgraphs in scale-free inhomogeneous random graphs

Ellen Cardinaels, Johan S. H. van Leeuwaarden, Clara Stegehuis

cs.DS 🏛 ICAMW W 📚 0 cites 8 years ago

R.I.P. 👻 Ghosted

Vehicle Routing with Subtours

Stephan Held, Jochen Könemann, Jens Vygen

cs.DS 🏛 Discrete Optimization 📚 0 cites 8 years ago

R.I.P. 👻 Ghosted

Approximating the Incremental Knapsack Problem

Federico Della Croce, Ulrich Pferschy, Rosario Scatamacchia

cs.DS 🏛 arXiv 📚 0 cites 8 years ago

R.I.P. 👻 Ghosted

Learning Powers of Poisson Binomial Distributions

Dimitris Fotakis, Vasilis Kontonis, ... (+2 more)

cs.DS 🏛 arXiv 📚 0 cites 9 years ago

R.I.P. 👻 Ghosted

Testing Piecewise Functions

Steve Hanneke, Liu Yang

cs.DS 🏛 TCS 📚 0 cites 9 years ago

R.I.P. 👻 Ghosted

Mining Non-Redundant Local Process Models From Sequence Databases

Niek Tax, Marlon Dumas

cs.DS 🏛 arXiv 📚 0 cites 8 years ago

R.I.P. 👻 Ghosted

Two-Dimensional Indirect Binary Search for the Positive One-in-Three Satisfiability Problem

Shunichi Matsubara

cs.DS 🏛 arXiv 📚 0 cites 8 years ago

R.I.P. 👻 Ghosted

Polynomial Time Efficient Construction Heuristics for Vertex Separation Minimization Problem

Pallavi Jain, Gur Saran, Kamal Srivastava

cs.DS 🏛 Electron. Notes Discret. Math. 📚 0 cites 9 years ago

R.I.P. 👻 Ghosted

A Cooperative Proof of Work Scheme for Distributed Consensus Protocols

Wouter Kuijper

cs.DS 🏛 arXiv 📚 0 cites 8 years ago

R.I.P. 👻 Ghosted

Approximating Node-Weighted k-MST on Planar Graphs

Jarosław Byrka, Mateusz Lewandowski, Joachim Spoerhase

cs.DS 🏛 ToCS 📚 0 cites 8 years ago

R.I.P. 👻 Ghosted

Sorting Real Numbers in $O(n\sqrt{\log n})$ Time and Linear Space

Yijie Han

cs.DS 🏛 arXiv 📚 0 cites 8 years ago

R.I.P. 👻 Ghosted

A tight lower bound for an online hypercube packing problem and bounds for prices of anarchy of a related game

Y. Kohayakawa, F. K. Miyazawa, Y. Wakabayashi

cs.DS 🏛 TCS 📚 0 cites 8 years ago

R.I.P. 👻 Ghosted

Optimal Construction of Compressed Indexes for Highly Repetitive Texts

Dominik Kempa

cs.DS 🏛 arXiv 📚 0 cites 8 years ago

R.I.P. 👻 Ghosted

Ellipsoid Method for Linear Programming made simple

Sanjeev Saxena

cs.DS 🏛 arXiv 📚 0 cites 8 years ago

R.I.P. 👻 Ghosted

Periortree: An Extention of R-Tree for Periodic Boundary Conditions

Toru Niina

cs.DS 🏛 arXiv 📚 0 cites 8 years ago

R.I.P. 👻 Ghosted

Arithmetic Progression Hypergraphs: Examining the Second Moment Method

Michael Mitzenmacher

cs.DS 🏛 ICAAC W 📚 0 cites 8 years ago

R.I.P. 👻 Ghosted

Coarse Grained Parallel Selection

Laurence Boxer

cs.DS 🏛 Parallel Processing Letters 📚 0 cites 8 years ago