Linear-Time Construction of Two-Dimensional Suffix TreesDONG KYUE KIM; JOONG CHAE NA; JEONG SEOP SIM et al.Algorithmica. 2011, Vol 59, Num 2, pp 269-297, issn 0178-4617, 29 p.Article

Data exchange optimization in reconfigurable binary treesKARTASHEV, S. P; KARTASHEV, S. I.IEEE transactions on computers. 1986, Vol 35, Num 3, pp 257-273, issn 0018-9340Article

Exact balancing is not always goodSNIR, M.Information processing letters. 1986, Vol 22, Num 2, pp 97-102, issn 0020-0190Article

Exact solution of a minimal recurrenceCHANG, K.-N; TSAI, S.-C.Information processing letters. 2000, Vol 75, Num 1-2, pp 61-64, issn 0020-0190Article

Maximum independent set for intervals by divide and conquer with pruningSNOEYINK, Jack.Networks (New York, NY). 2007, Vol 49, Num 2, pp 158-159, issn 0028-3045, 2 p.Article

On the balanced divide and conquer equationBATAGELJ, V.International journal of computer mathematics. 1986, Vol 19, Num 3-4, pp 259-266, issn 0020-7160Article

Graph separator algorithms: A refined analysisFERNAU, Henning.Lecture notes in computer science. 2002, pp 186-197, issn 0302-9743, isbn 3-540-00331-2, 12 p.Conference Paper

Multikey QuickselectFRIAS, Leonor; ROURA, Salvador.Algorithmica. 2014, Vol 69, Num 4, pp 958-973, issn 0178-4617, 16 p.Article

The solution of linear probabilistic recurrence relationsBAZZI, Louay; MITTER, Sanjoy.Algorithmica. 2003, Vol 36, Num 1, pp 41-57, issn 0178-4617, 17 p.Article

Divide-and-Conquer Algorithms for Partitioning Hypergraphs and Submodular SystemsOKUMOTO, Kazumasa; FUKUNAGA, Takuro; NAGAMOCHI, Hiroshi et al.Algorithmica. 2012, Vol 62, Num 3-4, pp 787-806, issn 0178-4617, 20 p.Article

A simple expected running time analysis for randomized divide and conquer algorithmsDEAN, Brian C.Discrete applied mathematics. 2006, Vol 154, Num 1, pp 1-5, issn 0166-218X, 5 p.Article

Optimal algorithms for constructing knight's tours on arbitrary n×m chessboardsLIN, Shun-Shii; WEI, Chung-Liang.Discrete applied mathematics. 2005, Vol 146, Num 3, pp 219-232, issn 0166-218X, 14 p.Article

Task allocation onto a hypercube by recursive mincut bipartitioningERCAL, F; RAMANUJAM, J; SADAYAPPAN, P et al.Journal of parallel and distributed computing (Print). 1990, Vol 10, Num 1, pp 35-44, issn 0743-7315, 10 p.Article

Building executable union slices using conditioned slicingDANICIC, Sebastian; DE LUCIA, Andrea; HARMAN, Mark et al.International Workshop on Program Comprehension. 2004, pp 89-97, isbn 0-7695-2149-5, 1Vol, 9 p.Conference Paper

A divide and conquer algorithm for computing singular valuesCHANDRASEKARAN, S; IPSEN, I. C. F.Zeitschrift für angewandte Mathematik und Mechanik. 1994, Vol 74, Num 6, pp T532-T534, issn 0044-2267Article

A parallel multistage method for surface/surface intersectionBÜRGER, H; SCHABACK, R.Computer aided geometric design. 1993, Vol 10, Num 3-4, pp 277-291, issn 0167-8396Conference Paper

Solution of a divide-and-conquer maximin recurrenceZHIYUAN LI; REINGOLD, E. M.SIAM journal on computing (Print). 1989, Vol 18, Num 6, pp 1188-1200, issn 0097-5397Article

MultiMCS: A Fast Algorithm for the Maximum Common Substructure Problem on Multiple MoleculesHARIHARAN, Ramesh; JANAKIRAMAN, Anand; NILAKANTAN, Ramaswamy et al.Journal of chemical information and modeling. 2011, Vol 51, Num 4, pp 788-806, issn 1549-9596, 19 p.Article

A lambda-calculus with constructorsARBISER, Ariel; MIQUEL, Alexandre; RIOS, Alejandro et al.Lecture notes in computer science. 2006, pp 181-196, issn 0302-9743, isbn 3-540-36834-5, 1Vol, 16 p.Conference Paper

Abstract modularityABBOTT, Michael; GHANI, Neil; LÜTH, Christoph et al.Lecture notes in computer science. 2005, pp 46-60, issn 0302-9743, isbn 3-540-25596-6, 15 p.Conference Paper

Fast algorithms through divide- and combine-and-conquer strategiesPEREZ-JORDA, J. M.Computer physics communications. 1999, Vol 117, Num 3, pp 239-240, issn 0010-4655Article

DeWall : A fast divide and conquer Delaunay triangulation algorithm in E^dCIGNONI, P; MONTANI, C; SCOPIGNO, R et al.Computer-aided design. 1998, Vol 30, Num 5, pp 333-341, issn 0010-4485Article

Hypercube matrix multiplicationNELSON, P. A.Parallel computing. 1993, Vol 19, Num 7, pp 777-788, issn 0167-8191Article

Applications of a strategy for designing divide-and-conquer algorithmsSMITH, D. R; DARLINGTON, J.Science of computer programming. 1987, Vol 8, Num 3, pp 213-229, issn 0167-6423Article

The one-dimensional weighted Voronoi diagramAURENHAMMER, F.Information processing letters. 1986, Vol 22, Num 3, pp 119-123, issn 0020-0190Article