Search results for "depth-first"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
47	Alain Cournier, Stéphane Devismes, Franck Petit, Vincent Villain	Snap-Stabilizing Depth-First Search on Arbitrary Networks.	OPODIS	2004	DBLP DOI BibTeX RDF	fault-tolerance, Distributed systems, stabilization, depth-first search
45	Hector Ouilhet	Google Sky Map: using your phone as an interface.	Mobile HCI	2010	DBLP DOI BibTeX RDF
43	Ming-Syan Chen, Kang G. Shin	Depth-First Search Approach for Fault-Tolerant Routing in Hypercube.	IEEE Trans. Parallel Distributed Syst.	1990	DBLP DOI BibTeX RDF	obstructed node, performance evaluation, performance, fault tolerant computing, multiprocessor interconnection networks, multiprocessing systems, Hamming distance, fault-tolerant routing, depth-first search, hypercube multicomputers, destination node, component failures
42	Lakshmanan Kuppusamy, Kamala Krithivasan	On the Relative Expressive Power of Contextual Grammars with Maximal and Depth-First Derivations.	ICTAC	2009	DBLP DOI BibTeX RDF	internal contextual grammars, maximal, incomparable, depth-first
42	Qunxiong Zhu, Xiaoyong Lin	Depth First Generation of Frequent Patterns Without Candidate Generation.	PAKDD Workshops	2007	DBLP DOI BibTeX RDF	Data mining, Frequent pattern mining, Top-down, Depth first
42	Dragan Bosnacki	A Nested Depth First Search Algorithm for Model Checking with Symmetry Reduction.	FORTE	2002	DBLP DOI BibTeX RDF	state space reduction techniques, nested depth first search algorithm, multiple representatives, Model checking, symmetry reduction
38	Jeremy T. Engle, Edward L. Robertson	Depth first algorithms and inferencing for AFD mining.	IDEAS	2009	DBLP DOI BibTeX RDF	Lozenge Search, approximate functional dependencies, powerset lattices, data mining, depth first search
38	Zhenjiang Li, J. J. Garcia-Luna-Aceves	Finding multi-constrained feasible paths by using depth-first search.	Wirel. Networks	2007	DBLP DOI BibTeX RDF	Multi-constrained path selection, Success ratio, Existence percentage, Competitive ratio, Depth-first search
38	Jop F. Sibeyn, James Abello, Ulrich Meyer 0001	Heuristics for semi-external depth first search on directed graphs.	SPAA	2002	DBLP DOI BibTeX RDF	strong components, graph algorithms, depth first search, external memory
38	Chen-Hsing Peng, Biing-Feng Wang, Jia-Shung Wang	Recognizing Unordered Depth-First Search Trees of an Undirected Graph in Parallel.	IEEE Trans. Parallel Distributed Syst.	2000	DBLP DOI BibTeX RDF	Depth-first search trees, parallel algorithms, spanning trees, PRAM, the Euler-tour technique
38	Jia-Shung Wang, Biing-Feng Wang, Chen-Hsing Peng	Recognizing depth-first-search trees in parallel.	IPPS	1995	DBLP DOI BibTeX RDF	depth-first-search trees, parallel algorithms, parallel algorithm, computational complexity, directed graphs, time complexity, spanning tree, search problems, undirected graph, tree searching, speed-up, EREW PRAM model
38	Daniel R. Fuhrmann	Quadtree Traversal Algorithms for Pointer-Based and Depth-First Representations.	IEEE Trans. Pattern Anal. Mach. Intell.	1988	DBLP DOI BibTeX RDF	depth-first representations, quadtree traversal algorithms, pointer-based representations, data structure, computerised picture processing, computerised pattern recognition, trees (mathematics), nodes, computerized pattern recognition, computerized picture processing, connected-component labeling
37	Hanan Samet	K-Nearest Neighbor Finding Using MaxNearestDist.	IEEE Trans. Pattern Anal. Mach. Intell.	2008	DBLP DOI BibTeX RDF	depth-first nearest neighbor finding, best-first nearest neighbor finding, similarity searching, k-nearest neighbors, metric spaces
37	Chee Fen Yu, Benjamin W. Wah	Efficient Branch-and-Bound Algorithms on a Two-Level Memory System.	IEEE Trans. Software Eng.	1988	DBLP DOI BibTeX RDF	two-level memory system, storage management, virtual-memory, storage allocation, depth-first search, branch-and-bound algorithms, virtual storage, best-first search
35	Lars Arge, Ulrich Meyer 0001, Laura Toma, Norbert Zeh	On External-Memory Planar Depth First Search.	WADS	2001	DBLP DOI BibTeX RDF
31	Lakshmanan Kuppusamy	End-Marked Maximal Depth-First Contextual Grammars.	Developments in Language Theory	2006	DBLP DOI BibTeX RDF
31	Alexander Reinefeld, T. Anthony Marsland	Enhanced Iterative-Deepening Search.	IEEE Trans. Pattern Anal. Mach. Intell.	1994	DBLP DOI BibTeX RDF	iterative-deepening search, breadth-first node expansion, successively extended search horizons, information management techniques, fast-execution memory functions, computational complexity, game theory, iterative methods, search problems, space complexity, depth-first searches, A* search, search efficiency, best-first searches, two-player games
30	David Faragó, Peter H. Schmitt	Improving Non-Progress Cycle Checks.	SPIN	2009	DBLP DOI BibTeX RDF	Non-progress cycles, Model Checking, SPIN, partial order reduction, depth-first search, livelocks
30	Roland Ducournau, Michel Habib	On Some Algorithms for Multiple Inheritance in Object-Oriented Programming.	ECOOP	1987	DBLP DOI BibTeX RDF	inheritance with exceptions, Object oriented language, depth-first-search, partial ordered sets, multiple inheritance, linear extensions
27	Mohamed Naimi	Parallel assignment to distinct identities in arbitrary networks.	ICCCN	1995	DBLP DOI BibTeX RDF	sequential distributed algorithm, parallel assignment, distinct identities, parallel distributed algorithm, distributed system nodes, initiator channel, children channel, outgoing channels, upper bound time transmission, parallel algorithms, multiprocessor interconnection networks, time complexity, communication complexity, spanning tree, depth-first search, network diameter, rooted tree, arbitrary network, synchronous distributed systems
27	Yannis E. Ioannidis, Raghu Ramakrishnan 0001, Linda Winger	Transitive Closure Algorithms Based on Graph Traversal.	ACM Trans. Database Syst.	1993	DBLP DOI BibTeX RDF	node reachability, transitive closure, depth-first search, path computations
26	Sumit Kumar Bose, Subir Bhattacharya	A two pass heuristic algorithm for scheduling 'blocked out' units in continuous process industry.	Ann. Oper. Res.	2008	DBLP DOI BibTeX RDF	Depth first branch and bound, Continuous processing, Heuristic search, Process scheduling
26	Renata Braga Araújo, Guilherme Henrique Trielli Ferreira, Gustavo Henrique Orair, Wagner Meira Jr., Renato Antônio Celso Ferreira, Dorgival Olavo Guedes Neto, Mohammed Javeed Zaki	The ParTriCluster Algorithm for Gene Expression Analysis.	Int. J. Parallel Program.	2008	DBLP DOI BibTeX RDF	Clustering, Parallel programming, Bioinformatics, Depth-first search
26	Yonghong Chen, Xing Liu, Vaithianathan Mani Venkatasubramanian	Fast Algorithms for Detecting Circular VAR Flows in Large Power-Flow Models.	HICSS	2008	DBLP DOI BibTeX RDF	Loop flows, power-flow studies, Directed graphs, depth-first search, electric power system
26	Hiroki Arimura, Takeaki Uno, Shinichi Shimozono	Time and Space Efficient Discovery of Maximal Geometric Graphs.	Discovery Science	2007	DBLP DOI BibTeX RDF	closed graph mining, rightmost expansion, polynomial delay polynomial space enumeration algorithms, depth-first search, geometric graphs
26	Shimin Chen, Phillip B. Gibbons, Michael Kozuch, Vasileios Liaskovitis, Anastassia Ailamaki, Guy E. Blelloch, Babak Falsafi, Limor Fix, Nikos Hardavellas, Todd C. Mowry, Chris Wilkerson	Scheduling threads for constructive cache sharing on CMPs.	SPAA	2007	DBLP DOI BibTeX RDF	constructive cache sharing, parallel depth first, thread granularity, working set profiling, chip multiprocessors, scheduling algorithms, work stealing
26	Jiyuan An, Yi-Ping Phoebe Chen	Finding Short Patterns to Classify Text Documents.	Web Intelligence	2006	DBLP DOI BibTeX RDF	rule generation, Document Categorization, breadth-first, depth-first
26	Mhand Hifi	Dynamic Programming and Hill-Climbing Techniques for Constrained Two-Dimensional Cutting Stock Problems.	J. Comb. Optim.	2004	DBLP DOI BibTeX RDF	dynamic programming, heuristics, hill-climbing, depth-first search, knapsacking, cutting stock
25	Roman Barták, Hana Rudová	Limited assignments: a new cutoff strategy for incomplete depth-first search.	SAC	2005	DBLP DOI BibTeX RDF	search, constraint satisfaction
25	Panagiota Fatourou	Low-contention depth-first scheduling of parallel computations with write-once synchronization variables.	SPAA	2001	DBLP DOI BibTeX RDF
25	Hideyuki Ohtani, Takuya Kida, Takeaki Uno, Hiroki Arimura	Efficient serial episode mining with minimal occurrences.	ICUIMC	2009	DBLP DOI BibTeX RDF	closed sequences, depth-first algorithm, frequent episode mining
25	Tamjidul Hoque, Madhu Chetty, Andrew Lewis, Abdul Sattar 0001	DFS Based Partial Pathways in GA for Protein Structure Prediction.	PRIB	2008	DBLP DOI BibTeX RDF	genetic algorithm, protein structure prediction, Depth-first search, lattice model
25	Wen-Li Wang, Mei-Huei Tang	User-Oriented Reliability Modeling for a Web System.	ISSRE	2003	DBLP DOI BibTeX RDF	User-Oriented Reliability Modeling, Transition Tree, Depth-First Traversal, Dynamic Programming, Flow Graph, Cyclomatic Complexity
25	Clifton Davis, Christoph F. Eick	A heuristic search based factoring tool.	ICTAI	2000	DBLP DOI BibTeX RDF	heuristic search based factoring tool, RSA cryptography, state-based search, heuristic formula, pseudo-smooth integers, security, cryptography, heuristic programming, depth first search, tree searching
25	Raul H. C. Lopes, Mark Tarver	Inducing Theorem Provers from Proofs.	ICTAI	1997	DBLP DOI BibTeX RDF	theorem prover induction, automatic theorem prover generation, proof examples, intuitionistic propositional calculus, depth-first search strategy, loop detection, inductive generalization, machine learning, theorem proving
25	Achim Weigel, S. Baumann, J. Rohrschneider	Lexical postprocessing by heuristic search and automatic determination of the edit costs.	ICDAR	1995	DBLP DOI BibTeX RDF	lexical postprocessing, edit costs determination, dictionary based lexical postprocessing, character hypotheses lattice, weighted edit distance, best word search, depth first traversal, iterative supervised automatic learning algorithm, character recognition, heuristic search, vocabulary, recognition rate, segmentation algorithm
25	Matthew S. Hecht, Jeffrey D. Ullman	Analysis of a Simple Algorithm for Global Flow Problems.	POPL	1973	DBLP DOI BibTeX RDF	available expressions, depth-first spanning tree, global data flow analysis, live variables, reducibility, dominance, code optimization, interval analysis, flow graph
25	Jakob Marolt, Simona Sinko, Tone Lerher	Model of a multiple-deep automated vehicles storage and retrieval system following the combination of Depth-First storage and Depth-First relocation strategies.	Int. J. Prod. Res.	2023	DBLP DOI BibTeX RDF
24	Russell L. Shackelford, Richard J. LeBlanc	Integrating "depth first" and "breadth first" models of computing curricula.	SIGCSE	1994	DBLP DOI BibTeX RDF
24	Pilar de la Torre, Clyde P. Kruskal	Polynomially Improved Efficiency for Fast Parallel Single-Source Lexicographic Depth-First Search, Breadth-First Search, and Topological-First Search.	Theory Comput. Syst.	2001	DBLP DOI BibTeX RDF
24	Pilar de la Torre, Clyde P. Kruskal	Fast and Efficient Parallel Algorithms for Single Source Lexicographic Depth-First Breadth-First Search and Topological-First Search.	ICPP (3)	1991	DBLP BibTeX RDF
24	Yugang Jia, Christophe Andrieu, Robert J. Piechocki, Magnus Sandell	Depth-First and Breadth-First Search Based Multilevel SGA Algorithms for Near Optimal Symbol Detection in MIMO Systems.	IEEE Trans. Wirel. Commun.	2008	DBLP DOI BibTeX RDF
23	William Yeoh 0001, Ariel Felner, Sven Koenig	IDB-ADOPT: A Depth-First Search DCOP Algorithm.	CSCLP	2008	DBLP DOI BibTeX RDF	Distributed Search Algorithms, ADOPT, Distributed Constraint Optimization, DCOP
22	Girija J. Narlikar	Scheduling Threads for Low Space Requirement and Good Locality.	Theory Comput. Syst.	2002	DBLP DOI BibTeX RDF
22	Franck Petit, Vincent Villain	Color Optimal Self-Stabilizing Depth-First Token Circulation.	ISPAN	1997	DBLP DOI BibTeX RDF	fault-tolerance, distributed systems, self-stabilization, mutual-exclusion, spanning trees, token circulation
22	Qiusun Ye	Realization of Depth-first Search Based AI Properties of VCR.	WKDD	2009	DBLP DOI BibTeX RDF
22	Franck Petit	Fast Self-Stabilizing Depth-First Token Circulation.	WSS	2001	DBLP DOI BibTeX RDF
22	David J. King, John Launchbury	Structuring Depth-First Search Algorithms in Haskell.	POPL	1995	DBLP DOI BibTeX RDF	Haskell
21	Mary Micco	An undergraduate curriculum in expert systems design or knowledge engineering.	ACM Conference on Computer Science	1987	DBLP DOI BibTeX RDF
21	Wilhelmiina Hämäläinen	Lift-based search for significant dependencies in dense data sets.	KDD Workshop on Statistical and Relational Learning in Bioinformatics	2009	DBLP DOI BibTeX RDF	association rules, redundancy, dependency analysis, depth-first search, statistical significance
21	Maofu Liu, Wenjie Li 0002, Xiaolong Zhang, Ji Zhang	Event-Based Summarization Using Critical Temporal Event Term Chain.	ICCPOL	2009	DBLP DOI BibTeX RDF	Event-Based Summarization, Event Term Graph, Temporal Event Term Chain, Depth-First Search Algorithm
21	Rajneesh Hegde	Finding 3-shredders efficiently.	ACM Trans. Algorithms	2006	DBLP DOI BibTeX RDF	four-connected, shredder, vertex cut, Depth-first search
21	Roderick Bloem, Harold N. Gabow, Fabio Somenzi	An Algorithm for Strongly Connected Component Analysis in n log n Symbolic Steps.	Formal Methods Syst. Des.	2006	DBLP DOI BibTeX RDF	language emptiness, Büchi automata, Streett automata, model checking, binary decision diagrams, depth-first search, breadth-first search, strongly connected components, symbolic algorithms
21	Shirish Tatikonda, Srinivasan Parthasarathy 0001, Tahsin M. Kurç	TRIPS and TIDES: new algorithms for tree mining.	CIKM	2006	DBLP DOI BibTeX RDF	Prufer sequences, depth first order codes, embedding lists, frequent patterns, tree mining
21	Chen-Yong Cher, Antony L. Hosking, T. N. Vijaykumar	Software prefetching for mark-sweep garbage collection: hardware analysis and software redesign.	ASPLOS	2004	DBLP DOI BibTeX RDF	buffered prefetch, prefetch-on-grey, garbage collection, prefetching, cache architecture, breadth-first, mark-sweep, depth-first
21	Thomas Erlebach, Torben Hagerup	Routing Flow Through a Strongly Connected Graph.	Algorithmica	2002	DBLP DOI BibTeX RDF	Feasible-flow problem, Strongly connected graph, Network flow, Analysis of algorithms, Depth-first search, Maximum-flow problem
21	Art Kazmierczak, Sridhar Radhakrishnan	An Optimal Distributed Ear Decomposition Algorithm with Applications to Biconnectivity and Outerplanarity Testing.	IEEE Trans. Parallel Distributed Syst.	2000	DBLP DOI BibTeX RDF	biconnectivity testing, outerplanarity testing, Distributed algorithm, message complexity, depth first search, ear decomposition
21	Juan-Carlos Amengual, Enrique Vidal 0001	Efficient Error-Correcting Viterbi Parsing.	IEEE Trans. Pattern Anal. Mach. Intell.	1998	DBLP DOI BibTeX RDF	Error-correcting parsing, depth-first topological sort, bucketsort, priority queues, sequence alignment, shape recognition, Viterbi algorithm, language processing, beam search
21	Valery M. Chelnokov, Victoria L. Zephyrova	Collective Phenomena in Hypertext Networks.	Hypertext	1997	DBLP DOI BibTeX RDF	SMIsC, cluster of meaning formed by hypertext nodes, coherent navigation, collective phenomena in populations of hypertext nodes, discourse macrostructure, discourse semantic coherence, hypertext statics and dynamics, hypertext-node macrostatus, spreading-activation search, Internet, Internet, depth-first search
21	Nader Bagherzadeh, Nayla Nassif, Shahram Latifi	A Routing and Broadcasting Scheme on Faulty Star Graphs.	IEEE Trans. Computers	1993	DBLP DOI BibTeX RDF	faulty star graphs, backtracking technique, faulty links, performance analysis, distributed algorithms, fault tolerant computing, shortest path, depth first search, routing scheme, optimal path, broadcasting scheme
21	Michel Billaud	Axiomatizations of Backtracking.	STACS	1992	DBLP DOI BibTeX RDF	foundations of logic programming, equivalence of program schemes, Prolog, backtracking, depth-first search, algebraic semantics, semantics of programming languages
21	Ming-Syan Chen, Kang G. Shin	Adaptive Fault-Tolerant Routing in Hypercube Multicomputers.	IEEE Trans. Computers	1990	DBLP DOI BibTeX RDF	adaptive fault tolerant routing, fault tolerant computing, multiprocessor interconnection networks, depth-first search, hypercube multicomputers
21	Shimon Even, Ami Litman, Peter Winkler 0001	Computing with Snakes in Directed Networks of Automata (Extended Abstract)	FOCS	1990	DBLP DOI BibTeX RDF	snakes', waking up, smart spanning trees, firing squad synchronization, protocols, finite-state automata, reporting, directed networks, breadth-first, depth-first
21	Philip N. Klein	Efficient Parallel Algorithms for Chordal Graphs	FOCS	1988	DBLP DOI BibTeX RDF	elimination ordering, optimal coloring, breadth-first search tree, depth-first search tree, parallel algorithms, interval graphs, chordal graphs, isomorphism, maximum independent set, maximum clique
21	Andrew V. Goldberg, Serge A. Plotkin, Pravin M. Vaidya	Sublinear-Time Parallel Algorithms for Matching and Related Problems	FOCS	1988	DBLP DOI BibTeX RDF	sublinear-time parallel algorithms, maximal node-disjoint paths, zero-one networks, matching, depth-first search, node-disjoint paths, combinatorial structure
21	Sukhamay Kundu	An O(V) algorithm M for computing transitive reduction of a planar acyclic digraph.	ACM Southeast Regional Conference	1982	DBLP DOI BibTeX RDF	planar digraph, transitive reduction, algorithm, depth-first search
20	Micah Adler, Brent Heeringa	Search Space Reductions for Nearest-Neighbor Queries.	TAMC	2008	DBLP DOI BibTeX RDF
20	Ivan Stojmenovic, Mark Russell, Bosko Vukojevic	Depth First Search and Location Based Localized Routing and QoS Routing in Wireless Networks.	ICPP	2000	DBLP DOI BibTeX RDF
19	Takashi Hirayama, Yasuaki Nishitani	Efficient Search Methods for Obtaining Exact Minimum AND-EXOR Expressions.	DELTA	2006	DBLP DOI BibTeX RDF
19	Yoshikazu Shima, Kouichi Hirata, Masateru Harao	Extraction of Frequent Few-Overlapped Monotone DNF Formulas with Depth-First Pruning.	PAKDD	2005	DBLP DOI BibTeX RDF
19	Armand Prieditis	Depth-First Branch-and-Bound vs. Depth-Bounded IDA*.	Comput. Intell.	1998	DBLP DOI BibTeX RDF
19	Neha Rungta, Eric G. Mercer	Generating Counter-Examples Through Randomized Guided Search.	SPIN	2007	DBLP DOI BibTeX RDF
19	Lars Arge, Norbert Zeh	I/O-Efficient Strong Connectivity and Depth-First Search for Directed Planar Graphs.	FOCS	2003	DBLP DOI BibTeX RDF
18	Andras Ferenczi, Costin Badica	An Implementation of Depth-First and Breadth-First Search Algorithms for Tip Selection in IOTA Distributed Ledger.	ACIIDS (1)	2022	DBLP DOI BibTeX RDF
18	Ziyu Chen, Chen He, Zhen He, Minyou Chen	BD-ADOPT: a hybrid DCOP algorithm with best-first and depth-first search strategies.	Artif. Intell. Rev.	2018	DBLP DOI BibTeX RDF
18	Thaer Samar, Myriam C. Traub, Jacco van Ossenbruggen, Arjen P. de Vries	Comparing Topic Coverage in Breadth-First and Depth-First Crawls Using Anchor Texts.	TPDL	2016	DBLP DOI BibTeX RDF
18	Emir Zunic, Almir Djedovic, B. Zunic	Software solution for optimal planning of sales persons work based on Depth-First Search and Breadth-First Search algorithms.	MIPRO	2016	DBLP DOI BibTeX RDF
18	Aske Plaat, Jonathan Schaeffer, Wim Pijls, Arie de Bruin	Best-First and Depth-First Minimax Search in Practice.	CoRR	2015	DBLP BibTeX RDF
18	Jianmin Zhang, Weixia Xu, Jun Zhang, ShengYu Shen, Zhengbin Pang, Tiejun Li, Jun Xia, Sikun Li	Finding First-Order Minimal Unsatisfiable Cores with a Heuristic Depth-First-Search Algorithm.	IDEAL	2011	DBLP DOI BibTeX RDF
18	Radu Marinescu 0002	Best-First vs. Depth-First AND/OR Search for Multi-objective Constraint Optimization.	ICTAI (1)	2010	DBLP DOI BibTeX RDF
18	André Körbes, Roberto de Alencar Lotufo	Analysis of the Watershed Algorithms Based on the Breadth-First and Depth-First Exploring Methods.	SIBGRAPI	2009	DBLP DOI BibTeX RDF
18	Rong Zhou 0001, Eric A. Hansen	Combining Breadth-First and Depth-First Strategies in Searching for Treewidth.	IJCAI	2009	DBLP BibTeX RDF
18	Andreas Auer, Hermann Kaindl	A Case Study of Revisiting Best-First vs. Depth-First Search.	ECAI	2004	DBLP BibTeX RDF
18	Thomas P. Murtagh	Teacing breadth-first depth-first.	ITiCSE	2001	DBLP DOI BibTeX RDF
18	Jens Clausen, Michael Perregaard	On the best search strategy in parallel branch-and-bound: Best-First Search versus Lazy Depth-First Search.	Ann. Oper. Res.	1999	DBLP DOI BibTeX RDF
18	Chong Jye Rhee, Y. Daniel Liang, Sudarshan K. Dhall, S. Lakshmivarahan	Efficient Algorithms for Finding Depth-First and Breadth-First Search Trees in Permutation Graphs.	Inf. Process. Lett.	1994	DBLP DOI BibTeX RDF
18	Jordi Tubella, Antonio González 0001	Combining depth-first and breadth-first search in Prolog execution.	GULP-PRODE (2)	1994	DBLP BibTeX RDF
18	Weixiong Zhang, Richard E. Korf	Depth-First vs. Best-First Search: New Results.	AAAI	1993	DBLP BibTeX RDF
18	Subir Bhattacharya, Amitava Bagchi	QuickGame: A Compromise Between Pure Depth-first and Pure Best-first Game Tree Search Strategies.	IWAR	1992	DBLP BibTeX RDF
18	Martin E. Dyer, Alan M. Frieze	Probabilistic Analysis of a Parallel Algorithm for Finding the Lexicographically First Depth First Search Tree in a Dense Random Graph.	Random Struct. Algorithms	1991	DBLP DOI BibTeX RDF
18	Nageshwara Rao Vempaty, Vipin Kumar 0001, Richard E. Korf	Depth-First Versus Best-First Search.	AAAI	1991	DBLP BibTeX RDF
18	Vasileios Liaskovitis, Shimin Chen, Phillip B. Gibbons, Anastassia Ailamaki, Guy E. Blelloch, Babak Falsafi, Limor Fix, Nikos Hardavellas, Michael Kozuch, Todd C. Mowry, Chris Wilkerson	Parallel depth first vs. work stealing schedulers on CMP architectures.	SPAA	2006	DBLP DOI BibTeX RDF	scheduling, caches, chip multiprocessors
18	Qinghua Zou, Wesley W. Chu, Baojing Lu	SmartMiner: A Depth First Algorithm Guided by Tail Information for Mining Maximal Frequent Itemsets.	ICDM	2002	DBLP DOI BibTeX RDF
17	Akihiro Kishimoto, Martin Müller 0003	About the Completeness of Depth-First Proof-Number Search.	Computers and Games	2008	DBLP DOI BibTeX RDF
17	Jakub Pawlewicz, Lukasz Lew	Improving Depth-First PN-Search: 1 + epsilon Trick.	Computers and Games	2006	DBLP DOI BibTeX RDF
17	Zhenjiang Li, J. J. Garcia-Luna-Aceves	Solving The Multi-Constrained Path Selection Problem By Using Depth First Search.	QSHINE	2005	DBLP DOI BibTeX RDF
17	Joxan Jaffar, Andrew E. Santosa, Roland H. C. Yap, Kenny Qili Zhu	Scalable Distributed Depth-First Search with Greedy Work Stealing.	ICTAI	2004	DBLP DOI BibTeX RDF
17	Walter A. Kosters, Wim Pijls, Viara Popova	Complexity Analysis of Depth First and FP-Growth Implementations of APRIORI.	MLDM	2003	DBLP DOI BibTeX RDF
17	Hanan Samet	Depth-first k-nearest neighbor finding using the MaxNearestDist estimator.	ICIAP	2003	DBLP DOI BibTeX RDF
17	Catharine M. Wyss, Chris Giannella, Edward L. Robertson	FastFDs: A Heuristic-Driven, Depth-First Algorithm for Mining Functional Dependencies from Relation Instances - Extended Abstract.	DaWaK	2001	DBLP DOI BibTeX RDF