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

A Randomized Linear-Work EREW PRAM Algorithm to Find a Minimum Spanning Forest

Συγγραφείς: Keung Poon, Chung, Ramachandran, Vijaya

Πηγή: Algorithmica. March 2003 35(3):257-268

DECENTRALIZED LOW-STRETCH TREES VIA LOW DIAMETER GRAPH DECOMPOSITIONS.

Συγγραφείς: BECKER, RUBEN, EMEK, YUVAL, GHAFFARI, MOHSEN, LENZEN, CHRISTOPH

Πηγή: SIAM Journal on Computing; 2024, Vol. 53 Issue 2, p247-286, 40p

Θεματικοί όροι: Weighted graphs, Undirected graphs, Spanning trees, Graph algorithms, Diameter, Computational complexity, Baby strollers

Efficient parallel factorization and solution of structured and unstructured linear systems

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

Πηγή: In Journal of Computer and System Sciences 2005 71(1):86-143

On the complexity of local distributed graph problems

Συγγραφείς: Ghaffari, Mohsen, Kuhn, Fabian, Maus, Yannic

Πηγή: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing. :784-797

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

FAST ALGORITHMS FOR CONSTRUCTING t-SPANNERS AND PATHS WITH STRETCH t.

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

Πηγή: SIAM Journal on Computing; 1998, Vol. 28 Issue 1, p210, 27p

Θεματικοί όροι: Algorithms, Graphic methods

Neighborhood graphs and distributed Δ+1-coloring

Συγγραφείς: Kelsen, Pierre^Aff1

Συνεισφορές: Goos, G., editor, Hartmanis, J., editor, van Leeuwen, J., editor, Karlsson, Rolf, editor, Lingas, Andrzej, editor

Πηγή: Algorithm Theory — SWAT'96 : 5th Scandinavian Workshop on Algorithm Theory Reykjavík, Iceland, July 3–5, 1996 Proceedings. 1097:223-233

A randomized linear work EREW PRAM algorithm to find a minimum spanning forest

Συγγραφείς: Poon, Chung Keung^Aff1, Ramachandran, Vijaya^Aff2

Συνεισφορές: Goos, Gerhard, editor, Hartmanis, Juris, editor, van Leeuwen, Jan, editor, Leong, Hon Wai, editor, Imai, Hiroshi, editor, Jain, Sanjay, editor

Πηγή: Algorithms and Computation : 8th International Symposium, ISAAC '97 Singapore, December 17–19, 1997 Proceedings. 1350:212-222

Bounded length UCFG equivalence

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

Συνεισφορές: Goos, Gerhard, editor, Hartmanis, Juris, editor, van Leeuwen, Jan, editor, Asano, Tetsuo, editor, Igarashi, Yoshihide, editor, Nagamochi, Hiroshi, editor, Miyano, Satoru, editor, Suri, Subhash, editor

Πηγή: Algorithms and Computation : 7th International Symposium, ISAAC '96 Osaka, Japan, December 16–18, 1996 Proceedings. 1178:239-246

LOWER BOUNDS FOR LOCAL MONOTONICITY RECONSTRUCTION FROM TRANSITIVE-CLOSURE SPANNERS.

Συγγραφείς: Bhattacharyya, Arnab, Grigorescu, Elena, Jha, Madhav, Jungh, Kyomin, Raskhodnikova, Sofya, Woodruff, David P.

Πηγή: SIAM Journal on Discrete Mathematics; 2012, Vol. 26 Issue 2, p618-646, 29p, 8 Diagrams, 2 Charts

Θεματικοί όροι: Mathematical functions, Hypercubes, Directed graphs, Integers, Data structures, Algorithms

Dynamic Matching with Better-than-2 Approximation in Polylogarithmic Update Time.

Συγγραφείς: Bhattacharya, Sayan, Kiss, Peter, Saranurak, Thatchaphol, Wajc, David

Πηγή: Journal of the ACM; Oct2024, Vol. 71 Issue 5, p1-32, 32p

Θεματικοί όροι: Graph algorithms, Open-ended questions, Algorithms

Randomized Minimum Spanning Tree Algorithms Using Exponentially Fewer Random Bits.

Συγγραφείς: Pettie, Seth, Ramachandran, Vijaya

Πηγή: ACM Transactions on Algorithms; 2008, Vol. 4 Issue 1, p5:1-5:27, 27p, 1 Diagram, 5 Charts

Θεματικοί όροι: Spanning trees, Algorithms, Linear systems, Tree graphs, Algebra

Polylog-Time and Near-Linear Work Approximation Scheme for Undirected Shortest Paths

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

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

Πηγή: http://www.cohenwang.com/edith/Papers/nobot.pdf.

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

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.385.7644; http://www.cohenwang.com/edith/Papers/nobot.pdf

Διαθεσιμότητα: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.385.7644
http://www.cohenwang.com/edith/Papers/nobot.pdf

Space-Efficient Randomized Algorithms for K-SUM.

Συγγραφείς: Wang, Joshua R.

Πηγή: Algorithms - ESA 2014; 2014, p810-829, 20p

A DETERMINISTIC ALMOST-TIGHT DISTRIBUTED ALGORITHM FOR APPROXIMATING SINGLE-SOURCE SHORTEST PATHS.

Συγγραφείς: HENZINGER, MONIKA, KRINNINGER, SEBASTIAN, NANONGKAI, DANUPON

Πηγή: SIAM Journal on Computing; 2021, Vol. 50 Issue 3, p98-137, 40p

Θεματικοί όροι: Algorithms, Deterministic algorithms, Distributed algorithms, Deterministic processes, Mathematics

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

Implementation of Parallel Algorithms

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

Συνεισφορές: DUKE UNIV DURHAM NC

Πηγή: DTIC AND NTIS

Θεματικοί όροι: Operations Research, Computer Programming and Software, ALGORITHMS, PARALLEL PROCESSING, MATHEMATICAL PROGRAMMING, COMPUTER PROGRAMS, OPTICAL PROCESSING, INPUT OUTPUT MODELS, THREE DIMENSIONAL, LINEAR SYSTEMS, ROBOTICS, PARALLEL ALGORITHMS, POLYLOG TIME, FRACTORIZATIONS, TAGGED MEMORY, RANDOMIZED ALGORITHMS, VLSR(VERY LARGE SCALE ROBOTICS)

Περιγραφή αρχείου: text/html

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

Διαθεσιμότητα: http://www.dtic.mil/docs/citations/ADA275803
http://oai.dtic.mil/oai/oai?&verb=getRecord&metadataPrefix=html&identifier=ADA275803

NEAR-OPTIMAL APPROXIMATE SHORTEST PATHS AND TRANSSHIPMENT IN DISTRIBUTED AND STREAMING MODELS.

Συγγραφείς: BECKER, RUBEN, FORSTER, SEBASTIAN, KARRENBAUER, ANDREAS, LENZEN, CHRISTOPH

Πηγή: SIAM Journal on Computing; 2021, Vol. 50 Issue 3, p815-856, 42p

Θεματικοί όροι: Transshipment, Algorithms, Problem solving, Undirected graphs, Wrenches

A Randomized Linear Work EREW PRAM Algorithm to Find a Minimum Spanning Forest

Συγγραφείς: C. K. Poon, Vijaya Ramachandran

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

Πηγή: ftp://ftp.cs.utexas.edu/pub/techreports/tr97-20.ps.Z

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

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

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

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; 1993, p259-270, 12p

A randomized linear work EREW PRAM algorithm to find a minimum spanning forest

Συγγραφείς: Chung Keung Poon, Vijaya Ramachandran

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

Πηγή: http://www.cs.utexas.edu/~vlr/papers/mst97.pdf.

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

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.63.514; http://www.cs.utexas.edu/~vlr/papers/mst97.pdf

Διαθεσιμότητα: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.63.514
http://www.cs.utexas.edu/~vlr/papers/mst97.pdf