Search results for "Union-find"

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.	SCG	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.	SODA	2002	DBLP BibTeX RDF
85	Sylvain Conchon, Jean-Christophe Filliâtre	A persistent union-find data structure.	ML	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.	IPPS	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.	Pattern Anal. Appl.	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.	CAAP	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.	ICALP	2005	DBLP DOI BibTeX RDF
69	Haim Kaplan, Nira Shafrir, Robert Endre Tarjan	Meldable heaps and boolean union-find.	STOC	2002	DBLP DOI BibTeX RDF
62	Michael D. Adams 0001, R. Kent Dybvig	Efficient nondestructive equality checking for trees and graphs.	ICFP	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.	IEEE Trans. Pattern Anal. Mach. Intell.	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.	ACM Trans. Algorithms	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.	Algorithmica	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.	Algorithmica	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.	CSCLP	2007	DBLP DOI BibTeX RDF
38	Michael B. Dillencourt, Hanan Samet, Markku Tamminen	A General Approach to Connected-Component Labelling for Arbitrary Image Representations.	J. ACM	1992	DBLP DOI BibTeX RDF
38	Costantino Grana, Daniele Borghesani, Rita Cucchiara	Connected Component Labeling Techniques on Modern Architectures.	ICIAP	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.	ACM Trans. Comput. Log.	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.	IEEE Trans. Knowl. Data Eng.	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.	Agents	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.	J. ACM	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)	FOCS	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.	IEEE Trans. Computers	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.	CoRR	2017	DBLP BibTeX RDF
36	Kitti Gelle, Szabolcs Iván	Recognizing Union-Find Trees Built Up Using Union-By-Rank Strategy is NP-Complete.	DCFS	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.	J. Comput. Syst. Sci.	1996	DBLP DOI BibTeX RDF
35	Johannes A. La Poutré	Lower Bounds for the Union-Find and the Split-Find Problem on Pointer Machines	STOC	1990	DBLP DOI BibTeX RDF
32	Benjamin A. Burton	Enumeration of Non-Orientable 3-Manifolds Using Face-Pairing Graphs and Union-Find.	Discret. Comput. Geom.	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.	GbRPR	2007	DBLP DOI BibTeX RDF
32	Thom W. Frühwirth	Parallelizing Union-Find in Constraint Handling Rules Using Confluence Analysis.	ICLP	2005	DBLP DOI BibTeX RDF
32	Christophe Fiorio, Jens Gustedt	Memory Management for Union-Find Algorithms.	STACS	1997	DBLP DOI BibTeX RDF
32	Jens Gustedt	Efficient Union-Find for Planar Graphs and other Sparse Graph Classes (Extended Abstract).	WG	1996	DBLP DOI BibTeX RDF
24	Alexander Fedorov, Diba Hashemi, Giorgi Nadiradze, Dan Alistarh	Provably-Efficient and Internally-Deterministic Parallel Union-Find.	CoRR	2023	DBLP DOI BibTeX RDF
24	Zhiyi Huang 0002, Chris Lambert, Zipei Nie, Richard Peng	Simpler Analyses of Union-Find.	CoRR	2023	DBLP DOI BibTeX RDF
24	Tim Chan, Simon C. Benjamin	Actis: A Strictly Local Union-Find Decoder.	Quantum	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.	IPDPS Workshops	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.	QCE	2023	DBLP DOI BibTeX RDF
24	Alexander Fedorov, Diba Hashemi, Giorgi Nadiradze, Dan Alistarh	Provably-Efficient and Internally-Deterministic Parallel Union-Find.	SPAA	2023	DBLP DOI BibTeX RDF
24	Nicolas Delfosse, Vivien Londe, Michael E. Beverland	Toward a Union-Find Decoder for Quantum LDPC Codes.	IEEE Trans. Inf. Theory	2022	DBLP DOI BibTeX RDF
24	Yeva Gabrielyan, Varduhi Yeghiazaryan, Irina Voiculescu	Parallel Partitioning: Path Reducing and Union-Find Based Watershed for the GPU.	ICIP	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.	J. Sensors	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.	IEEE Trans. Vis. Comput. Graph.	2021	DBLP DOI BibTeX RDF
24	Nicolas Delfosse, Vivien Londe, Michael E. Beverland	Toward a Union-Find decoder for quantum LDPC codes.	CoRR	2021	DBLP BibTeX RDF
24	Nicolas Delfosse, Matthew B. Hastings	Union-Find Decoders For Homological Product Codes.	Quantum	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.	IEEE BigData	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.	CoRR	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.	CoRR	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.	CoRR	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.	Comput. Phys. Commun.	2019	DBLP DOI BibTeX RDF
24	Karsten Wolf	Synthesis for Various Petri Net Classes with Union/Find.	Fundam. Informaticae	2019	DBLP DOI BibTeX RDF
24	Dan Alistarh, Alexander Fedorov, Nikita Koval	In Search of the Fastest Concurrent Union-Find Algorithm.	CoRR	2019	DBLP BibTeX RDF
24	Kitti Gelle, Szabolcs Iván	Recognizing Union-Find Trees is NP-Complete, Even Without Rank Info.	Int. J. Found. Comput. Sci.	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.	J. Autom. Reason.	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.	ICIAP (2)	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.	PARCO	2019	DBLP DOI BibTeX RDF
24	Dan Alistarh, Alexander Fedorov, Nikita Koval	In Search of the Fastest Concurrent Union-Find Algorithm.	OPODIS	2019	DBLP DOI BibTeX RDF
24	Kitti Gelle, Szabolcs Iván	Recognizing Union-Find trees is NP-complete.	Inf. Process. Lett.	2018	DBLP DOI BibTeX RDF
24	Natcha Simsiri, Kanat Tangwongsan, Srikanta Tirthapura, Kun-Lung Wu	Work-efficient parallel union-find.	Concurr. Comput. Pract. Exp.	2018	DBLP DOI BibTeX RDF
24	Karsten Wolf	Petri Net Synthesis with Union/Find.	Petri Nets	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.	J. Intell. Fuzzy Syst.	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.	CoRR	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.	Euro-Par	2016	DBLP DOI BibTeX RDF
24	Lijun Zhu, Wei Qi Yuan	An Accurate Iris Segmentation Method Based on Union-Find-Set.	CCBR	2016	DBLP DOI BibTeX RDF
24	Normann Decker, Jannis Harder 0001, Torben Scheffel, Malte Schmitz 0001, Daniel Thoma	Runtime Monitoring with Union-Find Structures.	TACAS	2016	DBLP DOI BibTeX RDF
24	Kitti Gelle, Szabolcs Iván	Recognizing Union-Find trees is NP-complete.	CoRR	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.	IECON	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.	ITP	2015	DBLP DOI BibTeX RDF
24	Stephen Alstrup, Mikkel Thorup, Inge Li Gørtz, Theis Rauhe, Uri Zwick	Union-Find with Constant Time Deletions.	ACM Trans. Algorithms	2014	DBLP DOI BibTeX RDF
24	Cai Fu, Kang Zhang, Zhicun Fang, Lansheng Han, Jing Chen	K-clique community detection based on union-find.	CITS	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].	Theor. Comput. Sci.	2012	DBLP DOI BibTeX RDF
24	Amir M. Ben-Amram, Simon Yoffe	A simple and efficient Union-Find-Delete algorithm.	Theor. Comput. Sci.	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.	ACM Trans. Algorithms	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.	SEA	2010	DBLP DOI BibTeX RDF
24	Fredrik Manne, Md. Mostofa Ali Patwary	A Scalable Parallel Union-Find Algorithm for Distributed Memory Computers.	PPAM (1)	2009	DBLP DOI BibTeX RDF
24	Benjamin A. Burton	Enumeration of non-orientable 3-manifolds using face pairing graphs and union-find.	CoRR	2006	DBLP BibTeX RDF
24	Tom Schrijvers, Thom W. Frühwirth	Optimal union-find in Constraint Handling Rules.	Theory Pract. Log. Program.	2006	DBLP DOI BibTeX RDF
24	Tom Schrijvers, Thom W. Frühwirth	Optimal Union-Find in Constraint Handling Rules	CoRR	2005	DBLP BibTeX RDF
24	Tom Schrijvers, Thom W. Frühwirth	Analysing the CHR Implementation of Union-Find.	W(C)LP	2005	DBLP BibTeX RDF
24	Thierry Géraud	Ruminations on Tarjan's Union-Find Algorithm and Connected Operators.	ISMM	2005	DBLP DOI BibTeX RDF
24	Philippe Chassaing, Régine Marchand	Merging costs for the additive Marcus-Lushnikov process, and Union-Find algorithms	CoRR	2004	DBLP BibTeX RDF
24	Gregory C. Harfst, Edward M. Reingold	A potential-based amortized analysis of the union-find data structure.	SIGACT News	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.	ISMM	2000	DBLP DOI BibTeX RDF
24	Stephen Alstrup, Amir M. Ben-Amram, Theis Rauhe	Worst-Case and Amortised Optimality in Union-Find (Extended Abstract).	STOC	1999	DBLP DOI BibTeX RDF
24	Jens Gustedt	Efficient Union-Find for Planar Graphs and other Sparse Graph Classes.	Theor. Comput. Sci.	1998	DBLP DOI BibTeX RDF
24	Christophe Fiorio, Jens Gustedt	Two Linear Time Union-Find Strategies for Image Processing.	Theor. Comput. Sci.	1996	DBLP DOI BibTeX RDF
24	Newton José Vieira	Recuperando Caminhos no esquema algorítmico Union-Find.	RITA	1995	DBLP BibTeX RDF
24	Amir M. Ben-Amram, Zvi Galil	On Data Structure Tradeoffs and an Application to Union-Find	Electron. Colloquium Comput. Complex.	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.	Inf. Process. Lett.	1994	DBLP DOI BibTeX RDF
24	Joan M. Lucas	On the Competitiveness of Splay Trees: Relations to the Union-Find Problem.	On-Line Algorithms	1991	DBLP DOI BibTeX RDF
24	Richard J. Anderson, Heather Woll	Wait-free Parallel Algorithms for the Union-Find Problem	STOC	1991	DBLP DOI BibTeX RDF
24	Johannes A. La Poutré	New Techniques for the Union-Find Problems.	SODA	1990	DBLP DOI BibTeX RDF
24	George Cybenko, T. G. Allen, J. E. Polito	Practical parallel Union-Find algorithms for transitive closure and clustering.	Int. J. Parallel Program.	1988	DBLP DOI BibTeX RDF
24	Giorgio Gambosi, Giuseppe F. Italiano, Maurizio Talamo	Getting Back to the Past in the Union-Find Problem.	STACS	1988	DBLP DOI BibTeX RDF
24	Marek J. Lao	A New Data Structure for the UNION-FIND Problem.	Inf. Process. Lett.	1979	DBLP DOI BibTeX RDF
24	Jon Doyle, Ronald L. Rivest	Linear Expected Time of a Simple Union-Find Algorithm.	Inf. Process. Lett.	1976	DBLP DOI BibTeX RDF
19	Ran Mendelson, Mikkel Thorup, Uri Zwick	Meldable RAM priority queues and minimum directed spanning trees.	SODA	2004	DBLP BibTeX RDF
18	Kurt Mehlhorn, Stefan Näher, Helmut Alt	A Lower Bound for the Complexity of the Union-Split-Find Problem.	ICALP	1987	DBLP DOI BibTeX RDF
16	David Nistér, Henrik Stewénius	Linear Time Maximally Stable Extremal Regions.	ECCV (2)	2008	DBLP DOI BibTeX RDF
16	Aaron Stump, Li-Yang Tan	The Algebra of Equality Proofs.	RTA	2005	DBLP DOI BibTeX RDF
16	Stefano Guerrini	Correctness of Multiplicative Proof Nets Is Linear.	LICS	1999	DBLP DOI BibTeX RDF
13	Alexey Lvov, Ulrich Finkler	Exact basic geometric operations on arbitrary angle polygons using only fixed size integer coordinates.	ICCAD	2008	DBLP DOI BibTeX RDF