Conference paper
Performance test case generation for microprocessors
Pradip Bose
VTS 1998
The following three problems concerning random graphs can be solved in (log n)O(1) expected time using linearly many processors: (1) finding the lexicographically first maximal independent set, (2) coloring the vertices using a number of colors that is almost surely within twice the chromatic number, and (3) finding a Hamiltonian circuit. © 1989.
Pradip Bose
VTS 1998
Daniel M. Bikel, Vittorio Castelli
ACL 2008
S.M. Sadjadi, S. Chen, et al.
TAPIA 2009
Matthias Kaiserswerth
IEEE/ACM Transactions on Networking