Backtracking

Backtracking

Cached

Download Links

[www.info.uniroma2.it]

Other Repositories/Bibliography

DBLP

by Alberto Apostolico , Giuseppe F. Italiano

BibTeX

@MISC{Apostolico_backtracking,
    author = {Alberto Apostolico and Giuseppe F. Italiano},
    title = {Backtracking},
    year = {}
}

Bookmark

OpenURL

Abstract

Citations

7321	Introduction to Algorithms - Cormen, Leiserson, et al. - 2001
2172	The Design and Analysis of Computer Algorithms - Aho, Hopcroft, et al. - 1974
644	Data Structures and Algorithms - Aho, Hopcroft, et al. - 1983
206	The art of computer programming Vol. 1: Fundamental algorithms - Knuth - 1997
182	Design and implementation of an efficient priority queue - Boas, Kaas, et al. - 1977
140	Login: A Logic Programming Language with Built-in Inheritance - Aït-Kaci, Nasr - 1986
134	TG: A Fast Algorithm for Computing Longest Common Subsequences - JW, Szymanski - 1977
129	Amortized computational complexity - Tarjan - 1985
120	Should tables be sorted - Yao - 1981
119	The cell probe complexity of dynamic data structures - Fredman, Saks - 1989
116	Introduction to Logic Programming - Hogger - 1984
102	Leeuwen. Worst-case analysis of set union algorithms - Tarjan, Van - 1984
76	A class of algorithms which require nonlinear time to maintain disjoint sets - Tarjan - 1979
73	Testing flow graph reducibility - Tarjan - 1974
71	Preserving order in a forest in less than logarithmic time - Boas - 1978
54	An algebraic semantics approach to the effective resolution of type equations - Aït-Kaci - 1986
53	Résolution d’équations dans les langages d’ordre 1 - Huet - 1976
47	Finding dominators in directed graphs - Tarjan - 1974
42	The longest common subsequence problem revisited - Apostolico, Guerra - 1987
42	Data structures and algorithms for disjoint set union problems - Galil, Italiano - 1991
42	Multi dimensional searching and computational geometry, volume 3 of Data structures and algorithms - Mehlhorn - 1984
39	G.F.: Sparse dynamic programming i: linear cost functions - Eppstein, Galil, et al. - 1992
37	Maintaining bridge-connected and biconnected components on-line - Westbrook, Tarjan - 1992
32	New classes for parallel complexity: a study of unification and other complete problems for P - Vitter, Simons - 1986
27	A scaling algorithm for weighted matching on general graphs - Gabow - 1985
27	Set merging algorithms - Hopcroft, Ullman - 1973
26	A linear time algorithm for a special case of disjoint set union - Gabow, Tarjan - 1985
25	Tarjan, Efficiency of a Good but not Linear Set Union Algorithm - E - 1975
22	Prolog - the language and its implementation compared with Lisp - Warren, Pereira, et al. - 1977
21	Dynamic fractional cascading. Algorithmica - Mehlhorn, Nher - 1990
17	An improved equivalence algorithm - Galler, Fisher - 1964
17	Data Structures and Algorithms, Vol. 1: Sorting and Searching - Mehlhorn - 1984
16	A linear algorithm for testing equivalence of finite automata - Hopcroft, Karp - 1971
15	A lower bound on the complexity of the union-split-find problem - Mehlhorn, Näher, et al. - 1988
15	Tarjan, Amortized Analysis of Algorithms for Set Union with Backtracking - Westbrook, E - 1989
14	Algorithms in a restricted universe - Karlsson - 1985
10	Lower bounds for the union-find and the split-find problem on pointer machines - Poutré - 1996
9	On Pointers versus Addresses - Ben-Amran, Galil - 1992
9	Linearity and unprovability of set union problem strategies. I. Linearity of strong postorder - Loebl, Ne˘set˘ril - 1997
8	Tarjan, "Faster algorithms for the shortest path problem - Ahuja, Mehlhorn, et al. - 1990
7	E.: The set union problem with backtracking - Mannila, Ukkonen - 1986
6	On the single operation worst-case time complexity of the disjoint set union problem - Blum - 1986
6	Tarjan, Applications of path compression on balanced trees - E - 1979
5	Zum Hilbertshen aufbau der reelen zahlen - Ackermann - 1928
5	On computing least common ancestors in trees - Aho, Hopcroft, et al. - 1973
4	The set union problem with unlimited backtracking - Apostolico, Italiano, et al. - 1994
3	A note on set union with arbitrary deunions - Galil, Italiano - 1991
3	Depth m search in branch and bound algorithms - Ibaraki - 1978
3	Dynamic segment intersection with applications, in - Imai, Asano - 1984
3	On the Complexity of Unification Sequences - Mannila - 1986