Panty OBDDs cannot be handled efficiently enoughLÖBBING, M; SIELING, D; WEGENER, I et al.Information processing letters. 1998, Vol 67, Num 4, pp 163-168, issn 0020-0190Article

Test sequence generation from the protocol data portion based on the Selecting Chinese Postman algorithmCHEN, W.-H.Information processing letters. 1998, Vol 65, Num 5, pp 261-268, issn 0020-0190Article

Ray shooting amidst spheres in three dimensions and related problemsMOHABAN, S; SHARIR, M.SIAM journal on computing (Print). 1997, Vol 26, Num 3, pp 654-674, issn 0097-5397Article

A common information structure for broadcast applicationsBOETJE, J; COLLIER, D.SMPTE journal (1976). 1997, Vol 106, Num 10, pp 682-697, issn 0036-1682Conference Paper

Efficiently planning compliant motion in the planeFRIEDMAN, J; HERSHBERGER, J; SNOEYINK, J et al.SIAM journal on computing (Print). 1996, Vol 25, Num 3, pp 562-599, issn 0097-5397Article

Analyzing self-adjusting linear list algorithms with deletions and unsuccessful searchesLUCAS CHI KWONG HUI; MARTEL, C. U.Information processing letters. 1996, Vol 58, Num 5, pp 231-236, issn 0020-0190Article

Algorithms for three-dimensional dominance searching in linear spaceMAKRIS, C; TSAKALIDIS, A.Information processing letters. 1998, Vol 66, Num 6, pp 277-283, issn 0020-0190Article

A time and space efficient data structure for string searching on large textsCOLUSSI, L; DE COL, A.Information processing letters. 1996, Vol 58, Num 5, pp 217-222, issn 0020-0190Article

Study on Cadastral Basic Attribute Data Structure Based on Man-land RelationshipCHANGGEN ZHAN; YAOLIN LIU.Proceedings of SPIE, the International Society for Optical Engineering. 2009, Vol 7492, issn 0277-786X, isbn 978-0-8194-7803-0 0-8194-7803-2, 74924Z.1-74924Z.8, 3Conference Paper

A technique for adding range restrictions to generalized searching problemsGUPTA, P; JANARDAN, R; SMID, M et al.Information processing letters. 1997, Vol 64, Num 5, pp 263-269, issn 0020-0190Article

The tree model for hashing : Lower and upper boundsGIL, J; MEYER AUF DER HEIDE, F; WIGDERSON, A et al.SIAM journal on computing (Print). 1996, Vol 25, Num 5, pp 936-955, issn 0097-5397Article

Proof lengths for equational completionPLAISTED, D. A; SATTLER-KLEIN, A.Information and computation (Print). 1996, Vol 125, Num 2, pp 154-170, issn 0890-5401Article

Proofs by annotations for a simple data-parallel languageBoug, Luc; Cachera, David.1995, 19 p.Report

Data structures for geometric and topological aspects of finite element algorithmsGROSS, P. W; KOTIUGA, P. R.Journal of electromagnetic waves and applications. 2001, Vol 15, Num 2, pp 257-258, issn 0920-5071Article

Dynamic text indexing under string updatesFERRAGINA, P.Journal of algorithms (Print). 1997, Vol 22, Num 2, pp 296-328, issn 0196-6774Article

Fast and compact dispatching for dynamic object-oriented languagesQUEINNEC, C.Information processing letters. 1997, Vol 64, Num 6, pp 315-321, issn 0020-0190Article

The robot localization problemGUIBAS, L. J; MOTWANI, R; RAGHAVAN, P et al.SIAM journal on computing (Print). 1997, Vol 26, Num 4, pp 1120-1138, issn 0097-5397Article

A uniform approach to the analysis of trie structures that store prefixing-keysDE LA TORRE, P; KAO, D. T.Journal of algorithms (Print). 1997, Vol 22, Num 2, pp 270-295, issn 0196-6774Article

Repetitive hidden surface removal for polyhedraPELLEGRINI, M.Journal of algorithms (Print). 1996, Vol 21, Num 1, pp 80-101, issn 0196-6774Article

A note on the expected path length of trees with known fringeDE PRISCO, R; PARLATI, G; PERSIANO, G et al.Information processing letters. 1996, Vol 59, Num 6, pp 309-315, issn 0020-0190Article

A tight lower bound for top-down skew heapsSCHOENMAKERS, B.Information processing letters. 1997, Vol 61, Num 5, pp 279-284, issn 0020-0190Article

Dynamic ray shooting and shortest paths in planar subdivisions via balanced geodesic triangulationsGOODRICH, M. T; TAMASSIA, R.Journal of algorithms (Print). 1997, Vol 23, Num 1, pp 51-73, issn 0196-6774Article

Storage-efficient data structure for large lookup dictionariesMALHORTA, V. M; SRINIVASAN, B; KULKARNI, S et al.Information processing letters. 1996, Vol 58, Num 4, pp 201-206, issn 0020-0190Article

Efficient Huffman decodingCHUNG, K.-L.Information processing letters. 1997, Vol 61, Num 2, pp 97-99, issn 0020-0190Article

On point location and motion planning among simplicesPELLEGRINI, M.SIAM journal on computing (Print). 1996, Vol 25, Num 5, pp 1061-1081, issn 0097-5397Article