Search Results - "Computer Science - Data Structures and Algorithms"

SciPy 1.0: fundamental algorithms for scientific computing in Python by Virtanen, Pauli, Gommers, Ralf, Oliphant, Travis E., Haberland, Matt, Reddy, Tyler, Cournapeau, David, Burovski, Evgeni, Peterson, Pearu, Weckesser, Warren, Bright, Jonathan, van der Walt, Stéfan J., Brett, Matthew, Wilson, Joshua, Millman, K. Jarrod, Mayorov, Nikolay, Nelson, Andrew R. J., Jones, Eric, Kern, Robert, Larson, Eric, Carey, C J, Polat, İlhan, Feng, Yu, Moore, Eric W., VanderPlas, Jake, Laxalde, Denis, Perktold, Josef, Cimrman, Robert, Henriksen, Ian, Quintero, E. A., Harris, Charles R., Archibald, Anne M., Ribeiro, Antônio H., Pedregosa, Fabian, van Mulbregt, Paul

“…SciPy is an open-source scientific computing library for the Python programming language. Since its initial release in 2001, SciPy has become a de facto…”
Get full text

Approximate Counting for Spin Systems in Sub-Quadratic Time by Anand, Konrad, Feng, Weiming, Freifeld, Graham, Guo, Heng, Wang, Jiaheng

“…We present two randomised approximate counting algorithms with$\widetilde{O}(n^{2-c}/\varepsilon^2)$running time for some constant$c>0$and…”
Get full text

Testing Distributions of Huge Objects by Goldreich, Oded, Ron, Dana

“…We initiate a study of a new model of property testing that is a hybrid of testing properties of distributions and testing properties of strings. Specifically,…”
Get full text

Fully Dynamic Connectivity in$O(\log n(\log\log n)^2)$Amortized Expected Time by Huang, Shang-En, Huang, Dawei, Kopelowitz, Tsvi, Pettie, Seth, Thorup, Mikkel

“…Dynamic connectivity is one of the most fundamental problems in dynamic graph algorithms. We present a randomized Las Vegas dynamic connectivity data structure…”
Get full text

A Refined Laser Method and Faster Matrix Multiplication by Alman, Josh, Williams, Virginia Vassilevska

“…The complexity of matrix multiplication is measured in terms of$\omega$ , the smallest real number such that two$n\times n$matrices can be multiplied…”
Get full text

Approximating Maximum Edge 2-Coloring by Normalizing Graphs by Mömke, Tobias, Popa, Alexandru, Roshany-Tabrizi, Aida, Ruderer, Michael, Vincze, Roland

“…In a simple, undirected graph G, an edge 2-coloring is a coloring of the edges such that no vertex is incident to edges with more than 2 distinct colors. The…”
Get full text

Simpler and Unified Recognition Algorithm for Path Graphs and Directed Path Graphs by Balzotti, Lorenzo

“…A path graph is the intersection graph of paths in a tree. A directed path graph is the intersection graph of paths in a directed tree. Even if path graphs and…”
Get full text

Lettericity of graphs: an FPT algorithm and a bound on the size of obstructions by Alecu, Bogdan, Kanté, Mamadou Moustapha, Lozin, Vadim, Zamaraev, Viktor

“…Lettericity is a graph parameter responsible for many attractive structural properties. In particular, graphs of bounded lettericity have bounded linear…”
Get full text

Brooks' Theorem in Graph Streams: A Single-Pass Semi-Streaming Algorithm for$\Delta$ -Coloring by Assadi, Sepehr, Kumar, Pankaj, Mittal, Parth

“…Every graph with maximum degree$\Delta$can be colored with$(\Delta+1)$colors using a simple greedy algorithm. Remarkably, recent work has shown that one can…”
Get full text

On Approximability of Steiner Tree in$\ell_p$ -metrics by Fleischmann, Henry, Gavva, Surya Teja, S, Karthik C.

“…In the Continuous Steiner Tree problem (CST), we are given as input a set of points (called terminals) in a metric space and ask for the minimum-cost tree…”
Get full text

Exactly Hittable Interval Graphs by Dhannya, S. M., Narayanaswamy, N. S., Nisha, K. K.

“…Given a set system$\mathcal{X} = \{\mathcal{U},\mathcal{S}\}$ , where$\mathcal{U}$is a set of elements and$\mathcal{S}$is a set of subsets of$\mathcal{U}$ , an…”
Get full text

PPSZ is better than you think by Scheder, Dominik

“…PPSZ, for long time the fastest known algorithm for$k$ -SAT, works by going through the variables of the input formula in random order; each variable is then…”
Get full text

Introduction to local certification by Feuilloley, Laurent

“…A distributed graph algorithm is basically an algorithm where every node of a graph can look at its neighborhood at some distance in the graph and chose its…”
Get full text

An Alternate Proof of Near-Optimal Light Spanners by Bodwin, Greg

“…In 2016, a breakthrough result of Chechik and Wulff-Nilsen [SODA '16] established that every$n$ -node graph$G$has a$(1+\varepsilon)(2k-1)$ -spanner of…”
Get full text

Approximate Distance Sensitivity Oracles in Subquadratic Space by Bilò, Davide, Chechik, Shiri, Choudhary, Keerti, Cohen, Sarel, Friedrich, Tobias, Krogmann, Simon, Schirneck, Martin

“…An$f$ -edge fault-tolerant distance sensitive oracle ( $f$ -DSO) with stretch$\sigma \ge 1$is a data structure that preprocesses a given undirected, unweighted…”
Get full text

Strongly Sublinear Algorithms for Testing Pattern Freeness by Newman, Ilan, Varma, Nithin

“…For a permutation$\pi:[k] \to [k]$ , a function$f:[n] \to \mathbb{R}$contains a$\pi$ -appearance if there exists$1 \leq i_1 < i_2 < \dots < i_k \leq n$such…”
Get full text

On-line algorithms for multiplication and division in real and complex numeration systems by Frougny, Christiane, Pavelka, Marta, Pelantova, Edita, Svobodova, Milena

“…A positional numeration system is given by a base and by a set of digits. The base is a real or complex number$\beta$such that$|\beta|>1$ , and the digit…”
Get full text

Search-and-Fetch with 2 Robots on a Disk: Wireless and Face-to-Face Communication Models by Georgiou, Konstantinos, Karakostas, George, Kranakis, Evangelos

“…We initiate the study of a new problem on searching and fetching in a distributed environment concerning treasure-evacuation from a unit disk. A treasure and…”
Get full text

Polynomial kernels for edge modification problems towards block and strictly chordal graphs by Dumas, Maël, Perez, Anthony, Rocton, Mathis, Todinca, Ioan

“…We consider edge modification problems towards block and strictly chordal graphs, where one is given an undirected graph$G = (V,E)$and an integer$k \in…”
Get full text

Ortho-Radial Drawing in Near-Linear Time by Chang, Yi-Jun

“…An orthogonal drawing is an embedding of a plane graph into a grid. In a seminal work of Tamassia (SIAM Journal on Computing 1987), a simple combinatorial…”
Get full text