`Travelled to:`

1 × China

1 × Finland

1 × Israel

2 × USA

`Collaborated with:`

R.Lempel A.Paz Y.Dinitz S.Rajsbaum O.H.Ibarra B.S.Leininger M.J.Fischer S.Rudich G.Taubenfeld

`Talks about:`

problem (2) complex (2) optim (2) determinist (1) symmetri (1) prefetch (1) polynomi (1) arithmet (1) approxim (1) segment (1)

## Person: Shlomo Moran

### DBLP: Moran:Shlomo

### Contributed to:

### Wrote 5 papers:

- VLDB-2002-LempelM #optimisation #web
- Optimizing Result Prefetching in Web Search Engines with Segmented Indices (RL, SM), pp. 370–381.
- STOC-1999-DinitzMR #complexity #symmetry
- Bit Complexity of Breaking and Achieving Symmetry in Chains and Rings (YD, SM, SR), pp. 265–274.
- STOC-1990-FischerMRT #problem
- The Wakeup Problem (MJF, SM, SR, GT), pp. 106–116.
- ICALP-1981-IbarraLM #complexity #on the
- On the Complexity of Simple Arithmetic Expressions (OHI, BSL, SM), pp. 294–304.
- ICALP-1977-PazM #approximate #nondeterminism #optimisation #polynomial #problem
- Non-Deterministic Polynomial Optimization Problems and Their Approximation (AP, SM), pp. 370–379.