PaperImplementation of simultaneous memory address access in models that forbid itUzi VishkinJournal of Algorithms
PaperSolving NP-hard problems in 'almost trees': Vertex coverDon Coppersmith, Uzi VishkinDiscrete Applied Mathematics
PaperComplexity of finding k-path-free dominating sets in graphsReuven Bar-Yehuda, Uzi VishkinInformation Processing Letters