Pascal and Francis Bibliographic Databases

Help

Search results

Your search

au.\*:("MUNRO JI")

Results 1 to 17 of 17

  • Page / 1
Export

Selection :

  • and

AN MULTIKEY SEARCH PROBLEM (PRELIMINARY DRAFT)MUNRO JI.sdANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING. 17/1979/MONTICELLO IL; USA; URBANA-CHAMPAIGN: UNIVERSITY OF ILLINOIS; DA. S.D.; PP. 241-244; BIBL. 4 REF.Conference Paper

HEAPS ON HEAPSMUNRO JI.1982; LECTURE NOTES IN COMPUTER SCIENCE; ISSN 0302-9743; DEU; DA. 1982; VOL. 140; PP. 282-291; BIBL. 4 REF.Conference Paper

TIME AND SPACE BOUNDS FOR SELECTION PROBLEMS.DOBKIN D; MUNRO JI.1978; LECTURE NOTES COMPUTER SCI.; GERM.; DA. 1978; NO 62; PP. 192-204; BIBL. 10 REF.; (AUTOM. LANG. PROGRAM. COLLOQ. 5; UDINE; 1978)Conference Paper

IMPLICIT DATA STRUCTURES FOR FAST SEARCH AND UPDATEMUNRO JI; SUWANDA H.1980; J. COMPUT. SYST. SCI.; ISSN 0022-0000; USA; DA. 1980; VOL. 21; NO 2; PP. 236-250; BIBL. 7 REF.Article

SELECTION AND SORTING WITH LIMITED STORAGEMUNRO JI; PATERSON MS.1980; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1980; VOL. 12; NO 3; PP. 315-323; BIBL. 3 REF.Article

EFFICIENT ORDERING OF HASH TABLESGONNET GH; MUNRO JI.1979; S.I.A.M.J. COMPUTG; USA; DA. 1979; VOL. 8; NO 3; PP. 463-478; BIBL. 13 REF.Article

PARALLEL ALGORITHMS AND SERIAL DATA STRUCTURES (PRELIMINARY DRAFT)MUNRO JI; ROBERTSON EL.sdANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING. 17/1979/MONTICELLO IL; USA; URBANA-CHAMPAIGN: UNIVERSITY OF ILLINOIS; DA. S.D.; PP. 21-26; BIBL. 7 REF.Conference Paper

OPTIMAL TIME MINIMAL SPACE SELECTION ALGORITHMSDOBKIN D; MUNRO JI.1981; J. ASSOC. COMPUT. MACH.; ISSN 0004-5411; USA; DA. 1981; VOL. 28; NO 3; PP. 454-461; BIBL. 5 REF.Article

REDUCING SPACE REQUIREMENTS FOR SHORTEST PATH PROBLEMS = REDUCTION DES BESOINS D'ESPACE POUR LES PROBLEMES DE PLUS COURT CHEMINMUNRO JI; RAMIREZ RJ.1982; OPER. RES.; ISSN 0030-364X; USA; DA. 1982; VOL. 30; NO 5; PP. 1009-1013; BIBL. 7 REF.Article

CONTINUAL PATTERN REPLICATIONMUNRO JI; ROBERTSON EL.1981; INFORM. CONTROL; ISSN 0019-9958; USA; DA. 1981; VOL. 48; NO 3; PP. 211-220; BIBL. 2 REF.Article

DESIGNING OVERLAY STRUCTURES.GENTLEMAN WM; MUNRO JI.1977; SOFTWARE-PRACT. EXPER.; G.B.; DA. 1977; VOL. 7; NO 4; PP. 493-500; BIBL. 8 REF.Article

A LINEAR PROBING SORT AND ITS ANALYSISGONNET GH; MUNRO JI.1981; ANNUAL ASSOCIATION FOR COMPUTING MACHINERY SYMPOSIUM ON THEORY OF COMPUTING. 13/1981/MILWAUKEE WI; USA; NEW YORK: ASSOCIATION FOR COMPUTING MACHINERY; DA. 1981; PP. 90-95; BIBL. 10 REF.Conference Paper

DETERMINING THE MODEDOBKIN D; MUNRO JI.1980; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1980; VOL. 12; NO 3; PP. 255-263; BIBL. 10 REF.Article

OPTIMUM REORGANIZATION POINTS FOR ARBITRARY DATABASE COSTSRAMIREZ RJ; TOMPA FW; MUNRO JI et al.1982; ACTA INFORMATICA; ISSN 0001-5903; DEU; DA. 1982; VOL. 18; NO 1; PP. 17-30; BIBL. 5 REF.Article

EXEGESIS OF SELF-ORGANIZING LINEAR SEARCHGONNET GH; MUNRO JI; SUWANDA H et al.1981; SIAM J. COMPUT.; ISSN 0097-5397; USA; DA. 1981; VOL. 10; NO 3; PP. 613-637; BIBL. 12 REF.Article

TOWARD SELF-ORGANIZING LINEAR SEARCHGONNET GH; MUNRO JI; SUWANDA H et al.1979; ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE. 20/1979/SAN JUAN P.R.; USA; NEW YORK: INSTITUTE OF ELECTRICAL AND ELECTRONICS ENGINEERS; DA. 1979; PP. 169-174; BIBL. 8 REF.Conference Paper

PARTIAL MATCH RETRIEVAL IN IMPLICIT DATA STRUCTURESALT H; MEHLHORN K; MUNRO JI et al.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 118; PP. 156-161; BIBL. 8 REF.Conference Paper

  • Page / 1