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

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

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

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

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

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

Simulation of d'-dimensional cellular automata on d-dimensional cellular automataSCHEBEN, Christoph.Lecture notes in computer science. 2006, pp 131-140, issn 0302-9743, isbn 3-540-40929-7, 1Vol, 10 p.Conference Paper

Evaluations of domino-free communication-induced checkpointing protocolsJICHIANG TSAI; WANG, Y.-M; KUO, S.-Y et al.Information processing letters. 1999, Vol 69, Num 1, pp 31-37, issn 0020-0190Article

Parameterizing above Guaranteed Values : Maxsat and MaxCutMAHAJAN, M; RAMAN, V.Journal of algorithms (Print). 1999, Vol 31, Num 2, pp 335-354, issn 0196-6774Article

Uniformly defining complexity classes of functionsKOSUB, S; SCHMITZ, H; VOLLMER, H et al.Lecture notes in computer science. 1998, pp 607-617, issn 0302-9743, isbn 3-540-64230-7Conference Paper

Space and time complexity of exact algorithms: Some open problemsWOEGINGER, Gerhard J.Lecture notes in computer science. 2004, pp 281-290, issn 0302-9743, isbn 3-540-23071-8, 10 p.Conference Paper

Multiple genome alignment: Chaining algorithms revisitedABOUELHODA, Mohamed Ibrahim; OHLEBUSCH, Enno.Lecture notes in computer science. 2003, pp 1-16, issn 0302-9743, isbn 3-540-40311-6, 16 p.Conference Paper

On approximating polygonal curves in two and three dimensionsEU, D; TOUSSAINT, G. T.CVGIP. Graphical models and image processing. 1994, Vol 56, Num 3, pp 231-246, issn 1049-9652Article

Another adaptive distributed shortest path algorithmHUMBLET, P. A.IEEE transactions on communications. 1991, Vol 39, Num 6, pp 995-1003, issn 0090-6778, 9 p.Article