Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
122 | Pankaj K. Agarwal, Lars Arge, Ke Yi 0001 |
I/O-efficient batched union-find and its applications to terrain analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 22nd ACM Symposium on Computational Geometry, Sedona, Arizona, USA, June 5-7, 2006, pp. 167-176, 2006, ACM, 1-59593-340-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
terrain analysis, algorithms, union-find, I/O-efficient, contour trees |
117 | Haim Kaplan, Nira Shafrir, Robert Endre Tarjan |
Union-find with deletions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, January 6-8, 2002, San Francisco, CA, USA., pp. 19-28, 2002, ACM/SIAM, 0-89871-513-X. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP BibTeX RDF |
|
85 | Sylvain Conchon, Jean-Christophe Filliâtre |
A persistent union-find data structure. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ML ![In: Proceedings of the ACM Workshop on ML, 2007, Freiburg, Germany, October 5, 2007, pp. 37-46, 2007, ACM, 978-1-59593-676-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
formal verification, persistence, union-find |
73 | Maria Cristina Pinotti, Vincenzo A. Crupi, Sajal K. Das 0001 |
A Parallel Solution to the Extended Set Union Problem with Unlimited Backtracking. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPPS ![In: Proceedings of IPPS '96, The 10th International Parallel Processing Symposium, April 15-19, 1996, Honolulu, Hawaii, USA, pp. 182-186, 1996, IEEE Computer Society, 0-8186-7255-2. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
parallel solution, extended set union problem, unlimited backtracking, Find, SetUnion, MultiUnion, k-Parallel Union Find trees, constant parallel time, optimal work, constant-time performance, parallel algorithms, computational complexity, data structure, parallel machines, Restore, backtracking, Backtrack, tree data structures, tree searching, random-access storage, dynamic partition, Union, EREW-PRAM model |
70 | Kesheng Wu, Ekow J. Otoo, Kenji Suzuki 0001 |
Optimizing two-pass connected-component labeling algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Pattern Anal. Appl. ![In: Pattern Anal. Appl. 12(2), pp. 117-135, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Union-find algorithm, Optimization, Decision tree, Equivalence relation, Connected-component labeling |
69 | Marek J. Lao |
A Class of Tree-Like UNION-FIND Data Structures and the Nonlinearity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CAAP ![In: CAAP '81, Trees in Algebra and Programming, 6th Colloquium, Genoa, Italy, March 5-7, 1981, Proceedings, pp. 255-267, 1981, Springer, 3-540-10828-9. The full citation details ...](Pics/full.jpeg) |
1981 |
DBLP DOI BibTeX RDF |
computational complexity, data structures, trees, UNION-FIND, set union |
69 | Stephen Alstrup, Inge Li Gørtz, Theis Rauhe, Mikkel Thorup, Uri Zwick |
Union-Find with Constant Time Deletions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 32nd International Colloquium, ICALP 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings, pp. 78-89, 2005, Springer, 3-540-27580-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
69 | Haim Kaplan, Nira Shafrir, Robert Endre Tarjan |
Meldable heaps and boolean union-find. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings on 34th Annual ACM Symposium on Theory of Computing, May 19-21, 2002, Montréal, Québec, Canada, pp. 573-582, 2002, ACM, 1-58113-495-9. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
62 | Michael D. Adams 0001, R. Kent Dybvig |
Efficient nondestructive equality checking for trees and graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICFP ![In: Proceeding of the 13th ACM SIGPLAN international conference on Functional programming, ICFP 2008, Victoria, BC, Canada, September 20-28, 2008, pp. 179-188, 2008, ACM, 978-1-59593-919-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
dfa equivalence, eq hash tables, scheme, equality, union-find |
62 | Arnold Meijster, Michael H. F. Wilkinson |
A Comparison of Algorithms for Connected Set Openings and Closings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 24(4), pp. 484-494, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
connected set operators, attribute filters, pattern spectra, mathematical morphology, multiscale analysis, union-find |
49 | Ran Mendelson, Robert Endre Tarjan, Mikkel Thorup, Uri Zwick |
Melding priority queues. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 2(4), pp. 535-556, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
disjoint set union, minimum directed spanning trees, optimum branchings, word RAM model, Priority queues, heaps, union-find |
46 | Amir M. Ben-Amram, Zvi Galil |
Lower Bounds for Dynamic Data Structures on Algebraic RAMs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 32(3), pp. 364-395, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
Cell-probe lower bounds, Dynamic prefix sum, Union-find, Random access machine |
46 | Daniel J. Rosenkrantz, Lin Yu, S. S. Ravi |
Efficient Construction of Minimum Makespan Schedules for Tasks with a Fixed Number of Distinct Execution Times. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 30(1), pp. 83-100, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
Cell-probe lower bounds, Dynamic prefix sum, Union-find, Random access machine |
40 | Thom W. Frühwirth |
Quasi-Linear-Time Algorithms by Generalisation of Union-Find in CHR. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSCLP ![In: Recent Advances in Constraints, 12th Annual ERCIM International Workshop on Constraint Solving and Constraint Logic Programming, CSCLP 2007, Rocquencourt, France, June 7-8, 2007, Revised Selected Papers, pp. 91-108, 2007, Springer, 978-3-540-89811-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
38 | Michael B. Dillencourt, Hanan Samet, Markku Tamminen |
A General Approach to Connected-Component Labelling for Arbitrary Image Representations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 39(2), pp. 253-280, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
38 | Costantino Grana, Daniele Borghesani, Rita Cucchiara |
Connected Component Labeling Techniques on Modern Architectures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICIAP ![In: Image Analysis and Processing - ICIAP 2009, 15th International Conference Vietri sul Mare, Italy, September 8-11, 2009, Proceedings, pp. 816-824, 2009, Springer, 978-3-642-04145-7. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
comparison, union-find, connected component labeling |
38 | Andrzej S. Murawski, C.-H. Luke Ong |
Fast verification of MLL proof nets via IMLL. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Comput. Log. ![In: ACM Trans. Comput. Log. 7(3), pp. 473-498, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Multiplicative linear logic, disjoint union find, essential nets, dominator trees, proof nets |
38 | Peter Dawyndt, Marc Vancanneyt, Hans E. De Meyer, Jean Swings |
Knowledge Accumulation and Resolution of Data Inconsistencies during the Integration of Microbial Information Sources. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Knowl. Data Eng. ![In: IEEE Trans. Knowl. Data Eng. 17(8), pp. 1111-1126, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
synonymy, error detection/correction, microbiology, Transitive closure, homology, union-find |
38 | Bin Xu 0009, Danny Z. Chen, Robert J. Szczerba |
Determining optimal paths in a weighted and dynamic 2D environment using framed-octrees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Agents ![In: Proceedings of the Fourth International Conference on Autonomous Agents, AGENTS 2000, Barcelona, Catalonia, Spain, June 3-7, 2000, pp. 29-30, 2000, ACM, 1-58113-230-1. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
cell decomposition, framed-octrees, union-find structure, computational geometry, path planning, optimal paths |
38 | Marc J. van Kreveld, Mark H. Overmars |
Union-Copy Structures and Dynamic Segment Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 40(3), pp. 635-652, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
union-find structure |
38 | Amir M. Ben-Amram, Zvi Galil |
Lower Bounds for Data Structure Problems on RAMs (Extended Abstract) ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 32nd Annual Symposium on Foundations of Computer Science, San Juan, Puerto Rico, 1-4 October 1991, pp. 622-631, 1991, IEEE Computer Society, 0-8186-2445-0. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
union-find problem, average case time, data structure problems, output variability, problem variability, unbounded integers, lower bounds, upper bound, RAMs, worst case time |
38 | Neil V. Murray |
Some Observations on Equivalence Handling Methods. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 30(5), pp. 361-362, 1981. The full citation details ...](Pics/full.jpeg) |
1981 |
DBLP DOI BibTeX RDF |
path compression, tree balancing, partition, Equivalence, UNION-FIND |
36 | Kitti Gelle, Szabolcs Iván |
Recognizing Union-Find trees built up using union-by-rank strategy is NP-complete. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1704.07254, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
36 | Kitti Gelle, Szabolcs Iván |
Recognizing Union-Find Trees Built Up Using Union-By-Rank Strategy is NP-Complete. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DCFS ![In: Descriptional Complexity of Formal Systems - 19th IFIP WG 1.02 International Conference, DCFS 2017, Milano, Italy, July 3-5, 2017, Proceedings, pp. 152-163, 2017, Springer, 978-3-319-60251-6. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
35 | Johannes A. La Poutré |
Lower Bounds for the Union-Find and the Sp;it-Find Problem on Pointer Machines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Syst. Sci. ![In: J. Comput. Syst. Sci. 52(1), pp. 87-99, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
35 | Johannes A. La Poutré |
Lower Bounds for the Union-Find and the Split-Find Problem on Pointer Machines ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, May 13-17, 1990, Baltimore, Maryland, USA, pp. 34-44, 1990, ACM, 0-89791-361-2. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
32 | Benjamin A. Burton |
Enumeration of Non-Orientable 3-Manifolds Using Face-Pairing Graphs and Union-Find. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 38(3), pp. 527-571, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
32 | Rebeca Marfil, Luis Molina-Tanco, Antonio Bandera, Francisco Sandoval Hernández |
The Construction of Bounded Irregular Pyramids with a Union-Find Decimation Process. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GbRPR ![In: Graph-Based Representations in Pattern Recognition, 6th IAPR-TC-15 International Workshop, GbRPR 2007, Alicante, Spain, June 11-13, 2007, Proceedings, pp. 307-318, 2007, Springer, 978-3-540-72902-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
32 | Thom W. Frühwirth |
Parallelizing Union-Find in Constraint Handling Rules Using Confluence Analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICLP ![In: Logic Programming, 21st International Conference, ICLP 2005, Sitges, Spain, October 2-5, 2005, Proceedings, pp. 113-127, 2005, Springer, 3-540-29208-X. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
32 | Christophe Fiorio, Jens Gustedt |
Memory Management for Union-Find Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 97, 14th Annual Symposium on Theoretical Aspects of Computer Science, Lübeck, Germany, February 27 - March 1, 1997, Proceedings, pp. 67-79, 1997, Springer, 3-540-62616-6. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
32 | Jens Gustedt |
Efficient Union-Find for Planar Graphs and other Sparse Graph Classes (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 22nd International Workshop, WG '96, Cadenabbia (Como), Italy, June 12-14, 1996, Proceedings, pp. 181-195, 1996, Springer, 3-540-62559-3. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
24 | Alexander Fedorov, Diba Hashemi, Giorgi Nadiradze, Dan Alistarh |
Provably-Efficient and Internally-Deterministic Parallel Union-Find. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2304.09331, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
24 | Zhiyi Huang 0002, Chris Lambert, Zipei Nie, Richard Peng |
Simpler Analyses of Union-Find. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2308.09021, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
24 | Tim Chan, Simon C. Benjamin |
Actis: A Strictly Local Union-Find Decoder. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Quantum ![In: Quantum 7, pp. 1183, November 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
24 | Maximilian Jakob Heer, Emanuele Del Sozzo, Keisuke Fujii 0004, Kentaro Sano |
Novel Union-Find-based Decoders for Scalable Quantum Error Correction on Systolic Arrays. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPDPS Workshops ![In: IEEE International Parallel and Distributed Processing Symposium, IPDPS 2023 - Workshops, St. Petersburg, FL, USA, May 15-19, 2023, pp. 524-533, 2023, IEEE, 979-8-3503-1199-0. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
24 | Maximilian Jakob Heer, Jan-Erik R. Wichmann, Kentaro Sano |
Achieving Scalable Quantum Error Correction with Union-Find on Systolic Arrays by Using Multi-Context Processing Elements. ![Search on Bibsonomy](Pics/bibsonomy.png) |
QCE ![In: IEEE International Conference on Quantum Computing and Engineering, QCE 2023, Bellevue, WA, USA, September 17-22, 2023, pp. 242-243, 2023, IEEE, 979-8-3503-4323-6. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
24 | Alexander Fedorov, Diba Hashemi, Giorgi Nadiradze, Dan Alistarh |
Provably-Efficient and Internally-Deterministic Parallel Union-Find. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2023, Orlando, FL, USA, June 17-19, 2023, pp. 261-271, 2023, ACM, 978-1-4503-9545-8. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
24 | Nicolas Delfosse, Vivien Londe, Michael E. Beverland |
Toward a Union-Find Decoder for Quantum LDPC Codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 68(5), pp. 3187-3199, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
24 | Yeva Gabrielyan, Varduhi Yeghiazaryan, Irina Voiculescu |
Parallel Partitioning: Path Reducing and Union-Find Based Watershed for the GPU. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICIP ![In: 2022 IEEE International Conference on Image Processing, ICIP 2022, Bordeaux, France, 16-19 October 2022., pp. 1501-1505, 2022, IEEE, 978-1-6654-9621-6. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
24 | Long-Yang Huang, Li-Qiang Zhang, Xiaoli Duan |
Iris Location Algorithm Based on Union-Find-Set and Block Search. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Sensors ![In: J. Sensors 2021, pp. 7300864:1-7300864:6, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
24 | Jiayi Xu 0001, Hanqi Guo 0001, Han-Wei Shen, Mukund Raj, Xueyun Wang, Xueqiao Xu, Zhehui Wang, Tom Peterka |
Asynchronous and Load-Balanced Union-Find for Distributed and Parallel Scientific Data Visualization and Analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Vis. Comput. Graph. ![In: IEEE Trans. Vis. Comput. Graph. 27(6), pp. 2808-2820, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
24 | Nicolas Delfosse, Vivien Londe, Michael E. Beverland |
Toward a Union-Find decoder for quantum LDPC codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2103.08049, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
24 | Nicolas Delfosse, Matthew B. Hastings |
Union-Find Decoders For Homological Product Codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Quantum ![In: Quantum 5, pp. 406, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
24 | Saigopal Thota, Mridul Jain, Nishad Kamat, Saikiran Malikireddy, Pruthvi Raj Eranti, Albin Kuruvilla |
Building Graphs at a Large Scale: Union Find Shuffle. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE BigData ![In: 2021 IEEE International Conference on Big Data (Big Data), Orlando, FL, USA, December 15-18, 2021, pp. 4146-4152, 2021, IEEE, 978-1-6654-3902-2. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
24 | Jiayi Xu 0001, Hanqi Guo 0001, Han-Wei Shen, Mukund Raj, Xueqiao Xu, Xueyun Wang, Zhehui Wang, Tom Peterka |
Distributed Asynchronous Union-Find for Scalable Feature Tracking. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2003.02351, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
24 | James S. Willis, Matthieu Schaller, Pedro Gonnet, John C. Helly |
A Hybrid MPI+Threads Approach to Particle Group Finding Using Union-Find. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2003.11468, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
24 | Saigopal Thota, Mridul Jain, Nishad Kamat, Saikiran Malikireddy, Pruthvi Raj Eranti, Albin Kuruvilla |
Building Graphs at a Large Scale: Union Find Shuffle. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2012.05430, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
24 | Synge Todo, Haruhiko Matsuo, Hideyuki Shitara |
Parallel loop cluster quantum Monte Carlo simulation of quantum magnets based on global union-find graph algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Phys. Commun. ![In: Comput. Phys. Commun. 239, pp. 84-93, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
24 | Karsten Wolf |
Synthesis for Various Petri Net Classes with Union/Find. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Fundam. Informaticae ![In: Fundam. Informaticae 169(1-2), pp. 57-84, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
24 | Dan Alistarh, Alexander Fedorov, Nikita Koval |
In Search of the Fastest Concurrent Union-Find Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1911.06347, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
24 | Kitti Gelle, Szabolcs Iván |
Recognizing Union-Find Trees is NP-Complete, Even Without Rank Info. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Found. Comput. Sci. ![In: Int. J. Found. Comput. Sci. 30(6-7), pp. 1029-1045, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
24 | Arthur Charguéraud, François Pottier |
Verifying the Correctness and Amortized Complexity of a Union-Find Implementation in Separation Logic with Time Credits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Autom. Reason. ![In: J. Autom. Reason. 62(3), pp. 331-365, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
24 | Stefano Allegretti, Federico Bolelli, Michele Cancilla, Costantino Grana |
A Block-Based Union-Find Algorithm to Label Connected Components on GPUs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICIAP (2) ![In: Image Analysis and Processing - ICIAP 2019 - 20th International Conference, Trento, Italy, September 9-13, 2019, Proceedings, Part II, pp. 271-281, 2019, Springer, 978-3-030-30644-1. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
24 | James S. Willis, Matthieu Schaller, Pedro Gonnet, John C. Helly |
A Hybrid MPI+Threads Approach to Particle Group Finding Using Union-Find. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PARCO ![In: Parallel Computing: Technology Trends, Proceedings of the International Conference on Parallel Computing, PARCO 2019, Prague, Czech Republic, September 10-13, 2019, pp. 263-274, 2019, IOS Press, 978-1-64368-070-5. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
24 | Dan Alistarh, Alexander Fedorov, Nikita Koval |
In Search of the Fastest Concurrent Union-Find Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
OPODIS ![In: 23rd International Conference on Principles of Distributed Systems, OPODIS 2019, December 17-19, 2019, Neuchâtel, Switzerland., pp. 15:1-15:16, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-133-7. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
24 | Kitti Gelle, Szabolcs Iván |
Recognizing Union-Find trees is NP-complete. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 131, pp. 7-14, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
24 | Natcha Simsiri, Kanat Tangwongsan, Srikanta Tirthapura, Kun-Lung Wu |
Work-efficient parallel union-find. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Concurr. Comput. Pract. Exp. ![In: Concurr. Comput. Pract. Exp. 30(4), 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
24 | Karsten Wolf |
Petri Net Synthesis with Union/Find. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Petri Nets ![In: Application and Theory of Petri Nets and Concurrency - 39th International Conference, PETRI NETS 2018, Bratislava, Slovakia, June 24-29, 2018, Proceedings, pp. 60-81, 2018, Springer, 978-3-319-91267-7. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
24 | Lianqiang Niu, Xin Chen, Min Peng, Gang Zhang |
Connected components labeling based on union-find operations applied to connected branches. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Intell. Fuzzy Syst. ![In: J. Intell. Fuzzy Syst. 32(5), pp. 3739-3748, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
24 | Jun Chen 0017, Qiang Yao, Houari Sabirin, Keisuke Nonaka, Hiroshi Sankoh, Sei Naito |
An Optimized Union-Find Algorithm for Connected Components Labeling Using GPUs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1708.08180, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
24 | Natcha Simsiri, Kanat Tangwongsan, Srikanta Tirthapura, Kun-Lung Wu |
Work-Efficient Parallel Union-Find with Applications to Incremental Graph Connectivity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Euro-Par ![In: Euro-Par 2016: Parallel Processing - 22nd International Conference on Parallel and Distributed Computing, Grenoble, France, August 24-26, 2016, Proceedings, pp. 561-573, 2016, Springer, 978-3-319-43658-6. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
24 | Lijun Zhu, Wei Qi Yuan |
An Accurate Iris Segmentation Method Based on Union-Find-Set. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCBR ![In: Biometric Recognition - 11th Chinese Conference, CCBR 2016, Chengdu, China, October 14-16, 2016, Proceedings, pp. 357-365, 2016, 978-3-319-46653-8. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
24 | Normann Decker, Jannis Harder 0001, Torben Scheffel, Malte Schmitz 0001, Daniel Thoma |
Runtime Monitoring with Union-Find Structures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TACAS ![In: Tools and Algorithms for the Construction and Analysis of Systems - 22nd International Conference, TACAS 2016, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2016, Eindhoven, The Netherlands, April 2-8, 2016, Proceedings, pp. 868-884, 2016, Springer, 978-3-662-49673-2. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
24 | Kitti Gelle, Szabolcs Iván |
Recognizing Union-Find trees is NP-complete. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1510.07462, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP BibTeX RDF |
|
24 | Ehab Salahat, Hani H. Saleh, Andrzej Sluzek, Mahmoud Al-Qutayri, Baker Mohammad, Mohammad Ismail 0001 |
Novel fast and scalable parallel union-find ASIC implementation for real-time digital image segmentation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IECON ![In: IECON 2015 - 41st Annual Conference of the IEEE Industrial Electronics Society, Yokohama, Japan, November 9-12, 2015, pp. 3122-3125, 2015, IEEE, 978-1-4799-1762-4. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
24 | Arthur Charguéraud, François Pottier |
Machine-Checked Verification of the Correctness and Amortized Complexity of an Efficient Union-Find Implementation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITP ![In: Interactive Theorem Proving - 6th International Conference, ITP 2015, Nanjing, China, August 24-27, 2015, Proceedings, pp. 137-153, 2015, Springer, 978-3-319-22101-4. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
24 | Stephen Alstrup, Mikkel Thorup, Inge Li Gørtz, Theis Rauhe, Uri Zwick |
Union-Find with Constant Time Deletions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 11(1), pp. 6:1-6:28, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
24 | Cai Fu, Kang Zhang, Zhicun Fang, Lansheng Han, Jing Chen |
K-clique community detection based on union-find. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CITS ![In: International Conference on Computer, Information and Telecommunication Systems, CITS 2014, Jeju, South Korea, July 7-9, 2014, pp. 1-5, 2014, IEEE. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
24 | Amir M. Ben-Amram, Simon Yoffe |
Corrigendum to "A simple and efficient Union-Find-Delete algorithm" [Theoret. Comput. Sci. 412(4-5) 487-492]. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 423, pp. 75, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
24 | Amir M. Ben-Amram, Simon Yoffe |
A simple and efficient Union-Find-Delete algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 412(4-5), pp. 487-492, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
24 | Pankaj K. Agarwal, Lars Arge, Ke Yi 0001 |
I/O-efficient batched union-find and its applications to terrain analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 7(1), pp. 11:1-11:21, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
24 | Md. Mostofa Ali Patwary, Jean R. S. Blair, Fredrik Manne |
Experiments on Union-Find Algorithms for the Disjoint-Set Data Structure. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SEA ![In: Experimental Algorithms, 9th International Symposium, SEA 2010, Ischia Island, Naples, Italy, May 20-22, 2010. Proceedings, pp. 411-423, 2010, Springer, 978-3-642-13192-9. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
24 | Fredrik Manne, Md. Mostofa Ali Patwary |
A Scalable Parallel Union-Find Algorithm for Distributed Memory Computers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PPAM (1) ![In: Parallel Processing and Applied Mathematics, 8th International Conference, PPAM 2009, Wroclaw, Poland, September 13-16, 2009. Revised Selected Papers, Part I, pp. 186-195, 2009, Springer, 978-3-642-14389-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
24 | Benjamin A. Burton |
Enumeration of non-orientable 3-manifolds using face pairing graphs and union-find. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/math/0604584, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP BibTeX RDF |
|
24 | Tom Schrijvers, Thom W. Frühwirth |
Optimal union-find in Constraint Handling Rules. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Pract. Log. Program. ![In: Theory Pract. Log. Program. 6(1-2), pp. 213-224, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
24 | Tom Schrijvers, Thom W. Frühwirth |
Optimal Union-Find in Constraint Handling Rules ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/cs/0501073, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP BibTeX RDF |
|
24 | Tom Schrijvers, Thom W. Frühwirth |
Analysing the CHR Implementation of Union-Find. ![Search on Bibsonomy](Pics/bibsonomy.png) |
W(C)LP ![In: 19th Workshop on (Constraint) Logic Programming, Ulm, Germany, February 21-23, 2005, pp. 135-146, 2005, Universität Ulm, Germany. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP BibTeX RDF |
|
24 | Thierry Géraud |
Ruminations on Tarjan's Union-Find Algorithm and Connected Operators. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISMM ![In: Mathematical Morphology: 40 Years On, Proceedings of the 7th International Symposium on Mathematical Morphology, ISMM 2005, Paris, France, April 18-20, 2005, pp. 105-116, 2005, Springer, 978-1-4020-3442-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
24 | Philippe Chassaing, Régine Marchand |
Merging costs for the additive Marcus-Lushnikov process, and Union-Find algorithms ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR math.PR/0406094, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP BibTeX RDF |
|
24 | Gregory C. Harfst, Edward M. Reingold |
A potential-based amortized analysis of the union-find data structure. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGACT News ![In: SIGACT News 31(3), pp. 86-95, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
24 | Michael H. F. Wilkinson, Jos B. T. M. Roerdink |
Fast Morphological Attribute Operations Using Tarjan's Union-Find Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISMM ![In: Proceedings of the 5th International Symposium on Mathematical Morphology and its Applications to Image and Signal Processing, ISMM 2000, Palo Alto, CA, USA, June 26-28, 2000, pp. 311-320, 2000, Springer, 978-0-7923-7862-4. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
24 | Stephen Alstrup, Amir M. Ben-Amram, Theis Rauhe |
Worst-Case and Amortised Optimality in Union-Find (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, May 1-4, 1999, Atlanta, Georgia, USA, pp. 499-506, 1999, ACM, 1-58113-067-8. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
24 | Jens Gustedt |
Efficient Union-Find for Planar Graphs and other Sparse Graph Classes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 203(1), pp. 123-141, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
24 | Christophe Fiorio, Jens Gustedt |
Two Linear Time Union-Find Strategies for Image Processing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 154(2), pp. 165-181, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
24 | Newton José Vieira |
Recuperando Caminhos no esquema algorítmico Union-Find. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RITA ![In: RITA 2(2), pp. 37-53, 1995. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP BibTeX RDF |
|
24 | Amir M. Ben-Amram, Zvi Galil |
On Data Structure Tradeoffs and an Application to Union-Find ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR95, 1995. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP BibTeX RDF |
|
24 | Norbert Blum, Henning Rochow |
A Lower Bound on the Single-Operation Worst-Case Time Complexity of the Union-Find Problem on Intervals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 51(2), pp. 57-60, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
24 | Joan M. Lucas |
On the Competitiveness of Splay Trees: Relations to the Union-Find Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
On-Line Algorithms ![In: On-Line Algorithms, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, February 11-13, 1991, pp. 95-124, 1991, DIMACS/AMS, 978-0-8218-6596-5. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
24 | Richard J. Anderson, Heather Woll |
Wait-free Parallel Algorithms for the Union-Find Problem ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, May 5-8, 1991, New Orleans, Louisiana, USA, pp. 370-380, 1991, ACM, 0-89791-397-3. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
24 | Johannes A. La Poutré |
New Techniques for the Union-Find Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, 22-24 January 1990, San Francisco, California, USA., pp. 54-63, 1990, SIAM, 0-89871-251-3. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
24 | George Cybenko, T. G. Allen, J. E. Polito |
Practical parallel Union-Find algorithms for transitive closure and clustering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Parallel Program. ![In: Int. J. Parallel Program. 17(5), pp. 403-423, 1988. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
24 | Giorgio Gambosi, Giuseppe F. Italiano, Maurizio Talamo |
Getting Back to the Past in the Union-Find Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 88, 5th Annual Symposium on Theoretical Aspects of Computer Science, Bordeaux, France, February 11-13, 1988, Proceedings, pp. 8-17, 1988, Springer, 3-540-18834-7. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
24 | Marek J. Lao |
A New Data Structure for the UNION-FIND Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 9(1), pp. 39-45, 1979. The full citation details ...](Pics/full.jpeg) |
1979 |
DBLP DOI BibTeX RDF |
|
24 | Jon Doyle, Ronald L. Rivest |
Linear Expected Time of a Simple Union-Find Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 5(5), pp. 146-148, 1976. The full citation details ...](Pics/full.jpeg) |
1976 |
DBLP DOI BibTeX RDF |
|
19 | Ran Mendelson, Mikkel Thorup, Uri Zwick |
Meldable RAM priority queues and minimum directed spanning trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2004, New Orleans, Louisiana, USA, January 11-14, 2004, pp. 40-48, 2004, SIAM, 0-89871-558-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP BibTeX RDF |
|
18 | Kurt Mehlhorn, Stefan Näher, Helmut Alt |
A Lower Bound for the Complexity of the Union-Split-Find Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 14th International Colloquium, ICALP87, Karlsruhe, Germany, July 13-17, 1987, Proceedings, pp. 479-488, 1987, Springer, 3-540-18088-5. The full citation details ...](Pics/full.jpeg) |
1987 |
DBLP DOI BibTeX RDF |
|
16 | David Nistér, Henrik Stewénius |
Linear Time Maximally Stable Extremal Regions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ECCV (2) ![In: Computer Vision - ECCV 2008, 10th European Conference on Computer Vision, Marseille, France, October 12-18, 2008, Proceedings, Part II, pp. 183-196, 2008, Springer, 978-3-540-88685-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
16 | Aaron Stump, Li-Yang Tan |
The Algebra of Equality Proofs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Term Rewriting and Applications, 16th International Conference, RTA 2005, Nara, Japan, April 19-21, 2005, Proceedings, pp. 469-483, 2005, Springer, 3-540-25596-6. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
16 | Stefano Guerrini |
Correctness of Multiplicative Proof Nets Is Linear. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: 14th Annual IEEE Symposium on Logic in Computer Science, Trento, Italy, July 2-5, 1999, pp. 454-463, 1999, IEEE Computer Society, 0-7695-0158-3. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
13 | Alexey Lvov, Ulrich Finkler |
Exact basic geometric operations on arbitrary angle polygons using only fixed size integer coordinates. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCAD ![In: 2008 International Conference on Computer-Aided Design, ICCAD 2008, San Jose, CA, USA, November 10-13, 2008, pp. 494-498, 2008, IEEE Computer Society, 978-1-4244-2820-5. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|