-
1Academic Journal
Authors: Ulrich Kühn
Source: Discrete Applied Mathematics. 109:177-196
Subject Terms: Randomised algorithm, Applied Mathematics, Computer graphics, computational geometry (digital and algorithmic aspects), Parallel computation, Discrete Mathematics and Combinatorics, Symmetric convex distance function, randomized parallel algorithm, planar Voronoi diagrams, 0102 computer and information sciences, Voronoi diagram, Parallel algorithms in computer science, 0101 mathematics, 01 natural sciences
File Description: application/xml
Linked Full TextAccess URL: https://zbmath.org/1584612
https://doi.org/10.1016/s0166-218x(00)00235-3
https://www.sciencedirect.com/science/article/pii/S0166218X00002353
https://dblp.uni-trier.de/db/journals/dam/dam109.html#Kuhn01
https://www.sciencedirect.com/science/article/abs/pii/S0166218X00002353 -
2Academic Journal
Authors: Patrick W. Dymond, Ashfaq Khokhar, Andreas Fabri, Xiaotie Deng, Frank Dehne
Source: Theory of Computing Systems. 30:547-558
Subject Terms: Computer system organization, coarse-grained multicomputer, Distributed algorithms, randomized parallel algorithm, 0102 computer and information sciences, Models of computation (Turing machines, etc.), 0101 mathematics, 01 natural sciences
File Description: application/xml
Linked Full TextAccess URL: https://zbmath.org/1143117
https://doi.org/10.1007/s002240000067
https://link.springer.com/article/10.1007/s002240000067
http://core.ac.uk/display/20765850
https://dblp.uni-trier.de/db/journals/mst/mst30.html#DehneDDFK97 -
3Academic Journal
Authors: Edyta Szymańska, Tomasz Luczak
Source: Journal of Algorithms. 25:311-320
Subject Terms: Graph theory (including graph drawing) in computer science, 0202 electrical engineering, electronic engineering, information engineering, Distributed algorithms, randomized parallel algorithm, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences
File Description: application/xml
Linked Full TextAccess URL: https://zbmath.org/1098603
https://doi.org/10.1006/jagm.1997.0884
https://www.sciencedirect.com/science/article/abs/pii/S0196677497908841
https://dl.acm.org/doi/10.1006/jagm.1997.0884
https://dblp.uni-trier.de/db/journals/jal/jal25.html#LuczakS97 -
4Conference
Authors: Gamlath, Buddhima, Kale, Sagar, Mitrovic, Slobodan, Svensson, Ola
Source: WoS
Subject Terms: weighted matching, parallel algorithms, mpc, semi-streaming, randomized parallel algorithm, model
Relation: Proceedings Of The 2019 Acm Symposium On Principles Of Distributed Computing (Podc '19); 38th ACM Symposium on Principles of Distributed Computing (PODC); https://infoscience.epfl.ch/handle/20.500.14299/172137; WOS:000570442000067
-
5Academic Journal
Efficient Parallel Pseudorandom Number Generation: Efficient parallel pseudorandom number generation
Authors: John H. Reif, J. D. Tygar
Source: Lecture Notes in Computer Science ISBN: 9783540164630
Subject Terms: pseudorandom number generation, parallel algorithm, Analysis of algorithms and problem complexity, Cryptography, 0202 electrical engineering, electronic engineering, information engineering, complexity theory, Random number generation in numerical analysis, Parallel numerical computation, randomized parallel algorithm, RNC, 02 engineering and technology, 7. Clean energy, Multiplicative Inverse Problem
File Description: application/xml
-
6Book
Authors: Cynthia Dwork, Larry J. Stockmeyer, Paris C. Kanellakis
Source: Lecture Notes in Computer Science ISBN: 9783540167808
Subject Terms: unification, directed acyclic graphs, Analysis of algorithms and problem complexity, 1. No poverty, 0102 computer and information sciences, 02 engineering and technology, directed graph reachability, 01 natural sciences, 7. Clean energy, logic programming, Graph theory (including graph drawing) in computer science, 0202 electrical engineering, electronic engineering, information engineering, term matching, randomized parallel algorithm, Theorem proving (deduction, resolution, etc.)
File Description: application/xml
Access URL: https://dblp.uni-trier.de/db/journals/siamcomp/siamcomp17.html#DworkKS88
https://rd.springer.com/chapter/10.1007/3-540-16780-3_109
https://link.springer.com/chapter/10.1007/3-540-16780-3_109
https://epubs.siam.org/doi/abs/10.1137/0217046
https://link.springer.com/content/pdf/10.1007%2F3-540-16780-3_109.pdf
http://dblp.uni-trier.de/db/conf/cade/cade86.html#DworkCKS86
https://link.springer.com/chapter/10.1007/3-540-16780-3_109
https://dblp.uni-trier.de/db/conf/cade/cade86.html#DworkCKS86
https://link.springer.com/content/pdf/10.1007%2F3-540-16780-3_109.pdf -
7Academic Journal
Authors: Ketan Mulmuley, Umesh Vazirani, Vijay V. Vazirani
Source: Proceedings of the nineteenth annual ACM conference on Theory of computing - STOC '87. :345-354
Subject Terms: maximum matching, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), Graphs and linear algebra (matrices, eigenvalues, etc.), Analysis of algorithms and problem complexity, Graph theory (including graph drawing) in computer science, 0211 other engineering and technologies, randomized parallel algorithm, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, matrix inversion, Planar graphs, geometric and topological aspects of graph theory, probabilistic methods
File Description: application/xml
Access URL: http://http.cs.berkeley.edu/~vazirani/pubs/matching.pdf
http://www.columbia.edu/~cs2035/courses/ieor8100.F12/mvv.pdf
https://core.ac.uk/display/24505233
https://www.cs.berkeley.edu/~vazirani/pubs/matching.pdf
http://www.cs.berkeley.edu/~vazirani/pubs/matching.pdf
https://dblp.uni-trier.de/db/conf/stoc/stoc87.html#MulmuleyVV87
https://people.eecs.berkeley.edu/~vazirani/pubs/matching.pdf
https://link.springer.com/article/10.1007/BF02579206
https://doi.org/10.1007/BF02579206
https://dl.acm.org/doi/10.1007/BF02579206
https://dblp.uni-trier.de/db/journals/combinatorica/combinatorica7.html#MulmuleyVV87