Suchergebnisse - "randomized parallel algorithms"
-
1
Autoren:
Quelle: Theoretical Computer Science. 215:89-98
Schlagwörter: graph algorithms, Parallel algorithms, Randomized parallel algorithms, parallel algorithms, 0102 computer and information sciences, 02 engineering and technology, randomized parallel algorithms, 01 natural sciences, Approximation algorithms, Theoretical Computer Science, Maximal path sets, maximal path sets, shortest common superstrings, Shortest common superstrings, 0202 electrical engineering, electronic engineering, information engineering, Distributed algorithms, Graph algorithms, approximation algorithms, Computer Science(all)
Dateibeschreibung: application/xml
-
2
Autoren: John H. Reif
Quelle: Journal of Computer and System Sciences. 62:398-412
Schlagwörter: Vector spaces, linear dependence, rank, lineability, Computer Networks and Communications, randomized algorithms, displacement rank, Applied Mathematics, linear systems, Other matrix algorithms, parallel algorithms, bipartite matching, structured matrices, Parallel numerical computation, 0102 computer and information sciences, output sensitive, randomized parallel algorithms, 01 natural sciences, maximum linear independent subset, Theoretical Computer Science, Computational Theory and Mathematics, Toeplitz matrices, output-sensitive algorithms, matrix rank, parallel computation
Dateibeschreibung: application/xml
-
3
Autoren: Philip D. MacKenzie
Quelle: SIAM Journal on Computing. 26:1559-1580
Schlagwörter: expected time, Analysis of algorithms and problem complexity, load balancing, parallel algorithms, Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.), 0102 computer and information sciences, 02 engineering and technology, randomized parallel algorithms, 01 natural sciences, lower bounds, PRAM model, 0202 electrical engineering, electronic engineering, information engineering, Distributed algorithms, parallel computation
Dateibeschreibung: application/xml
-
4
Autoren:
Quelle: Algorithmica. 13:346-356
Schlagwörter: exact problems, disjoint cycles, Distributed algorithms, 0102 computer and information sciences, 0101 mathematics, perfect matchings, randomized parallel algorithms, 01 natural sciences, Branchings, Disjoint cycles, Exact problems, Graph theory, Perfect matchings, Random parallel algorithms, Computer Graphics and Computer-Aided Design, Software, Safety, Risk, Reliability and Quality, Applied Mathematics
Dateibeschreibung: application/xml
Zugangs-URL: https://zbmath.org/759299
https://doi.org/10.1007/bf01293484
https://link.springer.com/content/pdf/10.1007/BF01293484.pdf
https://link.springer.com/article/10.1007%2FBF01293484
https://dblp.uni-trier.de/db/journals/algorithmica/algorithmica13.html#BruschiR95
https://hdl.handle.net/2434/258876
https://doi.org/10.1007/BF01293484 -
5
Autoren:
Quelle: International Journal of Computational Geometry & Applications. :341-343
Schlagwörter: Analysis of algorithms and problem complexity, Computer graphics, computational geometry (digital and algorithmic aspects), Distributed algorithms, trapezoidal diagrams, triangulation, 0102 computer and information sciences, 0101 mathematics, randomized parallel algorithms, 01 natural sciences, CRCW PRAM
Dateibeschreibung: application/xml
-
6
Autoren:
Weitere Verfasser:
Schlagwörter: parallel algorithms, randomized parallel algorithms, graph algorithms, linear forests, maximal matchings, maximal independent sets
Dateibeschreibung: application/postscript
-
7
Autoren: et al.
Weitere Verfasser: et al.
Schlagwörter: Key words, Parallel algorithms, Randomized parallel algorithms, Graph algorithms, Maximal path sets, Approximation algorithms, Shortest common superstrings
Dateibeschreibung: application/postscript
-
8
Autoren: Michael Luby
Quelle: Journal of Computer and System Sciences. 47:250-286
Schlagwörter: maximal matching, Computer Networks and Communications, Applied Mathematics, Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.), 0102 computer and information sciences, 02 engineering and technology, CREW PRAM, randomized parallel algorithms, 01 natural sciences, Theoretical Computer Science, maximal independent, Computational Theory and Mathematics, vertex coloring, vertex indexing, 0202 electrical engineering, electronic engineering, information engineering, Distributed algorithms, deterministic parallel algorithms, pairwise independence
Dateibeschreibung: application/xml
-
9
Autoren:
Schlagwörter: parallel algorithms, randomized parallel algorithms, graph algorithms, linear forests, maximal matchings, maximal independent sets
Dateibeschreibung: application/pdf
Relation: http://hdl.handle.net/10119/4710
Verfügbarkeit: http://hdl.handle.net/10119/4710
-
10
-
11
Autoren:
Full Text Finder 
Nájsť tento článok vo Web of Science