Travelled to:1 × Canada
1 × Hungary
1 × Sweden
8 × USA
Collaborated with:∅ L.v.Ahn M.Kedia R.Liu B.Codenotti P.Gemmell S.Kannan M.Luby R.Rubinfeld P.Feldman S.Micali T.Shahoumian S.Ar S.Ginosar R.W.Floyd V.R.Pratt R.L.Rivest R.E.Tarjan
Talks about:program (4) check (4) comput (3) game (3) correct (2) design (2) applic (2) work (2) self (2) transcendent (1)
Person: Manuel Blum
DBLP: Blum:Manuel
Contributed to:
2006
19951993
1993
1993199019891988198319721969Wrote 13 papers:
- CHI-2006-AhnGKLB #game studies #web
- Improving accessibility of the web with a computer game (LvA, SG, MK, RL, MB), pp. 79–82.
- CHI-2006-AhnKB #game studies #named
- Verbosity: a game for collecting common-sense facts (LvA, MK, MB), pp. 75–78.
- CHI-2006-AhnLB #game studies #image #named
- Peekaboom: a game for locating objects in images (LvA, RL, MB), pp. 55–64.
- ICALP-1995-BlumCGS #self
- Self-Correcting for Function Fields Transcendental Degree (MB, BC, PG, TS), pp. 547–557.
- ICALP-1993-Blum #approach #reliability #source code
- Program Result Checking: A New Approach to Making Programs More Reliable (MB), pp. 1–14.
- ISSTA-1993-Blum #design #source code
- Designing Programs to Check Their Work (MB), p. 1.
- STOC-1993-ArBCG #approximate
- Checking approximate computations over the reals (SA, MB, BC, PG), pp. 786–795.
- STOC-1990-BlumLR #problem #self
- Self-Testing/Correcting with Applications to Numerical Problems (MB, ML, RR), pp. 73–83.
- STOC-1989-BlumK #design #source code
- Designing Programs That Check Their Work (MB, SK), pp. 86–97.
- STOC-1988-BlumFM
- Non-Interactive Zero-Knowledge and Its Applications (MB, PF, SM), pp. 103–112.
- STOC-1983-Blum #how
- How to Exchange (Secret) Keys (MB), pp. 440–447.
- STOC-1972-BlumFPRT #bound #linear
- Linear Time Bounds for Median Computations (MB, RWF, VRP, RLR, RET), pp. 119–124.
- STOC-1969-Blum #algorithm #effectiveness #on the
- On Effective Procedures for Speeding Up Algorithms (MB), pp. 43–53.