The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for phrase Union-find (changed automatically) with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1976-1994 (15) 1995-2000 (17) 2001-2005 (20) 2006-2007 (16) 2008-2015 (16) 2016-2019 (18) 2020-2023 (16)
Publication types (Num. hits)
article(55) inproceedings(63)
Venues (Conferences, Journals, ...)
CoRR(13) STOC(5) ACM Trans. Algorithms(4) Inf. Process. Lett.(4) Theor. Comput. Sci.(4) SODA(3) STACS(3) Algorithmica(2) FOCS(2) ICALP(2) ICLP(2) ISMM(2) J. ACM(2) Quantum(2) RTA(2) SWAT(2) More (+10 of total 80)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 74 occurrences of 57 keywords

Results
Found 118 publication records. Showing 118 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
122Pankaj K. Agarwal, Lars Arge, Ke Yi 0001 I/O-efficient batched union-find and its applications to terrain analysis. Search on Bibsonomy SCG The full citation details ... 2006 DBLP  DOI  BibTeX  RDF terrain analysis, algorithms, union-find, I/O-efficient, contour trees
117Haim Kaplan, Nira Shafrir, Robert Endre Tarjan Union-find with deletions. Search on Bibsonomy SODA The full citation details ... 2002 DBLP  BibTeX  RDF
85Sylvain Conchon, Jean-Christophe Filliâtre A persistent union-find data structure. Search on Bibsonomy ML The full citation details ... 2007 DBLP  DOI  BibTeX  RDF formal verification, persistence, union-find
73Maria Cristina Pinotti, Vincenzo A. Crupi, Sajal K. Das 0001 A Parallel Solution to the Extended Set Union Problem with Unlimited Backtracking. Search on Bibsonomy IPPS The full citation details ... 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
70Kesheng Wu, Ekow J. Otoo, Kenji Suzuki 0001 Optimizing two-pass connected-component labeling algorithms. Search on Bibsonomy Pattern Anal. Appl. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Union-find algorithm, Optimization, Decision tree, Equivalence relation, Connected-component labeling
69Marek J. Lao A Class of Tree-Like UNION-FIND Data Structures and the Nonlinearity. Search on Bibsonomy CAAP The full citation details ... 1981 DBLP  DOI  BibTeX  RDF computational complexity, data structures, trees, UNION-FIND, set union
69Stephen Alstrup, Inge Li Gørtz, Theis Rauhe, Mikkel Thorup, Uri Zwick Union-Find with Constant Time Deletions. Search on Bibsonomy ICALP The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
69Haim Kaplan, Nira Shafrir, Robert Endre Tarjan Meldable heaps and boolean union-find. Search on Bibsonomy STOC The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
62Michael D. Adams 0001, R. Kent Dybvig Efficient nondestructive equality checking for trees and graphs. Search on Bibsonomy ICFP The full citation details ... 2008 DBLP  DOI  BibTeX  RDF dfa equivalence, eq hash tables, scheme, equality, union-find
62Arnold Meijster, Michael H. F. Wilkinson A Comparison of Algorithms for Connected Set Openings and Closings. Search on Bibsonomy IEEE Trans. Pattern Anal. Mach. Intell. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF connected set operators, attribute filters, pattern spectra, mathematical morphology, multiscale analysis, union-find
49Ran Mendelson, Robert Endre Tarjan, Mikkel Thorup, Uri Zwick Melding priority queues. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2006 DBLP  DOI  BibTeX  RDF disjoint set union, minimum directed spanning trees, optimum branchings, word RAM model, Priority queues, heaps, union-find
46Amir M. Ben-Amram, Zvi Galil Lower Bounds for Dynamic Data Structures on Algebraic RAMs. Search on Bibsonomy Algorithmica The full citation details ... 2002 DBLP  DOI  BibTeX  RDF Cell-probe lower bounds, Dynamic prefix sum, Union-find, Random access machine
46Daniel 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 Algorithmica The full citation details ... 2001 DBLP  DOI  BibTeX  RDF Cell-probe lower bounds, Dynamic prefix sum, Union-find, Random access machine
40Thom W. Frühwirth Quasi-Linear-Time Algorithms by Generalisation of Union-Find in CHR. Search on Bibsonomy CSCLP The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
38Michael B. Dillencourt, Hanan Samet, Markku Tamminen A General Approach to Connected-Component Labelling for Arbitrary Image Representations. Search on Bibsonomy J. ACM The full citation details ... 1992 DBLP  DOI  BibTeX  RDF
38Costantino Grana, Daniele Borghesani, Rita Cucchiara Connected Component Labeling Techniques on Modern Architectures. Search on Bibsonomy ICIAP The full citation details ... 2009 DBLP  DOI  BibTeX  RDF comparison, union-find, connected component labeling
38Andrzej S. Murawski, C.-H. Luke Ong Fast verification of MLL proof nets via IMLL. Search on Bibsonomy ACM Trans. Comput. Log. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Multiplicative linear logic, disjoint union find, essential nets, dominator trees, proof nets
38Peter 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 IEEE Trans. Knowl. Data Eng. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF synonymy, error detection/correction, microbiology, Transitive closure, homology, union-find
38Bin Xu 0009, Danny Z. Chen, Robert J. Szczerba Determining optimal paths in a weighted and dynamic 2D environment using framed-octrees. Search on Bibsonomy Agents The full citation details ... 2000 DBLP  DOI  BibTeX  RDF cell decomposition, framed-octrees, union-find structure, computational geometry, path planning, optimal paths
38Marc J. van Kreveld, Mark H. Overmars Union-Copy Structures and Dynamic Segment Trees. Search on Bibsonomy J. ACM The full citation details ... 1993 DBLP  DOI  BibTeX  RDF union-find structure
38Amir M. Ben-Amram, Zvi Galil Lower Bounds for Data Structure Problems on RAMs (Extended Abstract) Search on Bibsonomy FOCS The full citation details ... 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
38Neil V. Murray Some Observations on Equivalence Handling Methods. Search on Bibsonomy IEEE Trans. Computers The full citation details ... 1981 DBLP  DOI  BibTeX  RDF path compression, tree balancing, partition, Equivalence, UNION-FIND
36Kitti Gelle, Szabolcs Iván Recognizing Union-Find trees built up using union-by-rank strategy is NP-complete. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
36Kitti Gelle, Szabolcs Iván Recognizing Union-Find Trees Built Up Using Union-By-Rank Strategy is NP-Complete. Search on Bibsonomy DCFS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
35Johannes A. La Poutré Lower Bounds for the Union-Find and the Sp;it-Find Problem on Pointer Machines. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
35Johannes A. La Poutré Lower Bounds for the Union-Find and the Split-Find Problem on Pointer Machines Search on Bibsonomy STOC The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
32Benjamin A. Burton Enumeration of Non-Orientable 3-Manifolds Using Face-Pairing Graphs and Union-Find. Search on Bibsonomy Discret. Comput. Geom. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
32Rebeca 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 GbRPR The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
32Thom W. Frühwirth Parallelizing Union-Find in Constraint Handling Rules Using Confluence Analysis. Search on Bibsonomy ICLP The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
32Christophe Fiorio, Jens Gustedt Memory Management for Union-Find Algorithms. Search on Bibsonomy STACS The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
32Jens Gustedt Efficient Union-Find for Planar Graphs and other Sparse Graph Classes (Extended Abstract). Search on Bibsonomy WG The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
24Alexander Fedorov, Diba Hashemi, Giorgi Nadiradze, Dan Alistarh Provably-Efficient and Internally-Deterministic Parallel Union-Find. Search on Bibsonomy CoRR The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
24Zhiyi Huang 0002, Chris Lambert, Zipei Nie, Richard Peng Simpler Analyses of Union-Find. Search on Bibsonomy CoRR The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
24Tim Chan, Simon C. Benjamin Actis: A Strictly Local Union-Find Decoder. Search on Bibsonomy Quantum The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
24Maximilian 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 IPDPS Workshops The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
24Maximilian 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 QCE The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
24Alexander Fedorov, Diba Hashemi, Giorgi Nadiradze, Dan Alistarh Provably-Efficient and Internally-Deterministic Parallel Union-Find. Search on Bibsonomy SPAA The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
24Nicolas Delfosse, Vivien Londe, Michael E. Beverland Toward a Union-Find Decoder for Quantum LDPC Codes. Search on Bibsonomy IEEE Trans. Inf. Theory The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
24Yeva Gabrielyan, Varduhi Yeghiazaryan, Irina Voiculescu Parallel Partitioning: Path Reducing and Union-Find Based Watershed for the GPU. Search on Bibsonomy ICIP The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
24Long-Yang Huang, Li-Qiang Zhang, Xiaoli Duan Iris Location Algorithm Based on Union-Find-Set and Block Search. Search on Bibsonomy J. Sensors The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
24Jiayi 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 IEEE Trans. Vis. Comput. Graph. The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
24Nicolas Delfosse, Vivien Londe, Michael E. Beverland Toward a Union-Find decoder for quantum LDPC codes. Search on Bibsonomy CoRR The full citation details ... 2021 DBLP  BibTeX  RDF
24Nicolas Delfosse, Matthew B. Hastings Union-Find Decoders For Homological Product Codes. Search on Bibsonomy Quantum The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
24Saigopal Thota, Mridul Jain, Nishad Kamat, Saikiran Malikireddy, Pruthvi Raj Eranti, Albin Kuruvilla Building Graphs at a Large Scale: Union Find Shuffle. Search on Bibsonomy IEEE BigData The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
24Jiayi 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 CoRR The full citation details ... 2020 DBLP  BibTeX  RDF
24James S. Willis, Matthieu Schaller, Pedro Gonnet, John C. Helly A Hybrid MPI+Threads Approach to Particle Group Finding Using Union-Find. Search on Bibsonomy CoRR The full citation details ... 2020 DBLP  BibTeX  RDF
24Saigopal Thota, Mridul Jain, Nishad Kamat, Saikiran Malikireddy, Pruthvi Raj Eranti, Albin Kuruvilla Building Graphs at a Large Scale: Union Find Shuffle. Search on Bibsonomy CoRR The full citation details ... 2020 DBLP  BibTeX  RDF
24Synge 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 Comput. Phys. Commun. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
24Karsten Wolf Synthesis for Various Petri Net Classes with Union/Find. Search on Bibsonomy Fundam. Informaticae The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
24Dan Alistarh, Alexander Fedorov, Nikita Koval In Search of the Fastest Concurrent Union-Find Algorithm. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
24Kitti Gelle, Szabolcs Iván Recognizing Union-Find Trees is NP-Complete, Even Without Rank Info. Search on Bibsonomy Int. J. Found. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
24Arthur 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 J. Autom. Reason. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
24Stefano Allegretti, Federico Bolelli, Michele Cancilla, Costantino Grana A Block-Based Union-Find Algorithm to Label Connected Components on GPUs. Search on Bibsonomy ICIAP (2) The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
24James S. Willis, Matthieu Schaller, Pedro Gonnet, John C. Helly A Hybrid MPI+Threads Approach to Particle Group Finding Using Union-Find. Search on Bibsonomy PARCO The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
24Dan Alistarh, Alexander Fedorov, Nikita Koval In Search of the Fastest Concurrent Union-Find Algorithm. Search on Bibsonomy OPODIS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
24Kitti Gelle, Szabolcs Iván Recognizing Union-Find trees is NP-complete. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
24Natcha Simsiri, Kanat Tangwongsan, Srikanta Tirthapura, Kun-Lung Wu Work-efficient parallel union-find. Search on Bibsonomy Concurr. Comput. Pract. Exp. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
24Karsten Wolf Petri Net Synthesis with Union/Find. Search on Bibsonomy Petri Nets The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
24Lianqiang Niu, Xin Chen, Min Peng, Gang Zhang Connected components labeling based on union-find operations applied to connected branches. Search on Bibsonomy J. Intell. Fuzzy Syst. The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
24Jun 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 CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
24Natcha Simsiri, Kanat Tangwongsan, Srikanta Tirthapura, Kun-Lung Wu Work-Efficient Parallel Union-Find with Applications to Incremental Graph Connectivity. Search on Bibsonomy Euro-Par The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
24Lijun Zhu, Wei Qi Yuan An Accurate Iris Segmentation Method Based on Union-Find-Set. Search on Bibsonomy CCBR The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
24Normann Decker, Jannis Harder 0001, Torben Scheffel, Malte Schmitz 0001, Daniel Thoma Runtime Monitoring with Union-Find Structures. Search on Bibsonomy TACAS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
24Kitti Gelle, Szabolcs Iván Recognizing Union-Find trees is NP-complete. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
24Ehab 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 IECON The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
24Arthur Charguéraud, François Pottier Machine-Checked Verification of the Correctness and Amortized Complexity of an Efficient Union-Find Implementation. Search on Bibsonomy ITP The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
24Stephen Alstrup, Mikkel Thorup, Inge Li Gørtz, Theis Rauhe, Uri Zwick Union-Find with Constant Time Deletions. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
24Cai Fu, Kang Zhang, Zhicun Fang, Lansheng Han, Jing Chen K-clique community detection based on union-find. Search on Bibsonomy CITS The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
24Amir 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 Theor. Comput. Sci. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
24Amir M. Ben-Amram, Simon Yoffe A simple and efficient Union-Find-Delete algorithm. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
24Pankaj K. Agarwal, Lars Arge, Ke Yi 0001 I/O-efficient batched union-find and its applications to terrain analysis. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
24Md. Mostofa Ali Patwary, Jean R. S. Blair, Fredrik Manne Experiments on Union-Find Algorithms for the Disjoint-Set Data Structure. Search on Bibsonomy SEA The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
24Fredrik Manne, Md. Mostofa Ali Patwary A Scalable Parallel Union-Find Algorithm for Distributed Memory Computers. Search on Bibsonomy PPAM (1) The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
24Benjamin A. Burton Enumeration of non-orientable 3-manifolds using face pairing graphs and union-find. Search on Bibsonomy CoRR The full citation details ... 2006 DBLP  BibTeX  RDF
24Tom Schrijvers, Thom W. Frühwirth Optimal union-find in Constraint Handling Rules. Search on Bibsonomy Theory Pract. Log. Program. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
24Tom Schrijvers, Thom W. Frühwirth Optimal Union-Find in Constraint Handling Rules Search on Bibsonomy CoRR The full citation details ... 2005 DBLP  BibTeX  RDF
24Tom Schrijvers, Thom W. Frühwirth Analysing the CHR Implementation of Union-Find. Search on Bibsonomy W(C)LP The full citation details ... 2005 DBLP  BibTeX  RDF
24Thierry Géraud Ruminations on Tarjan's Union-Find Algorithm and Connected Operators. Search on Bibsonomy ISMM The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
24Philippe Chassaing, Régine Marchand Merging costs for the additive Marcus-Lushnikov process, and Union-Find algorithms Search on Bibsonomy CoRR The full citation details ... 2004 DBLP  BibTeX  RDF
24Gregory C. Harfst, Edward M. Reingold A potential-based amortized analysis of the union-find data structure. Search on Bibsonomy SIGACT News The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
24Michael H. F. Wilkinson, Jos B. T. M. Roerdink Fast Morphological Attribute Operations Using Tarjan's Union-Find Algorithm. Search on Bibsonomy ISMM The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
24Stephen Alstrup, Amir M. Ben-Amram, Theis Rauhe Worst-Case and Amortised Optimality in Union-Find (Extended Abstract). Search on Bibsonomy STOC The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
24Jens Gustedt Efficient Union-Find for Planar Graphs and other Sparse Graph Classes. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
24Christophe Fiorio, Jens Gustedt Two Linear Time Union-Find Strategies for Image Processing. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
24Newton José Vieira Recuperando Caminhos no esquema algorítmico Union-Find. Search on Bibsonomy RITA The full citation details ... 1995 DBLP  BibTeX  RDF
24Amir M. Ben-Amram, Zvi Galil On Data Structure Tradeoffs and an Application to Union-Find Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 1995 DBLP  BibTeX  RDF
24Norbert Blum, Henning Rochow A Lower Bound on the Single-Operation Worst-Case Time Complexity of the Union-Find Problem on Intervals. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
24Joan M. Lucas On the Competitiveness of Splay Trees: Relations to the Union-Find Problem. Search on Bibsonomy On-Line Algorithms The full citation details ... 1991 DBLP  DOI  BibTeX  RDF
24Richard J. Anderson, Heather Woll Wait-free Parallel Algorithms for the Union-Find Problem Search on Bibsonomy STOC The full citation details ... 1991 DBLP  DOI  BibTeX  RDF
24Johannes A. La Poutré New Techniques for the Union-Find Problems. Search on Bibsonomy SODA The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
24George Cybenko, T. G. Allen, J. E. Polito Practical parallel Union-Find algorithms for transitive closure and clustering. Search on Bibsonomy Int. J. Parallel Program. The full citation details ... 1988 DBLP  DOI  BibTeX  RDF
24Giorgio Gambosi, Giuseppe F. Italiano, Maurizio Talamo Getting Back to the Past in the Union-Find Problem. Search on Bibsonomy STACS The full citation details ... 1988 DBLP  DOI  BibTeX  RDF
24Marek J. Lao A New Data Structure for the UNION-FIND Problem. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 1979 DBLP  DOI  BibTeX  RDF
24Jon Doyle, Ronald L. Rivest Linear Expected Time of a Simple Union-Find Algorithm. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 1976 DBLP  DOI  BibTeX  RDF
19Ran Mendelson, Mikkel Thorup, Uri Zwick Meldable RAM priority queues and minimum directed spanning trees. Search on Bibsonomy SODA The full citation details ... 2004 DBLP  BibTeX  RDF
18Kurt Mehlhorn, Stefan Näher, Helmut Alt A Lower Bound for the Complexity of the Union-Split-Find Problem. Search on Bibsonomy ICALP The full citation details ... 1987 DBLP  DOI  BibTeX  RDF
16David Nistér, Henrik Stewénius Linear Time Maximally Stable Extremal Regions. Search on Bibsonomy ECCV (2) The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
16Aaron Stump, Li-Yang Tan The Algebra of Equality Proofs. Search on Bibsonomy RTA The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
16Stefano Guerrini Correctness of Multiplicative Proof Nets Is Linear. Search on Bibsonomy LICS The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
13Alexey Lvov, Ulrich Finkler Exact basic geometric operations on arbitrary angle polygons using only fixed size integer coordinates. Search on Bibsonomy ICCAD The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 118 (100 per page; Change: )
Pages: [1][2][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license