Online computation of normalized substring complexity

Additional Titles: The normalized substring complexity $δ$ of a string is defined as $\max_k \{c[k]/k\}$, where $c[k]$ is the number of \textit{distinct} substrings of length $k$. This simply defined measure has recently attracted attention due to its established relationship to popular string compression algorithms. We consider the problem of computing $δ$ online, when the string is provided from a stream. We present two algorithms solving the problem: one working in $O(\log n)$ amortized time per character, and the other in $O(\log^3 n)$ worst-case time per character. To our knowledge, this is the first polylog-time online solution to this problem.

Συγγραφείς: Kucherov, Gregory, Nekrich, Yakov

Όροι ευρετηρίου: Data Structures and Algorithms, F.2.2, text

Σύνδεσμος: http://arxiv.org/abs/2510.16454

Overflow-Safe Polylog-Time Parallel Minimum-Weight Perfect Matching Decoder: Toward Experimental Demonstration

Συγγραφείς: Mikami, Ryo, Yamasaki, Hayata

Θεματικοί όροι: Quantum Physics

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2603.03776

A linear-processor polylog-time algorithm for shortest paths in planar graphs

Συγγραφείς: Klein, P.N., Subramanian, S.

Πηγή: Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science Computer science foundations Foundations of Computer Science, 1993. Proceedings., 34th Annual Symposium on. :259-270 1993

Relation: Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science

The Polylog-Time Hierarchy Captured by Restricted Second-Order Logic

Συγγραφείς: Ferrarotti, F., Gonzalez, S., Schewe, K.-D., Turull-Torres, J.M.

Πηγή: 2018 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC) SYNASC Symbolic and Numeric Algorithms for Scientific Computing (SYNASC), 2018 20th International Symposium on. :133-140 Sep, 2018

Relation: 2018 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)

Efficient matrix chain ordering in polylog time

Συγγραφείς: Bradford, P.G., Rawlins, G.J.E., Shannon, G.E.

Πηγή: Proceedings of 8th International Parallel Processing Symposium Parallel Processing Symposium, 1994. Proceedings., Eighth International. :234-241 1994

Relation: Proceedings of 8th International Parallel Processing Symposium

Fast polylog-time reconfiguration of structurally fault-tolerant multiprocessors

Συγγραφείς: Dutt, S.

Πηγή: Proceedings of 1993 5th IEEE Symposium on Parallel and Distributed Processing Parallel and distributed processing Parallel and Distributed Processing, 1993. Proceedings of the Fifth IEEE Symposium on. :762-770 1993

Relation: Proceedings of 1993 5th IEEE Symposium on Parallel and Distributed Processing

Polylog-time and near-linear work approximation scheme for undirected shortest paths: Polylog-time and near-linear work approximation scheme for undirected shortest paths.

Συγγραφείς: Edith Cohen

Πηγή: Journal of the ACM. 47:132-166

Θεματικοί όροι: faster sequential algorithms, transitive closure bottleneck, polylog-time randomized algorithm, Graph theory (including graph drawing) in computer science, Randomized algorithms, Analysis of algorithms, weighted undirected networks, sparse hop sets, near-linear work algorithms, Approximation algorithms

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: http://www.cohenwang.com/edith/Papers/nobot.pdf
https://zbmath.org/1935197
https://doi.org/10.1145/331605.331610

Incremental Planar Nearest Neighbor Queries with Optimal Query Time

Συγγραφείς: Iacono, John, Nekrich, Yakov

Θεματικοί όροι: Computer Science - Data Structures and Algorithms, Computer Science - Computational Geometry

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2504.07366

A polylog-time and $O(n\sqrt\lg n)$-work parallel algorithm for finding the row minima in totally monotone matrices

Συγγραφείς: Bradford, P., Fleischer, R., Smid, M.

Πηγή: Research Report / Max-Planck-Institut für Informatik

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: https://hdl.handle.net/11858/00-001M-0000-0014-B617-F
https://hdl.handle.net/11858/00-001M-0000-0014-A75F-8

A Linear-Processor Polylog-Time Algorithm for Shortest Paths in Planar Graphs

Συγγραφείς: Philip N. Klein, Sairam Subramanian

Συνεισφορές: The Pennsylvania State University CiteSeerX Archives

Πηγή: ftp://wilma.cs.brown.edu/pub/techreports/93/cs93-35.ps.Z

Περιγραφή αρχείου: application/postscript

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.42.9280

Διαθεσιμότητα: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.42.9280

Computing and testing small connectivity in near-linear time and queries via fast local cut algorithms

Συγγραφείς: Forster, Sebastian, Author, Na Nongkai, Danupon, 1981-, Author, Yang, Liu, Author, Saranurak, Thatchaphol, Author, Yingchareonthawornchai, Sorrachai, Author

Συνεισφορές: Forster, Sebastian, Author, Na Nongkai, Danupon, 1981-, Author, Yang, Liu, Author, Saranurak, Thatchaphol, Author, Yingchareonthawornchai, Sorrachai, Author

Πηγή: Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. :2046-2065

Θεματικοί όροι: Clustering algorithms, Directed graphs, Approximation scheme, Computing and testing, Connected subgraphs, K-vertex connectivity, Linear-time algorithms, Randomized Algorithms, Undirected graph, Vertex connectivity, Graph algorithms

Περιγραφή αρχείου: print

Σύνδεσμος πρόσβασης: https://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-274213

O(log2 n) time efficient parallel factorization of dense, sparse separable, and banded matrices

Συγγραφείς: Reif, John H.

Πηγή: Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures. :278-289

Διαθεσιμότητα: http://dl.acm.org/doi/10.1145/181014.181408

Sublinear-Time Reductions for Big Data Computing: Sublinear-time reductions for big data computing

Συγγραφείς: Xiangyu Gao, Jianzhong Li 0001, Dongjing Miao

Πηγή: Lecture Notes in Computer Science ISBN: 9783030926809

Θεματικοί όροι: FOS: Computer and information sciences, Analysis of algorithms and problem complexity, big data computing, 0102 computer and information sciences, 02 engineering and technology, Computational Complexity (cs.CC), 01 natural sciences, sublinear-time tractability, Computational aspects of data analysis and big data, Computer Science - Computational Complexity, completeness, 0202 electrical engineering, electronic engineering, information engineering, Complexity classes (hierarchies, relations among complexity classes, etc.), reduction techniques

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: http://arxiv.org/pdf/2111.15330
http://arxiv.org/abs/2111.15330
https://arxiv.org/abs/2111.15330

Space- and Time-Efficient Algorithm for Maintaining Dense Subgraphs on One-Pass Dynamic Streams

Συγγραφείς: Bhattacharya, Sayan, Author, Henzinger, Monika, Author, Na Nongkai, Danupon, 1981-, Author, Tsourakakis, Charalampos E., Author

Συνεισφορές: Bhattacharya, Sayan, Author, Henzinger, Monika, Author, Na Nongkai, Danupon, 1981-, Author, Tsourakakis, Charalampos E., Author

Πηγή: STOC '15 Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing. :173-182

Περιγραφή αρχείου: electronic

Σύνδεσμος πρόσβασης: https://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-165848

A Size Efficient Polylog Time Context-Free Language Recognition Algorithm

Συγγραφείς: B. Litow

Συνεισφορές: The Pennsylvania State University CiteSeerX Archives

Πηγή: http://www.cs.jcu.edu.au/ftp/pub/techreports/95-5.ps.gz.

Θεματικοί όροι: computational complexity, parallel algorithms

Περιγραφή αρχείου: application/postscript

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.56.145

Διαθεσιμότητα: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.56.145
http://www.cs.jcu.edu.au/ftp/pub/techreports/95-5.ps.gz

A Unified Approach to Dynamic Point Location, Ray shooting, and Shortest Paths in Planar Maps: A unified approach to dynamic point location, ray shooting and shortest paths in planar maps

Συγγραφείς: Yi-Jen Chiang, Franco P. Preparata, Roberto Tamassia

Πηγή: SIAM Journal on Computing. 25:207-233

Θεματικοί όροι: ray-shooting queries, Data structures, Analysis of algorithms and problem complexity, Computer graphics, computational geometry (digital and algorithmic aspects), shortest-path, polylog-time dynamic data structure, 0102 computer and information sciences, Searching and sorting, 01 natural sciences

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: http://www.cs.brown.edu/research/pubs/pdfs/1992/Tamassia-1992-UAD.pdf
http://dl.acm.org/citation.cfm?id=313559.313610

QUANTUM ALGORITHM FOR SIMULATING REAL TIME EVOLUTION OF LATTICE HAMILTONIANS.

Συγγραφείς: HAAH, JEONGWAN¹ jwhaah@microsoft.com, HASTINGS, MATTHEW B.¹ mahastin@microsoft.com, KOTHARI, ROBIN¹ robin.kothari@microsoft.com, GUANG HAO LOW¹ guanghao.low@microsoft.com

Πηγή: SIAM Journal on Computing. 2023, Vol. 52 Issue 6, p1-35. 35p.

Θεματικοί όροι: *Algorithms, Qubits, Commutation (Electricity), Velocity, Physics

SPARKs: Succinct Parallelizable Arguments of Knowledge.

Συγγραφείς: EPHRAIM, NAOMI¹ nephraim@cs.cornell.edu, FREITAG, CODY¹ cfreitag@cs.cornell.edu, KOMARGODSKI, ILAN^2,3 ilank@cs.huji.ac.il, PASS, RAFAEL¹ rafael@cs.cornell.edu

Πηγή: Journal of the ACM. Sep2022, Vol. 69 Issue 5, p1-88. 88p.

Θεματικοί όροι: *Parallel programming, Polynomial time algorithms, Argument

DECREMENTAL STRONGLY CONNECTED COMPONENTS AND SINGLE-SOURCE REACHABILITY IN NEAR-LINEAR TIME.

Συγγραφείς: BERNSTEIN, AARON¹ bernstei@gmail.com, GUTENBERG, MAXIMILIAN PROBST² maximilian.probst@outlook.com, WULFF-NILSEN, CHRISTIAN³ koolooz@diku.dk

Πηγή: SIAM Journal on Computing. 2023, Vol. 52 Issue 2, p128-155. 28p.

Θεματικοί όροι: Graph algorithms

Γεωγραφικοί όροι: Thailand

Wasserstein Barycenters can be Computed in Polynomial Time in Fixed Dimension.

Συγγραφείς: Altschulerá, Jason M.¹ JASONALT@MIT.EDU, Boix-Adser, Enric¹ EBOIX@MIT.EDU

Πηγή: Journal of Machine Learning Research. 2021, Vol. 22, p1-19. 19p.

Θεματικοί όροι: Computational geometry, Polynomial time algorithms, Machine learning, Computer graphics