A Work Efficient Parallel Algorithm for Exact Euclidean Distance Transform

Συγγραφείς: Manduhu, M., Jones, M.W.

Πηγή: IEEE Transactions on Image Processing IEEE Trans. on Image Process. Image Processing, IEEE Transactions on. 28(11):5322-5335 Nov, 2019

A cost-optimal parallel algorithm for the 0–1 knapsack problem and its performance on multicore CPU and GPU implementations

Συγγραφείς: Li, Kenli ^{a, b}, Liu, Jing ^{a, b, ⁎}, Wan, Lanjun ^{a, b}, Yin, Shu ^{a, b}, Li, Keqin ^{a, b, c}

Πηγή: In Parallel Computing March 2015 43:27-42

Constant-Time Word-Size String Matching

Συγγραφείς: Breslauer, Dany^Aff18, Gąsieniec, Leszek^Aff19, Grossi, Roberto^Aff20

Συνεισφορές: Hutchison, David, editor^Aff1, Kanade, Takeo, editor^Aff2, Kittler, Josef, editor^Aff3, Kleinberg, Jon M., editor^Aff4, Mattern, Friedemann, editor^Aff5, Mitchell, John C., editor^Aff6, Naor, Moni, editor^Aff7, Nierstrasz, Oscar, editor^Aff8, Pandu Rangan, C., editor^Aff9, Steffen, Bernhard, editor^Aff10, Sudan, Madhu, editor^Aff11, Terzopoulos, Demetri, editor^Aff12, Tygar, Doug, editor^Aff13, Vardi, Moshe Y., editor^Aff14, Weikum, Gerhard, editor^Aff15, Kärkkäinen, Juha, editor^Aff16, Stoye, Jens, editor^Aff17

Πηγή: Combinatorial Pattern Matching : 23rd Annual Symposium, CPM 2012, Helsinki, Finland, July 3-5, 2012. Proceedings. 7354:83-96

An optimal parallel algorithm for Gaussian elimination

Συγγραφείς: Marrakchi, Mounir^Aff1

Συνεισφορές: Goos, Gerhard, editor, Hartmanis, Juris, editor, van Leeuwen, Jan, editor, Bougé, Luc, editor, Fraigniaud, Pierre, editor, Mignotte, Anne, editor, Robert, Yves, editor

Πηγή: Euro-Par'96 Parallel Processing : Second International Euro-Par Conference Lyon, France, August 26–29, 1996 Proceedings, Volume II. 1124:905-910

Optimal Sublogarithmic Time Parallel Algorithms on Rooted Forests: Optimal sublogarithmic time parallel algorithms on rooted forests

Συγγραφείς: Sanjeev Saxena, G. Sajith

Πηγή: Algorithmica. 27:187-197

Θεματικοί όροι: Graph theory (including graph drawing) in computer science, sublogarithmic time optimal parallel algorithm, 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, Parallel algorithms in computer science, 01 natural sciences

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

Σύνδεσμος πρόσβασης: https://dblp.uni-trier.de/db/journals/algorithmica/algorithmica27.html#SajithS00
https://link.springer.com/article/10.1007%2Fs004530010012

Optimal computation of shortest paths on doubly convex bipartite graphs

Συγγραφείς: Lin Chen

Πηγή: Computers & Mathematics with Applications. 38:1-12

Θεματικοί όροι: Sequential and parallel algorithms, Extremal problems in graph theory, Optimality, doubly convex bipartite graphs, Shortest paths, optimal parallel algorithm, all-pair shortest paths, 0102 computer and information sciences, 02 engineering and technology, Programming involving graphs or networks, 01 natural sciences, Computational Mathematics, Computational Theory and Mathematics, Graph theory (including graph drawing) in computer science, Modelling and Simulation, 0202 electrical engineering, electronic engineering, information engineering, Doubly convex bipartite graphs, Distributed algorithms, Paths and cycles, sequential algorithm

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

Σύνδεσμος πρόσβασης: https://ieeexplore.ieee.org/document/652607/
https://www.computer.org/csdl/proceedings-article/icpads/1997/82270618/12OmNy87QsH
https://dblp.uni-trier.de/db/conf/icpads/icpads1997.html#Chen97a
https://www.sciencedirect.com/science/article/pii/S0898122199002011

An optimal parallel algorithm for planar cycle separators

Συγγραφείς: Shang-Hua Teng, Ming-Yang Kao, Kentaro Toyama

Πηγή: Algorithmica. 14:398-408

Θεματικοί όροι: 0202 electrical engineering, electronic engineering, information engineering, Distributed algorithms, optimal parallel algorithm, 0102 computer and information sciences, 02 engineering and technology, planar undirected graph, 01 natural sciences, cycle separator

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

Σύνδεσμος πρόσβασης: https://zbmath.org/809151
https://doi.org/10.1007/bf01192047
https://link.springer.com/article/10.1007/BF01192047
https://www.scholars.northwestern.edu/en/publications/an-optimal-parallel-algorithm-for-planar-cycle-separators
https://dblp.uni-trier.de/db/journals/algorithmica/algorithmica14.html#KaoTT95
http://dblp.uni-trier.de/db/journals/algorithmica/algorithmica14.html#KaoTT95

Parallel algorithm for finding a core of a tree network

Συγγραφείς: Eliezer A. Albacea

Πηγή: Information Processing Letters. 51:223-226

Θεματικοί όροι: Graph theory (including graph drawing) in computer science, 0202 electrical engineering, electronic engineering, information engineering, Distributed algorithms, core, optimal parallel algorithm, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

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

Σύνδεσμος πρόσβασης: https://zbmath.org/681773
https://doi.org/10.1016/0020-0190(94)00102-2
https://www.sciencedirect.com/science/article/pii/0020019094001022
https://dblp.uni-trier.de/db/journals/ipl/ipl51.html#Albacea94
https://doi.org/10.1016/0020-0190(94)00102-2

An optimal parallel algorithm for merging using multiselection

Συγγραφείς: Deo, Narsingh, Jain, Amit, Medidi, Muralidhar

Πηγή: Information Processing Letters. 50:81-87

Θεματικοί όροι: SELECTION, PRAM, Parallel algorithms, Multiselection, Median, optimal parallel algorithm, 0102 computer and information sciences, 02 engineering and technology, COMPUTATION, 01 natural sciences, Merging, MULTISELECTION, Computer Science, EREW PRAM, 0202 electrical engineering, electronic engineering, information engineering, Distributed algorithms, MERGING, EREW, MEDIAN, Selection, Searching and sorting, scalable parallel algorithm, PARALLEL ALGORITHMS, Information Systems

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

Σύνδεσμος πρόσβασης: https://web.cs.ucdavis.edu/~amenta/f15/merging.pdf
https://dblp.uni-trier.de/db/journals/ipl/ipl50.html#DeoJM94
http://cs.boisestate.edu/~amit/research/papers/selection-ipl.pdf
https://www.sciencedirect.com/science/article/abs/pii/0020019094000093

Parallel heap: An optimal parallel priority queue

Συγγραφείς: Deo, Narsingh, Prasad, Sushil

Πηγή: The Journal of Supercomputing. 6:87-98

Θεματικοί όροι: PARALLEL RANDOM ACCESS MACHINE, HEAP, PARALLEL DATA STRUCTURE, optimal parallel algorithm, Hardware & Architecture, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, 7. Clean energy, Parallel data structure, parallel random access machine, OPTIMAL PARALLEL, Engineering, Theory &, SEARCH, Computer Science, heap, Methods, 0202 electrical engineering, electronic engineering, information engineering, TREES, Electrical & Electronic, ALGORITHM, priority queue, PRIORITY QUEUE

An optimal parallel algorithm for detecting weak visibility of a simple polygon

Συγγραφείς: Chen, Danny Z.

Πηγή: Department of Computer Science Technical Reports

Θεματικοί όροι: weak visibility, Computer Sciences, 0202 electrical engineering, electronic engineering, information engineering, Distributed algorithms, optimal parallel algorithm, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

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

Σύνδεσμος πρόσβασης: https://docs.lib.purdue.edu/cgi/viewcontent.cgi?article=1856&context=cstech
https://zbmath.org/756029
https://doi.org/10.1142/s0218195995000076
https://www.worldscientific.com/doi/10.1142/S0218195995000076
https://dblp.uni-trier.de/db/journals/ijcga/ijcga5.html#Chen95
https://dl.acm.org/doi/10.1145/142675.142692
https://dblp.uni-trier.de/db/conf/compgeom/compgeom92.html#Chen92
https://docs.lib.purdue.edu/cgi/viewcontent.cgi?article=1856&context=cstech
https://docs.lib.purdue.edu/cstech/857/
https://doi.acm.org/10.1145/142675.142692
https://docs.lib.purdue.edu/cgi/viewcontent.cgi?article=1856&context=cstech
https://docs.lib.purdue.edu/cstech/857

A constant-time optimal parallel string-matching algorithm

Συγγραφείς: Zvi Galil

Πηγή: Journal of the ACM. 42:908-918

Θεματικοί όροι: string matching, 0202 electrical engineering, electronic engineering, information engineering, Distributed algorithms, optimal parallel algorithm, pattern string, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

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

Σύνδεσμος πρόσβασης: https://dl.acm.org/doi/10.1145/129712.129720
https://dblp.uni-trier.de/db/conf/stoc/stoc92.html#Galil92
https://dl.acm.org/citation.cfm?doid=129712.129720
https://doi.acm.org/10.1145/210332.210341
https://dl.acm.org/doi/10.1145/210332.210341
https://dblp.uni-trier.de/db/journals/jacm/jacm42.html#Galil95

Research on the optimal parallel algorithms of broadcast-class problems

Συγγραφείς: Li, Xiaofeng, Shou, Biao, Zheng, Shirong

Πηγή: Journal of Computer Science and Technology. 13(5):455-463

Optimal Parallel Searching an Array for Certain Repetitions

Συγγραφείς: Brimkov, Valentin E. ^{∗, 1}

Πηγή: In Electronic Notes in Discrete Mathematics 2003 12:82-93

Optimal parallel parsing of bracket languages

Συγγραφείς: Raffaele Giancarlo, Wojciech Rytter

Πηγή: Lecture Notes in Computer Science ISBN: 9783540180999

Θεματικοί όροι: Bracket language, tree compression, parsing, optimal parallel algorithm, Theory of compilers and interpreters, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, parallel random access machine, Theoretical Computer Science, 0202 electrical engineering, electronic engineering, information engineering, bracket context-free languages, complexity, Computer Science(all)

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

Σύνδεσμος πρόσβασης: http://wrap.warwick.ac.uk/60781/12/WRAP_cs-rr-085.pdf
https://dblp.uni-trier.de/db/journals/tcs/tcs53.html#RytterG87
https://core.ac.uk/display/81140815
http://www.sciencedirect.com/science/article/pii/0304397587900703
https://www.sciencedirect.com/science/article/pii/0304397587900703
https://link.springer.com/chapter/10.1007/3-540-18099-0_40
https://rd.springer.com/chapter/10.1007%2F3-540-18099-0_40

Parallel complexity of lexicographically first problems for tree-structured graphs

Συγγραφείς: Chlebus, Bogdan^Aff1, Diks, Krzysztof^Aff1, Rytter, Wojciech^Aff1, Szymacha, Tomasz^Aff1

Συνεισφορές: Goos, G., editor, Hartmanis, J., editor, Barstow, D., editor, Brauer, W., editor, Brinch Hansen, P., editor, Gries, D., editor, Luckham, D., editor, Moler, C., editor, Pnueli, A., editor, Seegmüller, G., editor, Stoer, J., editor, Wirth, N., editor, Kreczmar, Antoni, editor, Mirkowska, Grazyna, editor

Πηγή: Mathematical Foundations of Computer Science 1989 : Porabka-Kozubnik, Poland August 28 – September 1, 1989 Proceedings. 379:185-195

Parallel algorithmic techniques for combinatorial computation

Συγγραφείς: Eppstein, David^Aff1, Galil, Zvi^{Aff1, Aff2}

Συνεισφορές: Goos, G., editor, Hartmanis, J., editor, Barstow, D., editor, Brauer, W., editor, Hansen, P. Brinch, editor, Gries, D., editor, Luckham, D., editor, Moler, C., editor, Pnueli, A., editor, Seegmüller, G., editor, Stoer, J., editor, Wirth, N., editor, Ausiello, Giorgio, editor, Dezani-Ciancaglini, Mariangiola, editor, Della Rocca, Simonetta Ronchi, editor

Πηγή: Automata, Languages and Programming : 16th International Colloquium Stresa, Italy, July 11–15, 1989 Proceedings. 372:304-318

An optimal parallel algorithm for the solution of a triangular system.

Συγγραφείς: Marrakchi, M.

Θεματικοί όροι: optimal parallel algorithm, Parallel numerical computation, triangular system, Direct numerical methods for linear systems and matrix inversion, parallel computation

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

Σύνδεσμος πρόσβασης: https://zbmath.org/522686

Αλγόριθμοι σε κατηγορίες τέλειων γραφημάτων ; Algorithms for classes of perfect graphs

Συγγραφείς: Papadopoulos, Charis, Παπαδόπουλος, Χάρης

Θεματικοί όροι: Πλήθος σκελετικών δέντρων, Αλγόριθμοι, Δυναμικός αναγνώρισης, Βέλτιστος παράλληλος, Επικάλυψη με μονοπάτια, Κλάσεις τέλειων γραφημάτων, m - αποσύνθεση, Dynamic algorithm for recognition, Optimal parallel algorithm, Path cover, Classes of perfect graphs, Modular decomposition, Tree representation, Φυσικές Επιστήμες, Επιστήμη Ηλεκτρονικών Υπολογιστών και Πληροφορική, Natural Sciences, Computer and Information Sciences

Relation: https://hdl.handle.net/10442/hedi/21180

Διαθεσιμότητα: https://hdl.handle.net/10442/hedi/21180
https://doi.org/10.12681/eadd/21180

Optimal parallel parsing of bracket languages

Συγγραφείς: Rytter, Wojciech, Giancarlo, Raffaele

Πηγή: In Theoretical Computer Science 1987 53(2-3):295-306