Travelled to:
1 × Greece
1 × Italy
1 × Poland
1 × Portugal
1 × The Netherlands
2 × USA
Collaborated with:
D.Peleg P.Fraigniaud ∅ Y.Emek A.Rosén R.Cohen D.Ilcinkas A.D.Sarma S.Holzer L.Kor D.Nanongkai G.Pandurangan R.Wattenhofer
Talks about:
scheme (4) label (3) distribut (2) graph (2) dynam (2) automaton (1) approxim (1) ancestri (1) univers (1) general (1)
Person: Amos Korman
DBLP: Korman:Amos
Contributed to:
Wrote 7 papers:
- STOC-2011-SarmaHKKNPPW #approximate #distributed #verification
- Distributed verification and hardness of distributed approximation (ADS, SH, LK, AK, DN, GP, DP, RW), pp. 363–372.
- STOC-2010-FraigniaudK
- An optimal ancestry scheme and small universal posets (PF, AK), pp. 611–620.
- ICALP-v1-2009-EmekFKR #online
- Online Computation with Advice (YE, PF, AK, AR), pp. 427–438.
- ICALP-2007-Korman
- Labeling Schemes for Vertex Connectivity (AK), pp. 102–109.
- ICALP-v1-2006-KormanP #graph
- Dynamic Routing Schemes for General Graphs (AK, DP), pp. 619–630.
- ICALP-2005-CohenFIKP #automaton #finite #graph
- Label-Guided Graph Exploration by a Finite Automaton (RC, PF, DI, AK, DP), pp. 335–346.
- ICALP-2003-KormanP
- Labeling Schemes for Weighted Dynamic Trees (AK, DP), pp. 369–383.