Search Results - sublinear-time deterministic parallel algorithms

Sublinear-time Parallel Algorithms for Matching and Related Problems

Authors: Goldberg, Andrew V. Plotkin, Serge A. Vaidya, Pravin

URL: https://hdl.handle.net/1721.1/149141
MIT-LCS-TM-357

Sublinear-Time Parallel Algorithms for Matching and Related Problems: Sublinear-time parallel algorithms for matching and related problems

Authors: P. M. Vaidya Andrew V. Goldberg Serge Plotkin

Source: Journal of Algorithms. 14:180-213

Subject Terms: flows in zero-one networks, Deterministic network models in operations research, depth-first search, 0211 other engineering and technologies, Distributed algorithms, bipartite matching, sublinear-time deterministic parallel algorithms, 0102 computer and information sciences, 02 engineering and technology, minimum-cost flow, 01 natural sciences, maximal node-disjoint paths

File Description: application/xml

Access URL: https://zbmath.org/166206
https://doi.org/10.1006/jagm.1993.1009
https://doi.ieeecomputersociety.org/10.1109/SFCS.1988.21935
https://ieeexplore.ieee.org/document/21935/
https://www.computer.org/csdl/proceedings-article/focs/1988/021935/12OmNz4SOtG
https://dblp.uni-trier.de/db/conf/focs/focs88.html#GoldbergPV88
https://dblp.uni-trier.de/db/journals/jal/jal14.html#GoldbergPV93
https://dl.acm.org/doi/10.1006/jagm.1993.1009
https://www.sciencedirect.com/science/article/pii/S0196677483710096
http://www.sciencedirect.com/science/article/pii/S0196677483710096

RANGE (RÉNYI) ENTROPY QUERIES AND PARTITIONING.

Authors: ESMAILPOUR, ARYAN KRISHNAN, SANJAY SINTOS, STAVROS

Source: Logical Methods in Computer Science (LMCS); 2025, Vol. 21 Issue 4, p17:1-17:49, 49p

Subject Terms: RENYI'S entropy, UNCERTAINTY (Information theory), DATA analysis, PARALLEL algorithms, DATA structures, COMPUTATIONAL complexity, SCIENTIFIC method

People: SHANNON, Claude Elwood, 1916-2001

Optimizing the Mean Shift Algorithm for Efficient Clustering.

Authors: Mussabayev, Rustam Krassovitskiy, Alexander Aristombayeva, Meruyert

Source: Mathematics (2227-7390); Nov2025, Vol. 13 Issue 21, p3408, 30p

Subject Terms: CLUSTERING algorithms, COMPUTATIONAL complexity, DECISION support systems, PROBABILITY density function, MATHEMATICAL optimization, PARALLEL algorithms

Serial and parallel algorithms for order-preserving pattern matching based on the duel-and-sweep paradigm.

Authors: Jargalsaikhan, Davaajav Hendrian, Diptarama Ueki, Yohei et al.

Source: Acta Informatica; Dec2024, Vol. 61 Issue 4, p415-444, 30p

Subject Terms: PARALLEL algorithms, BABY strollers, ALGORITHMS

Sublinear-Time Parallel Algorithms for Matching and Related Problems

Authors: MASSACHUSETTS INST OF TECH CAMBRIDGE LAB FOR COMPUTER SCIENCE Goldberg, Andrew V. Plotkin, Serge A. et al.

Source: DTIC AND NTIS

Index Terms: Computer Systems, NETWORK FLOWS, ALGORITHMS, PARALLEL PROCESSING, NODES, FLOW, COMBINATORIAL ANALYSIS, NUMBERS, MATCHING, NETWORKS, LOW COSTS, LIGHTWEIGHT, Text

URL: https://apps.dtic.mil/docs/citations/ADA197411

Efficient sublinear time parallel algorithms for dynamic programming and context-free recognition

Authors: Lawrence L. Larmore Wojciech Rytter

Source: Lecture Notes in Computer Science ISBN: 9783540552109

Access URL: https://rd.springer.com/chapter/10.1007/3-540-55210-3_178
https://dblp.uni-trier.de/db/conf/stacs/stacs92.html#LarmoreR92
https://doi.org/10.1007/3-540-55210-3_178
https://link.springer.com/content/pdf/10.1007/3-540-55210-3_178.pdf
https://link.springer.com/chapter/10.1007/3-540-55210-3_178

Fast Distributed Network Decompositions and Covers: Fast distributed network decompositions and covers

Authors: Baruch Awerbuch David Peleg Bonnie Berger et al.

Source: Journal of Parallel and Distributed Computing. 39:105-114

Subject Terms: deterministic sublinear-time distributed algorithms, Network design and communication in computer systems, network decomposition, 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, Parallel algorithms in computer science, 01 natural sciences

File Description: application/xml

Access URL: https://dblp.uni-trier.de/db/journals/jpdc/jpdc39.html#AwerbuchBCP96
https://dl.acm.org/doi/10.1006/jpdc.1996.0159
https://www.sciencedirect.com/science/article/abs/pii/S0743731596901598
https://core.ac.uk/display/24280851

Nearly Optimal Deterministic Algorithm for Sparse Walsh-Hadamard Transform

Authors: Mahdi Cheraghchi Piotr Indyk Krauthgamer, R et al.

Contributors: Mahdi Cheraghchi Piotr Indyk Krauthgamer, R et al.

Source: 34:36
34:1
ACM-SIAM Symposium on Discrete Algorithms (SODA16)
arXiv

Subject Terms: FOS: Computer and information sciences, Technology, Computer Science - Machine Learning, Theory & Methods, Computer Science - Information Theory, cs.LG, Mathematics, Applied, sublinear time algorithms, math.FA, 0102 computer and information sciences, 02 engineering and technology, Computational Complexity (cs.CC), 01 natural sciences, Computation Theory & Mathematics, Machine Learning (cs.LG), Computer Science, Theory & Methods, sparse Fourier transform, cs.IT, FOS: Mathematics, 0202 electrical engineering, electronic engineering, information engineering, math.IT, 2. Zero hunger, 0802 Computation Theory And Mathematics, Science & Technology, TIME FOURIER ALGORITHMS, cs.CC, Information Theory (cs.IT), explicit constructions, Functional Analysis (math.FA), Mathematics - Functional Analysis, Computer Science - Computational Complexity, Sparse recovery, Applied, Physical Sciences, Computer Science, sketching, pseudorandomness, Mathematics, APPROXIMATION

File Description: application/pdf

Access URL: https://epubs.siam.org/doi/pdf/10.1137/1.9781611974331.ch23
http://arxiv.org/pdf/1504.07648
http://arxiv.org/abs/1504.07648
https://epubs.siam.org/doi/10.1137/1.9781611974331.ch23
https://core.ac.uk/display/77010748
https://dl.acm.org/doi/10.5555/2884435.2884458
https://dspace.mit.edu/openaccess-disseminate/1721.1/113895
https://dblp.uni-trier.de/db/journals/corr/corr1504.html#CheraghchiI15
http://hdl.handle.net/10044/1/52000
http://hdl.handle.net/10044/1/63222
http://hdl.handle.net/10044/1/31210
https://orcid.org/0000-0002-7983-9524
http://hdl.handle.net/1721.1/113895

Distributed edge connectivity in sublinear time

Authors: Daga, Mohit Henzinger, Monika Nanongkai, Danupon et al.

Source: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing -STOC 2019
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing

Subject Terms: graph algorithms, FOS: Computer and information sciences, edge connectivity, 0102 computer and information sciences, 01 natural sciences, Edge connectivity, Distributed computing, 102031 Theoretische Informatik, distributed computing, Computer Science - Distributed, Parallel, and Cluster Computing, 102031 Theoretical computer science, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), ALGORITHM, Distributed, Parallel, and Cluster Computing (cs.DC), Graph algorithms

Access URL: http://arxiv.org/abs/1904.04341
https://ucrisportal.univie.ac.at/de/publications/cc8f44f1-727f-4254-897b-b7cca8c440ea
https://doi.org/10.1145/3313276.3316346
https://arxiv.org/abs/1904.04341
https://dl.acm.org/doi/10.1145/3313276.3316346
https://doi.org/10.1145/3313276.3316346
https://arxiv.org/pdf/1904.04341.pdf
http://www.diva-portal.org/smash/record.jsf?pid=diva2:1365385
https://dblp.uni-trier.de/db/journals/corr/corr1904.html#abs-1904-04341
https://arxiv.org/abs/1904.04341
https://arxiv.org/pdf/1904.04341
http://ui.adsabs.harvard.edu/abs/2019arXiv190404341D/abstract

Improved Tradeoffs for Leader Election

Authors: Shay Kutten Peter Robinson Ming Ming Tan et al.

Source: Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing. :355-365

Subject Terms: FOS: Computer and information sciences, Computer Science - Distributed, Parallel, and Cluster Computing, Computer Science - Data Structures and Algorithms, 0202 electrical engineering, electronic engineering, information engineering, Data Structures and Algorithms (cs.DS), Distributed, Parallel, and Cluster Computing (cs.DC), 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Access URL: http://arxiv.org/abs/2301.08235

The Randomized Local Computation Complexity of the Lovász Local Lemma

Authors: Brandt, Sebastian Grunau, Christoph Rozhoň, Václav

Source: Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing (PODC '21)
Principles of Distributed Computing (PODC) 2021
Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing

Subject Terms: FOS: Computer and information sciences, Local Computation Algorithms, Lovász Local Lemma, VOLUME Model, Gap Result, Computer Science - Distributed, Parallel, and Cluster Computing, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), Distributed, Parallel, and Cluster Computing (cs.DC), 0102 computer and information sciences, 01 natural sciences

Access URL: http://arxiv.org/pdf/2103.16251
http://arxiv.org/abs/2103.16251
https://arxiv.org/abs/2103.16251
https://dl.acm.org/doi/pdf/10.1145/3465084.3467931
https://www.podc.org/podc2021/list-of-accepted-papers/#29
https://doi.org/10.1145/3465084.3467931
https://dblp.uni-trier.de/db/journals/corr/corr2103.html#abs-2103-16251
http://hdl.handle.net/20.500.11850/501448

A Fast Parallel Implementation of a PTAS for Fractional Packing and Covering Linear Programs.

Authors: Jelić, Slobodan Laue, Sören Matijević, Domagoj et al.

Source: International Journal of Parallel Programming; Oct2015, Vol. 43 Issue 5, p840-875, 36p

Subject Terms: PARALLEL algorithms, APPROXIMATION theory, LINEAR programming, PARALLEL computers, ITERATIVE methods (Mathematics)

On a fast deterministic parallel approximate matching algorithm.

Authors: Haglin, D.J.

Source: Proceedings of the Third IEEE Symposium on Parallel & Distributed Processing; 1991, p774-777, 4p

A deterministic parallel algorithm for the homing sequence problem.

Authors: Ravikumar, B.

Source: Proceedings of SPDP '96: 8th IEEE Symposium on Parallel & Distributed Processing; 1996, p512-520, 9p

ROUND COMPRESSION FOR PARALLEL MATCHING ALGORITHMS.

Authors: CZUMAJ, ARTUR LACKI, JAKUB MADRY, ALEKSANDER et al.

Source: SIAM Journal on Computing; 2020, Vol. 49 Issue 5, p1-44, 44p

Subject Terms: DISTRIBUTED algorithms, PARALLEL algorithms

Geographic Terms: NEW York (State)

Sublinear-Time Parallel Algorithms for Matching and Related Problems

Authors: Andrew V. Goldberg Serge A. Plotkin Pravin M. Vaidya et al.

Contributors: Andrew V. Goldberg Serge A. Plotkin Pravin M. Vaidya et al.

Source: http://troll-w.stanford.edu/plotkin/zero1.ps.

File Description: application/postscript

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

Availability: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.38.6595
http://troll-w.stanford.edu/plotkin/zero1.ps

Techniques for Designing Efficient Parallel Graph Algorithms for SMPs and Multicore Processors.

Authors: Hutchison, David Kanade, Takeo Kittler, Josef et al.

Source: Parallel & Distributed Processing & Applications (9783540747413); 2007, p137-147, 11p

Sublinear-Time Parallel Algorithms for Matching and Related Problems

Authors: Goldberg, Andrew V. Plotkin, Serge A. Vaidya, Pravin et al.

Contributors: Goldberg, Andrew V. Plotkin, Serge A. Vaidya, Pravin et al.

Source: DTIC AND NTIS

Subject Terms: Computer Systems, NETWORK FLOWS, ALGORITHMS, PARALLEL PROCESSING, NODES, FLOW, COMBINATORIAL ANALYSIS, NUMBERS, MATCHING, NETWORKS, LOW COSTS, LIGHTWEIGHT

File Description: text/html

Relation: http://www.dtic.mil/docs/citations/ADA197411

Availability: http://www.dtic.mil/docs/citations/ADA197411
http://oai.dtic.mil/oai/oai?&verb=getRecord&metadataPrefix=html&identifier=ADA197411

Sublinear Fully Distributed Partition with Applications.

Authors: Derbel, Bilel Mosbah, Mohamed Zemmari, Akka

Source: Theory of Computing Systems; Aug2010, Vol. 47 Issue 2, p368-404, 37p, 5 Diagrams, 6 Charts

Subject Terms: DISTRIBUTED algorithms, RADIUS (Geometry), ALGORITHMS, PARALLEL algorithms, WRENCHES, TORQUE wrenches