View Document Preview and Link Document Date: 2015-01-07 05:01:30 Open Document File Size: 279,50 KB Share Result on Facebook
City Padova / Las Vegas / / Country Italy / United States / / Currency pence / / / Facility University of Padova / Brown University / University of Padova Projects STPD08JA32 / / IndustryTerm constant-space randomized algorithm / parallel algorithms / branchand-bound algorithm / fundamental combinatorial search problems / search problem / arbitrary processor / branch-and-bound algorithm / space-efficient parallel algorithms / sequential algorithms / search algorithm / search problems / search algorithms / above deterministic algorithm / deterministic algorithms / above algorithms / selection algorithm / parallel selection algorithm / random processor / heap-selection algorithm / distinct idle processors / butterfly network / sequential and parallel algorithms / deterministic algorithm / search space / randomized parallel algorithm / p-processor / deterministic and randomized algorithms / / Organization National Science Foundation / Brown University / U.S. Securities and Exchange Commission / University of Padova / University of Padova Projects STPD08JA32 and CPDA121378 / / Position communication model described / / Product Cowon D2+ Portable Audio Device / / Technology selection algorithm / above algorithms / randomized algorithm / random processor / 2.2 Deterministic algorithm / randomized parallel algorithm / search algorithm / Previous work Parallel algorithms / search algorithms / arbitrary processor / busy processors / sequential and parallel algorithms / Las Vegas algorithm / parallel selection algorithm / distinct idle processors / same processor / busy processor / two parallel algorithms / branch-and-bound algorithm / 2.3 Randomized algorithm / above deterministic algorithm / idle processor / Parallel Algorithms / heap-selection algorithm / least p/2 processors / constant-space randomized algorithm / deterministic and randomized algorithms / deterministic algorithm / Las-Vegas branchand-bound algorithm / / SocialTag 
Space-Efficient Parallel Algorithms for Combinatorial Search Problems? A. Pietracaprina1 , G. Pucci1 , F. Silvestri1 , and F. Vandin2 1 University of Padova, Dip. Ingegneria dell’Informazione, Padova, Italy