Suchergebnisse - "PRAM algorithm"

Parallel algorithms for two processors precedence constraint scheduling

Autoren: Serna Iglesias, María José Universitat Politècnica de Catalunya. Departament de Ciències de la Computació Universitat Politècnica de Catalunya. ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals

Weitere Verfasser: Serna Iglesias, María José Universitat Politècnica de Catalunya. Departament de Ciències de la Computació Universitat Politècnica de Catalunya. ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals

Schlagwörter: Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica::Algorísmica i teoria de la complexitat, Scheduling, multiprocessor, parallel algorithms, NC class, PRAM algorithm, Classificació AMS::68 Computer science::68W Algorithms

Dateibeschreibung: 4 p.; application/pdf

Relation: https://link.springer.com/referencework/10.1007%2F978-1-4939-2864-4; http://hdl.handle.net/2117/104935

Verfügbarkeit: http://hdl.handle.net/2117/104935

Finding the k shortest paths in parallel: Finding the \(k\) shortest paths in parallel

Autoren: Eric Ruppert

Quelle: Lecture Notes in Computer Science ISBN: 9783540626169

Schlagwörter: Data structures, 0211 other engineering and technologies, PRAM algorithm, 0102 computer and information sciences, 02 engineering and technology, Parallel algorithms in computer science, 16. Peace & justice, 01 natural sciences, 7. Clean energy

Dateibeschreibung: application/xml

Zugangs-URL: https://dblp.uni-trier.de/db/conf/stacs/stacs97.html#Ruppert97
http://www.cse.yorku.ca/~ruppert/papers/ksp.pdf
https://rd.springer.com/chapter/10.1007/BFb0023482
https://link.springer.com/chapter/10.1007/BFb0023482

Parallel two dimensional witness computation

Autoren: Ramesh Hariharan Kunsoo Park S. Muthukrishnan et al.

Quelle: Information and Computation. 188:20-67

Schlagwörter: Computational Theory and Mathematics, 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, Parallel algorithms in computer science, CRCW-PRAM algorithm, 01 natural sciences, Theoretical Computer Science, Information Systems, Computer Science Applications

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/2118424
https://doi.org/10.1016/s0890-5401(03)00162-7
http://www.sciencedirect.com/science/article/pii/S0890540103001627
https://www.sciencedirect.com/science/article/pii/S0890540103001627
https://doi.org/10.1016/S0890-5401(03)00162-7
https://nyuscholars.nyu.edu/en/publications/parallel-two-dimensional-witness-computation
https://dblp.uni-trier.de/db/journals/iandc/iandc188.html#ColeGHMP04

Ultrafast Expected Time Parallel Algorithms: Ultrafast expected time parallel algorithms

Autoren: Philip D. MacKenzie Quentin F. Stout

Quelle: Journal of Algorithms. 26:1-33

Schlagwörter: CRCW PRAM algorithm, padded sorting, Distributed algorithms, Searching and sorting

Dateibeschreibung: application/xml

Zugangs-URL: http://www.eecs.umich.edu/~qstout/pap/UltrafastJAlg.pdf
https://dblp.uni-trier.de/db/journals/jal/jal26.html#MacKenzieS98
https://www.sciencedirect.com/science/article/abs/pii/S0196677497908920
https://www.sciencedirect.com/science/article/pii/S0196677497908920#!

An optimal parallel algorithm for digital curve segmentation

Autoren: Peter Damaschke

Quelle: Theoretical Computer Science. 178:225-236

Schlagwörter: digital curve segmentation, Computer graphics, computational geometry (digital and algorithmic aspects), 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, Parallel algorithms in computer science, EREW PRAM algorithm, 01 natural sciences, Theoretical Computer Science, Computer Science(all)

Dateibeschreibung: application/xml

Zugangs-URL: https://dblp.uni-trier.de/db/journals/tcs/tcs178.html#Damaschke97
https://www.sciencedirect.com/science/article/pii/S0304397596002277

An Optimal Randomised Logarithmic Time Connectivity Algorithm for the EREW PRAM: An optimal randomised logarithmic time connectivity algorithm for the EREW PRAM

Autoren: Shay Halperin Uri Zwick

Quelle: Journal of Computer and System Sciences. 53:395-416

Schlagwörter: Computational Theory and Mathematics, Computer Networks and Communications, Graph theory (including graph drawing) in computer science, randomised EREW PRAM algorithm, Applied Mathematics, 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, Parallel algorithms in computer science, 01 natural sciences, Theoretical Computer Science

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/992449
https://doi.org/10.1006/jcss.1996.0078
https://dl.acm.org/doi/10.1006/jcss.1996.0078
https://www.sciencedirect.com/science/article/pii/S0022000096900781
https://dblp.uni-trier.de/db/journals/jcss/jcss53.html#HalperinZ96
https://core.ac.uk/display/82417241
https://www.sciencedirect.com/science/article/abs/pii/S0022000096900781
https://doi.org/10.1006/jcss.1996.0078

Finding all periods and initial palindromes of a string in parallel

Autoren: Dany Breslauer Zvi Galil

Quelle: Algorithmica. 14:355-366

Schlagwörter: Combinatorics on words, Analysis of algorithms and problem complexity, Distributed algorithms, Parallel algorithms in computer science, CRCW-PRAM algorithm

Dateibeschreibung: application/xml

Zugangs-URL: https://ir.cwi.nl/pub/1428/1428D.pdf
https://dblp.uni-trier.de/db/journals/algorithmica/algorithmica14.html#BreslauerG95
http://dblp.uni-trier.de/db/journals/algorithmica/algorithmica14.html#BreslauerG95
https://www.narcis.nl/publication/RecordID/oai%3Acwi.nl%3A1428
https://link.springer.com/article/10.1007/BF01294132

Parallel algorithms for hierarchical clustering

Autoren: Clark F. Olson

Quelle: Parallel Computing. 21:1313-1325

Schlagwörter: Butterfly network, Parallel algorithm, Pattern analysis, Pattern recognition, speech recognition, 0202 electrical engineering, electronic engineering, information engineering, Distributed algorithms, PRAM algorithm, 02 engineering and technology, Hierarchical clustering

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/984980
https://doi.org/10.1016/0167-8191(95)00017-i

controlling memory access concurrency in efficient fault tolerant parallel algorithms: Controlling memory access concurrency in efficient fault-tolerant parallel algorithms

Autoren: Alexander A. Shvartsman Dimitrios Michailidis Paris C. Kanellakis

Quelle: Nordic Journal of Computing. 2(2):146-180

Schlagwörter: Distributed algorithms, optimal fault-tolerant EREW PRAM algorithm, CRCW PRAM

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/794259
https://dblp.uni-trier.de/db/journals/njc/njc2.html#KanellakisMS95
https://dl.acm.org/doi/10.5555/642068.642072

Parallel RAM algorithms for factorizing words

Autoren: Daykin, J.W. Iliopoulos, C.S. Smyth, W.F.

Quelle: Theoretical Computer Science. 127:53-67

Schlagwörter: CRCW PRAM algorithm, Combinatorics on words, Lyndon factorization, Analysis of algorithms and problem complexity, unbounded alphabet, 0202 electrical engineering, electronic engineering, information engineering, Distributed algorithms, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Theoretical Computer Science, Computer Science(all)

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/567716
https://doi.org/10.1016/0304-3975(94)90100-7
https://www.sciencedirect.com/science/article/pii/0304397594901007
https://core.ac.uk/display/82831580
https://dblp.uni-trier.de/db/journals/tcs/tcs127.html#DaykinIS94
https://doi.org/10.1016/0304-3975(94)90100-7
https://researchrepository.murdoch.edu.au/id/eprint/27517/

A Simpler Parallel Algorithm for Graph Connectivity: A simpler parallel algorithm for graph connectivity

Autoren: Yahiko Kambayashi Kazuo Iwama

Quelle: Journal of Algorithms. 16:190-217

Schlagwörter: CRCW PRAM algorithm, Connectivity, graph connectivity, undirected graph, connected components, Analysis of algorithms and problem complexity, Graph theory (including graph drawing) in computer science, expander graphs, 0202 electrical engineering, electronic engineering, information engineering, Distributed algorithms, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/536846
https://doi.org/10.1006/jagm.1994.1009
https://dblp.uni-trier.de/db/journals/jal/jal16.html#IwamaK94
https://www.sciencedirect.com/science/article/pii/S0196677484710091

Optimal parallel suffix tree construction

Autoren: Hariharan, Ramesh

Quelle: Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94. :290-299

Schlagwörter: Computational Theory and Mathematics, Computer Networks and Communications, Graph theory (including graph drawing) in computer science, Applied Mathematics, Computer Science & Automation (Formerly, 0202 electrical engineering, electronic engineering, information engineering, Distributed algorithms, CREW-PRAM algorithm, School of Automation), 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Theoretical Computer Science

Dateibeschreibung: application/xml; application/pdf

Zugangs-URL: https://zbmath.org/1079981
https://doi.org/10.1006/jcss.1997.1496
https://dblp.uni-trier.de/db/journals/jcss/jcss55.html#Hariharan97
https://core.ac.uk/display/148466411
https://www.sciencedirect.com/science/article/pii/S0022000097914963
https://dblp.uni-trier.de/db/conf/stoc/stoc1994.html#Hariharan94
https://dl.acm.org/doi/10.1145/195058.195162
https://doi.org/10.1145/195058.195162
http://portal.acm.org/citation.cfm?doid=195058.195162
http://eprints.iisc.ac.in/9830/

On Efficient Parallel Algorithms for Solving Set Recurrence Equations: On efficient parallel algorithms for solving set recurrence equations

Autoren: Hui Wang Tao Jiang Oscar H. Ibarra

Quelle: Journal of Algorithms. 14:244-257

Schlagwörter: language recognition, sequence comparison, pattern matching, CREW PRAM algorithm, linear context-free languages, Distributed algorithms, Formal languages and automata, EREW PRAM algorithms, set recurrence equations

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/166209
https://doi.org/10.1006/jagm.1993.1012
https://dblp.uni-trier.de/db/journals/jal/jal14.html#IbarraWJ93
https://www.sciencedirect.com/science/article/pii/S0196677483710126

Efficient parallel circuits and algorithms for division

Autoren: Shankar, Narayan Ramachandran, Vijaya

Quelle: Information Processing Letters. 29:307-313

Schlagwörter: Analysis of algorithms and problem complexity, boolean circuit, 0102 computer and information sciences, 02 engineering and technology, Models of computation (Turing machines, etc.), Efficient computation, 01 natural sciences, circuit complexity, efficient computation, parallel circuits, Switching theory, application of Boolean algebra, Boolean functions, 0202 electrical engineering, electronic engineering, information engineering, division, PRAM algorithm, Division, Boolean circuits

Dateibeschreibung: application/xml

Zugangs-URL: https://www.ideals.illinois.edu/bitstream/2142/74256/2/B37-ACT_78.pdf
https://zbmath.org/4082965
https://doi.org/10.1016/0020-0190(88)90230-x
https://www.sciencedirect.com/science/article/abs/pii/002001908890230X
https://dblp.uni-trier.de/db/journals/ipl/ipl29.html#ShankarR88
https://doi.org/10.1016/0020-0190(88)90230-X
https://www.ideals.illinois.edu/handle/2142/74256

The accelerated centroid decomposition technique for optimal parallel tree evaluation in logarithmic time

Autoren: Cole, Richard Vishkin, Uzi

Quelle: Algorithmica. 3:329-346

Schlagwörter: parallel algorithm, expression tree, Graph theory (including graph drawing) in computer science, Analysis of algorithms and problem complexity, 0202 electrical engineering, electronic engineering, information engineering, list ranking, centroid decomposition, 0102 computer and information sciences, 02 engineering and technology, EREW PRAM algorithm, 01 natural sciences

Dateibeschreibung: application/xml

Zugangs-URL: https://archive.org/download/acceleratedcentr00cole/acceleratedcentr00cole_bw.pdf
https://zbmath.org/4055067
https://doi.org/10.1007/bf01762121

Parallel complexity of logical query programs

Autoren: Jeffrey D. Ullman Allen Van Gelder

Quelle: Algorithmica. 3:5-42

Schlagwörter: polynomial fringe, generalized sequential machine, chain program, Analysis of algorithms and problem complexity, 05 social sciences, 0102 computer and information sciences, logic programs without function symbols, 01 natural sciences, Theory of operating systems, Information storage and retrieval of data, parallel time complexity, \({\mathcal N}{\mathcal C}\), logical query programs, Datalog programs, 0501 psychology and cognitive sciences, PRAM algorithm, context-free language, Theorem proving (deduction, resolution, etc.)

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/4055048
https://doi.org/10.1007/bf01762108
http://doi.org/10.1007/BF01762108
https://link.springer.com/10.1007/BF01762108
https://dblp.uni-trier.de/db/journals/algorithmica/algorithmica3.html#UllmanG88
https://doi.org/10.1007/BF01762108
https://link.springer.com/article/10.1007/BF01762108
https://ieeexplore.ieee.org/document/4568236/
https://www.computer.org/csdl/proceedings-article/focs/1986/542800438/12OmNB0FxiZ
https://dblp.uni-trier.de/db/conf/focs/focs86.html#UllmanG86
http://ieeexplore.ieee.org/document/4568236/
http://yadda.icm.edu.pl/yadda/element/bwmeta1.element.ieee-000004568236
https://link.springer.com/article/10.1007/BF01762108

Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time: Approximate parallel scheduling. I: The basic technique with applications to optimal parallel list ranking in logarithmic time

Autoren: Uzi Vishkin Richard Cole

Quelle: SIAM Journal on Computing. 17:128-142

Schlagwörter: Analysis of algorithms and problem complexity, optimal speed-up, expander graphs, 0202 electrical engineering, electronic engineering, information engineering, list ranking, scheduling, PRAM algorithm, 0102 computer and information sciences, 02 engineering and technology, approximate reschedulings, 01 natural sciences, Performance evaluation, queueing, and scheduling in the context of computer systems

Dateibeschreibung: application/xml

Zugangs-URL: https://archive.org/download/approximateparal00cole/approximateparal00cole_bw.pdf
https://zbmath.org/4039281
https://doi.org/10.1137/0217009

Simulations among concurrent-write PRAMs

Autoren: Prabhakar Ragde Faith E. Fich Avi Wigderson

Quelle: Algorithmica. 3:43-51

Schlagwörter: COMMON PRAM, expression tree, Analysis of algorithms and problem complexity, parallel random access machines, 0102 computer and information sciences, 02 engineering and technology, Models of computation (Turing machines, etc.), PRIORITY PRAM, EREW PRAM algorithm, write-conflict resolution, concurrent-write models of parallel computation, 01 natural sciences, Theory of operating systems, lower bounds. centroid decomposition, parallel algorithm, 0202 electrical engineering, electronic engineering, information engineering, list ranking

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/4055054
https://doi.org/10.1007/bf01762109
https://dblp.uni-trier.de/db/journals/algorithmica/algorithmica3.html#FichRW88
https://link.springer.com/article/10.1007/BF01762109
https://link.springer.com/content/pdf/10.1007/BF01762109.pdf

Unified parallel encoding and decoding algorithms for Dandelion-like codes

Autoren: Saverio Caminiti PETRESCHI, Rossella Saverio, Caminiti et al.

Weitere Verfasser: Saverio Caminiti PETRESCHI, Rossella Saverio, Caminiti et al.

Schlagwörter: bijective tree encoding, dandelion-like code, pram algorithm, prfer code, prüfer code

Dateibeschreibung: STAMPA

Relation: info:eu-repo/semantics/altIdentifier/wos/WOS:000282191700004; volume:70; issue:11; firstpage:1119; lastpage:1127; numberofpages:9; journal:JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING; http://hdl.handle.net/11573/375623; http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=000282191700004&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=0c7ff228ccbaaa74236f48834a34396a; http://www.dsi.uniroma1.it/~caminiti/publications.html

Verfügbarkeit: http://hdl.handle.net/11573/375623
https://doi.org/10.1016/j.jpdc.2010.07.003
http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=000282191700004&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=0c7ff228ccbaaa74236f48834a34396a
http://www.dsi.uniroma1.it/~caminiti/publications.html
http://www.scopus.com/inward/record.url?eid=2-s2.0-77956226930&partnerID=65&md5=85338f7b2b6fc20d1851c9e7753f4c83

Computing Prüfer codes efficiently in parallel

Autoren: GREENLAW R. PETRESCHI, Rossella Greenlaw, R. et al.

Weitere Verfasser: GREENLAW R. PETRESCHI, Rossella Greenlaw, R. et al.

Schlagwörter: EREW-PRAM algorithm, Parallel Algorithm, Prufer code, Trees

Dateibeschreibung: STAMPA

Relation: info:eu-repo/semantics/altIdentifier/wos/WOS:000086635000004; volume:102; firstpage:205; lastpage:222; numberofpages:18; journal:DISCRETE APPLIED MATHEMATICS; http://hdl.handle.net/11573/30161; http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=000086635000004&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=0c7ff228ccbaaa74236f48834a34396a

Verfügbarkeit: http://hdl.handle.net/11573/30161
https://doi.org/10.1016/S0166-218X(99)00221-8
http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=000086635000004&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=0c7ff228ccbaaa74236f48834a34396a