Travelled to:1 × Switzerland
3 × USA
Collaborated with:F.T.Leighton C.E.Leiserson B.S.Baker W.Aiello R.Ostrovsky S.Rajagopalan F.R.K.Chung J.Hong A.L.Rosenberg
Talks about:indistinguish (1) manhattan (1) butterfli (1) algorithm (1) procedur (1) approxim (1) network (1) assembl (1) machin (1) verif (1)
Person: Sandeep N. Bhatt
DBLP: Bhatt:Sandeep_N=
Contributed to:
2000
198819831982Wrote 4 papers:
- ICALP-2000-AielloBOR #performance #proving #verification
- Fast Verification of Any Remote Procedure Call: Short Witness-Indistinguishable One-Round Proofs for NP (WA, SNB, RO, SR), pp. 463–474.
- STOC-1988-BhattCHLR #network #simulation
- Optimal Simulations by Butterfly Networks (SNB, FRKC, JWH, FTL, ALR), pp. 192–204.
- STOC-1983-BakerBL #algorithm #approximate
- An Approximation Algorithm for Manhattan Routing (BSB, SNB, FTL), pp. 477–486.
- STOC-1982-BhattL #how
- How to Assemble Tree Machines (SNB, CEL), pp. 77–84.