Suchergebnisse - Computer Science - Data Structures and Algorithms

SciPy 1.0: fundamental algorithms for scientific computing in Python von 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

“… Since its initial release in 2001, SciPy has become a de facto standard for leveraging scientific algorithms in Python, with over 600 unique code contributors, thousands of dependent packages …”
Volltext

Approximate Counting for Spin Systems in Sub-Quadratic Time von 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 …”
Volltext

Approximation Algorithms for Covering Vertices by Long Paths von Gong, Mingyang, Edgar, Brett, Fan, Jing, Lin, Guohui, Miyano, Eiji

Volltext

Optimal Trace Distance and Fidelity Estimations for Pure Quantum States von Qisheng Wang

Volltext

Locally defined independence systems on graphs von Yuki Amano

Volltext

Polynomial-delay enumeration algorithms in set systems von Kazuya Haraguchi, Hiroshi Nagamochi

Volltext

Testing Distributions of Huge Objects von 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, …”
Volltext

Engineering faster double‐array Aho–Corasick automata von Shunsuke Kanda, Koichi Akabe, Yusuke Oda

Volltext

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

“… However, no constructive algorithms and no specific bounds on the size of forbidden graphs are available up to date …”
Volltext

Adaptive Algorithm for Finding Connected Dominating Sets in Uncertain Graphs von Takuro Fukunaga

Volltext

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

“… the `value' of a tensor in designing matrix multiplication algorithms. The main result of this paper is a refinement of the laser method that improves the resulting value bound for most sufficiently large tensors …”
Volltext

Introduction to local certification von 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 output …”
Volltext

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

“… We present a randomized Las Vegas dynamic connectivity data structure with$O(\log n(\log\log n)^2)$amortized expected update time …”
Volltext

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

“… For the problem a 2-approximation algorithm is known, and if the input graph has a perfect matching, the same algorithm has been shown to have a performance guarantee of 5/3 …”
Volltext

Online risk-averse submodular maximization von Yuichi Yoshida, Tasuku Soma

Volltext

On the Parameterized Intractability of Determinant Maximization von Ohsaka, Naoto

Volltext

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

“… Every graph with maximum degree$\Delta$can be colored with$(\Delta+1)$colors using a simple greedy algorithm …”
Volltext

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

“… (Random Structures and Algorithms 2019). We show that for all constants$k \in \mathbb{N}$ ,$\varepsilon \in (0,1)$ , and permutation$\pi:[k] \to [k]$ , there is a …”
Volltext

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

“… Our algorithm does not require complex data structures and has an easy and intuitive implementation, simplifying recognition algorithms for both graph classes. Comment …”
Volltext

Popularity on the Roommate Diversity Problem von Steven Ge, Toshiya Itoh

Volltext