Travelled to:1 × Belgium
1 × Denmark
1 × Finland
1 × Greece
1 × Hungary
1 × Israel
1 × Sweden
16 × USA
2 × Spain
Collaborated with:∅ P.G.Spirakis S.R.Tate V.Y.Pan H.Djidjev S.Sen S.Rajasekaran P.Gács A.P.Sistla L.G.Valiant G.L.Peterson H.R.Lewis H.Chandran N.Gopalkrishnan M.Ben-Or D.Kozen I.S.Filotti G.L.Miller S.E.Nikoletseas M.Yung
Talks about:time (6) complex (5) linear (4) probabilist (3) distribut (3) parallel (3) communic (3) network (3) system (3) effici (3)
Person: John H. Reif
DBLP: Reif:John_H=
Facilitated 1 volumes:
EdContributed to:
2009200219971995199519931991199019891988198519841984198319831982
1982198219811981198019801979197919781977Wrote 30 papers:
- ICALP-v1-2009-ChandranGR #complexity #linear
- The Tile Complexity of Linear Assemblies (HC, NG, JHR), pp. 235–253.
- ICALP-2002-Reif #assembly
- Molecular Assembly and Computation: From Theory to Experimental Demonstrations (JHR), pp. 1–21.
- STOC-1997-Reif #approximate #constant #evaluation #polynomial
- Approximate Complex Polynomial Evaluation in Near Constant Work Per Point (JHR), pp. 30–39.
- ICALP-1995-NikoletseasRSY #graph #memory management #probability
- Stochastic Graphs Have Short Memory: Fully Dynamic Connectivity in Poly-Log Expected Time (SEN, JHR, PGS, MY), pp. 159–170.
- STOC-1995-Reif #parallel #performance #polynomial
- Work efficient parallel solution of Toeplitz systems and polynomial GCD (JHR), pp. 751–761.
- ICALP-1993-ReifT #complexity #simulation
- The Complexity of N-body Simulation (JHR, SRT), pp. 162–176.
- STOC-1991-DjidjevR #algorithm #performance #problem
- An Efficient Algorithm for the Genus Problem with Explicit Construction of Forbidden Subgraphs (HD, JHR), pp. 337–347.
- ICALP-1990-PanR #multi #on the
- On the Bit-Complexity of Discrete Solutions of PDEs: Compact Multigrid (VYP, JHR), pp. 612–625.
- STOC-1989-ReifS #geometry #named #random
- Polling: A New Randomized Sampling Technique for Computational Geometry (JHR, SS), pp. 394–404.
- STOC-1989-ReifT #integer
- Optimal Size Integer Division Circuits (JHR, SRT), pp. 264–273.
- ICALP-1988-RajasekaranR
- Nested Annealing: A Provable Improvement to Simulated Annealing (SR, JHR), pp. 455–472.
- STOC-1985-GacsR #3d #array #realtime #reliability
- A Simple Three-Dimensional Real-Time Reliable Cellular Array (PG, JHR), pp. 388–395.
- STOC-1985-PanR #linear #parallel #performance
- Efficient Parallel Solution of Linear Systems (VYP, JHR), pp. 143–152.
- ICALP-1984-ReifS #distributed #probability #resource management
- Probabilistic Bidding Gives Optimal Distributed Resource Allocation (JHR, PGS), pp. 391–402.
- STOC-1984-Ben-OrKR #algebra #complexity #geometry
- The Complexity of Elementary Algebra and Geometry (MBO, DK, JHR), pp. 457–464.
- ICALP-1983-ReifS #logic #multi #network
- A Multiprocess Network Logic with Temporal and Spatial Modalities (JHR, APS), pp. 629–639.
- STOC-1983-ReifV #linear #network
- A Logarithmic Time Sort for Linear Size Networks (JHR, LGV), pp. 10–16.
- ICALP-1982-Reif #on the #parallel #power of #probability
- On the Power of Probabilistic Choice in Synchronous Parallel Computations (JHR), pp. 442–450.
- POPL-1982-ReifS #bound #communication #distributed #variability
- Unbounded Speed Variability in Distributed Communication Systems (JHR, PGS), pp. 46–56.
- STOC-1982-Reif #symmetry
- Symmetric Complementation (JHR), pp. 201–214.
- ICALP-1981-Reif #network
- Minimum S-T Cut of a Planar Undirected Network in O(n log²(n)) Time (JHR), pp. 56–67.
- STOC-1981-ReifS #algorithm #communication #distributed #realtime
- Distributed Algorithms for Synchronizing Interprocess Communication within Real Time (JHR, PGS), pp. 133–145.
- POPL-1980-ReifP #logic #multi
- A Dynamic Logic of Multiprocessing with Incomplete Information (JHR, GLP), pp. 193–202.
- STOC-1980-Reif #logic #probability #programming
- Logics for Probabilistic Programming (JHR), pp. 8–13.
- STOC-1980-ReifS #random
- Random Matroids (JHR, PGS), pp. 385–397.
- POPL-1979-Reif #analysis #communication #data flow #process
- Data Flow Analysis of Communicating Processes (JHR), pp. 257–268.
- STOC-1979-FilottiMR #graph #on the
- On Determining the Genus of a Graph in O(v^O(g)) Steps (ISF, GLM, JHR), pp. 27–37.
- STOC-1979-Reif #game studies
- Universal Games of Incomplete Information (JHR), pp. 288–308.
- POPL-1978-Reif #analysis #linear #programming
- Symbolic Programming Analysis in Almost Linear Time (JHR), pp. 76–83.
- POPL-1977-ReifL #evaluation #graph #symbolic computation
- Symbolic Evaluation and the Global Value Graph (JHR, HRL), pp. 104–118.