BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Australia
1 × Canada
1 × Denmark
1 × Finland
1 × Italy
1 × Poland
1 × Portugal
1 × Spain
1 × Sweden
1 × Switzerland
1 × The Netherlands
1 × United Kingdom
2 × Greece
9 × USA
Collaborated with:
G.H.Gonnet S.S.Rao P.V.Poblete A.Farzan R.Raman K.Mehlhorn M.He W.Cunto H.Suwanda D.P.Dobkin J.Cardinal S.Fiorini G.Joret R.M.Jungers Y.Nekrich J.S.Vitter T.Hagerup R.G.Karlsson E.L.Robertson K.Kaligosi P.Sanders V.Raman S.Durocher P.K.Nicholson M.Skala L.Arge M.A.Bender E.D.Demaine B.Holland-Minkley
Talks about:
succinct (5) algorithm (4) tree (4) structur (3) select (3) optim (3) rang (3) data (3) represent (2) implicit (2)

Person: J. Ian Munro

DBLP DBLP: Munro:J=_Ian

Contributed to:

PODS 20152015
ICALP (1) 20122012
ICALP (1) 20112011
STOC 20102010
ICALP (1) 20092009
STOC 20092009
ICALP 20072007
ICALP 20052005
ICALP 20042004
ICALP 20032003
STOC 20022002
ICALP 19931993
STOC 19871987
ICALP 19851985
STOC 19841984
ICALP 19831983
PODS 19831983
ICALP 19821982
STOC 19811981
STOC 19791979
ICALP 19781978
STOC 19771977
STOC 19711971

Wrote 23 papers:

PODS-2015-MunroNV #data type #documentation #graph
Dynamic Data Structures for Document Collections and Graphs (JIM, YN, JSV), pp. 277–289.
ICALP-v1-2012-FarzanMR #orthogonal #query
Succinct Indices for Range Queries with Applications to Orthogonal Range Maxima (AF, JIM, RR), pp. 327–338.
ICALP-v1-2011-DurocherHMNS #constant #linear
Range Majority in Constant Time and Linear Space (SD, MH, JIM, PKN, MS), pp. 244–255.
STOC-2010-CardinalFJJM #algorithm #sorting
Sorting under partial information (without the ellipsoid algorithm) (JC, SF, GJ, RMJ, JIM), pp. 359–368.
ICALP-v1-2009-FarzanM #order
Dynamic Succinct Ordered Trees (AF, JIM), pp. 439–450.
STOC-2009-CardinalFJJM #algorithm #partial order #performance
An efficient algorithm for partial order production (JC, SF, GJ, RMJ, JIM), pp. 93–100.
Succinct Ordinal Trees Based on Tree Covering (MH, JIM, SSR), pp. 509–520.
ICALP-2005-KaligosiMMS #multi #towards
Towards Optimal Multiple Selection (KK, KM, JIM, PS), pp. 103–114.
Succinct Representations of Functions (JIM, SSR), pp. 1006–1015.
ICALP-2003-MunroRRR #permutation
Succinct Representations of Permutations (JIM, RR, VR, SSR), pp. 345–356.
STOC-2002-ArgeBDHM #algorithm #graph #queue
Cache-oblivious priority queue and graph algorithm applications (LA, MAB, EDD, BHM, JIM), pp. 268–276.
ICALP-1993-HagerupMM #maintenance #probability
Maintaining Discrete Probability Distributions Optimally (TH, KM, JIM), pp. 253–264.
Searching a Two Key Table Under a Single Key (JIM), pp. 383–387.
ICALP-1985-KarlssonMR #bound #nearest neighbour #problem
The Nearest Neighbor Problem on Bounded Domains (RGK, JIM, ELR), pp. 318–327.
Average Case Selection (WC, JIM), pp. 369–375.
ICALP-1983-MunroP #data type
Searchability in Merging and Implicit Data Structures (JIM, PVP), pp. 527–535.
PODS-1983-MunroP #reduction #robust
A Discipline for Robustness or Storage Reduction in Binary Search Trees (JIM, PVP), pp. 70–75.
Heaps on Heaps (GHG, JIM), pp. 282–291.
STOC-1981-GonnetM #analysis #linear
A Linear Probing Sort and its Analysis (GHG, JIM), pp. 90–95.
STOC-1979-MunroS #data type
Implicit Data Structures (JIM, HS), pp. 108–117.
ICALP-1978-DobkinM #bound #problem
Time and Space Bounds for Selection Problems (DPD, JIM), pp. 192–204.
STOC-1977-GonnetM #analysis
The Analysis of an Improved Hashing Technique (GHG, JIM), pp. 113–121.
STOC-1971-Munro #algorithm #performance
Some Results Concerning Efficient and Optimal Algorithms (JIM), pp. 40–44.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.