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 × Austria
1 × Germany
1 × Iceland
1 × Italy
1 × Switzerland
2 × Canada
7 × USA
Collaborated with:
L.A.Goldberg M.J.Fischer T.M.Przytycka F.F.Yao U.Zwick M.N.Wegman M.E.Dyer S.Kelk N.A.Lynch W.L.Ruzzo L.Snyder A.R.Meyer R.V.Book M.Nivat M.Adler F.E.Fich M.Jerrum S.Kannan S.Muthukrishnan S.C.Sahinalp T.Suel K.Iwama H.Nishimura R.Raymond S.Yamashita
Talks about:
bound (5) linear (3) network (2) complex (2) layout (2) graph (2) tree (2) size (2) multipushdown (1) preliminari (1)

Person: Mike Paterson

DBLP DBLP: Paterson:Mike

Facilitated 1 volumes:

ICALP 1990Ed

Contributed to:

ICALP (1) 20082008
ICALP (1) 20062006
STOC 20022002
ICALP 20002000
STOC 19991999
ICALP 19961996
ICALP 19921992
STOC 19921992
PODS 19831983
STOC 19811981
STOC 19801980
STOC 19761976
STOC 19751975
STOC 19741974

Wrote 15 papers:

ICALP-A-2008-IwamaNPRY #linear #network #polynomial
Polynomial-Time Construction of Linear Network Coding (KI, HN, MP, RR, SY), pp. 271–282.
ICALP-v1-2006-DyerGP #graph #morphism #on the
On Counting Homomorphisms to Directed Acyclic Graphs (MED, LAG, MP), pp. 38–49.
STOC-2002-GoldbergKP #complexity #random
The complexity of choosing an H-colouring (nearly) uniformly at random (LAG, SK, MP), pp. 53–62.
ICALP-2000-AdlerFGP #bound
Tight Size Bounds for Packet Headers in Narrow Meshes (MA, FEF, LAG, MP), pp. 756–767.
ICALP-2000-GoldbergJKP #bound #capacity #protocol
A Bound on the Capacity of Backoff and Acknowledgement-Based Protocols (LAG, MJ, SK, MP), pp. 705–716.
STOC-1999-MuthukrishnanPSS #grid #multi #network
Compact Grid Layouts of Multi-Level Networks (SM, MP, SCS, TS), pp. 455–463.
ICALP-1996-PatersonP #complexity #on the #string
On the Complexity of String Folding (MP, TMP), pp. 658–669.
ICALP-1992-PatersonY #graph #nearest neighbour #on the
On Nearest-Neighbor Graphs (MP, FFY), pp. 416–426.
STOC-1992-PatersonZ #multi
Shallow Multiplication Circuits and Wise Financial Investments (MP, UZ), pp. 429–437.
PODS-1983-FischerLP #distributed #process
Impossibility of Distributed Consensus with One Faulty Process (MJF, NAL, MP), pp. 1–7.
STOC-1981-PatersonRS #bound
Bounds on Minimax Edge Length for Complete Binary Trees (MP, WLR, LS), pp. 293–299.
STOC-1980-FischerP #layout
Optimal Tree Layout (MJF, MP), pp. 177–189.
STOC-1976-PatersonW #linear #unification
Linear Unification (MP, MNW), pp. 181–186.
STOC-1975-FischerMP #bound
Lower Bounds on the Size of Boolean Formulas: Preliminary Report (MJF, ARM, MP), pp. 37–44.
STOC-1974-BookNP #bound #context-free grammar #linear #multi
Intersections of Linear Context-Free Languages and Reversal-Bounded Multipushdown Machines (RVB, MN, MP), pp. 290–296.

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.