A space efficient distributive sortHANDLEY, C. C.Information processing letters. 1991, Vol 37, Num 2, pp 75-78, issn 0020-0190, 4 p.Article

A note on the density of oracle decreasing time-space complexityDURIS, P; ROLIM, J. D. P.Theoretical computer science. 1994, Vol 132, Num 1-2, pp 435-444, issn 0304-3975Article

A note on almost-everywhere-complex sets and separating deterministic-time-complexity classesGESKE, J. G; HUYNH, D. T; SEIFERAS, J. I et al.Information and computation (Print). 1991, Vol 92, Num 1, pp 97-104, issn 0890-5401, 8 p.Article

On the complexity of rankingHEMACHANDRA, L. A; RUDICH, S.Journal of computer and system sciences (Print). 1990, Vol 41, Num 2, pp 251-271, issn 0022-0000, 21 p.Article

Message terminating algorithms for anonymous rings of unknown sizeCIDON, I; SHAVITT, Y.Information processing letters. 1995, Vol 54, Num 2, pp 111-119, issn 0020-0190Article

Query learning of bounded-width OBDDsNAKAMURA, A.Theoretical computer science. 2000, Vol 241, Num 1-2, pp 83-114, issn 0304-3975Article

Oracles for deterministic versus alternating classesGASARCH, W.SIAM journal on computing (Print). 1987, Vol 16, Num 4, pp 613-627, issn 0097-5397Article

Machine characterizations of the classes of the W-hierarchyCHEN, Yijia; FLUM, Jörg.Lecture notes in computer science. 2003, pp 114-127, issn 0302-9743, isbn 3-540-40801-0, 14 p.Conference Paper

Exact learning via teaching assistantsARVIND, V; VINODCHANDRAN, N. V.Theoretical computer science. 2000, Vol 241, Num 1-2, pp 51-81, issn 0304-3975Article

Efficient algorithms for the temporal precedence problemRANJAN, D; PONTELLI, E; GUPTA, G et al.Information processing letters. 1998, Vol 68, Num 2, pp 71-78, issn 0020-0190Article

An inherently iterative computation of Ackermann's functionGROSSMAN, J. W; ZEITMAN, R. S.Theoretical computer science. 1988, Vol 57, Num 2-3, pp 327-330, issn 0304-3975Article

A positive relativization of polynomial time versus polylog spaceGAVALDA, R.Information processing letters. 1993, Vol 46, Num 3, pp 119-123, issn 0020-0190Article

The PL hierarchy collapsesOGIHARA, M.SIAM journal on computing (Print). 1998, Vol 27, Num 5, pp 1430-1437, issn 0097-5397Article

Lower bounds for the low hierarchyALLENDER, E; HEMACHANDRA, L. A.Journal of the Association for Computing Machinery. 1992, Vol 39, Num 1, pp 234-251, issn 0004-5411Article

On sparse oracles separating feasible complexity classesHARTMANIS, J; HEMACHANDRA, L.Information processing letters. 1988, Vol 28, Num 6, pp 291-295, issn 0020-0190Article

On characterizations of the class PSPACE/polyBALCAZAR, J. L; DIAZ, J; GABARRO, J et al.Theoretical computer science. 1987, Vol 52, Num 3, pp 251-267, issn 0304-3975Article

On relativizations with restricted number of accesses to the oracle setZIMAND, M.Mathematical systems theory. 1987, Vol 20, Num 1, pp 1-11, issn 0025-5661Article

From Almost Optimal Algorithms to Logics for Complexity Classes via Listings and a Halting ProblemYIJIA CHEN; JORG FLUM.Journal of the Association for Computing Machinery. 2012, Vol 59, Num 4, issn 0004-5411, 17.1-17.34Article

A novel heterogeneous framework for stereo matchingDE-MAEZTU, Leonardo; MATTOCCIA, Stefano; VILLANUEVA, Arantxa et al.Image processing, computer vision, & pattern recognition. International conferenceWorldComp'2011. 2011, pp 293-299, isbn 1-60132-189-9 1-60132-190-2 1-60132-191-0, 7 p.Conference Paper

A faster FPT algorithm for finding spanning trees with many leavesBONSMA, Paul S; BRUEGGEMANN, Tobias; WOEGINGER, Gerhard J et al.Lecture notes in computer science. 2003, pp 259-268, issn 0302-9743, isbn 3-540-40671-9, 10 p.Conference Paper

Partial evaluation of the Euclidean algorithm, revisitedLEE, C. S.Higher-order and symbolic computation. 1999, Vol 12, Num 2, pp 203-212, issn 1388-3690Article

A downward collapse within the polynomial hierarchyHEMASPAANDRA, E; HEMASPAANDRA, L. A; HEMPEL, H et al.SIAM journal on computing (Print). 1999, Vol 28, Num 2, pp 383-393, issn 0097-5397Article

A more efficient notion of zigzag stabilityLE SAËC, B; LITOVSKY, I; PATROU, B et al.Informatique théorique et applications (Imprimé). 1996, Vol 30, Num 3, pp 181-194, issn 0988-3754Article

An Improved Algorithm for Sequence Pair GenerationMINGXU HUO; KOUBAO DING.Lecture notes in computer science. 2006, pp 482-489, issn 0302-9743, isbn 3-540-34379-2, 8 p.Conference Paper

Homogenization and the Polynomial CalculusBURESH-OPPENHEIM, J; PITASSI, T; CLEGG, M et al.Lecture notes in computer science. 2000, pp 926-937, issn 0302-9743, isbn 3-540-67715-1Conference Paper