A parallel search game

DOI10.1002/RSA.20068MaRDI QIDQ5318247zbMATH OpenOpenAlexFDO

Authors Navin Goyal, Michael Saks

Publication date 22 September 2005

Published in Random Structures \& Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/rsa.20068

zbMATH Keywords

combinatorial gamesdata structurespermutations

Mathematics Subject Classification ID

Data structures (68P05) Combinatorial games (91A46)

Recommendations

• COMPACT REPRESENTATIONS OF SEARCH IN COMPLEX DOMAINS
• COMPACT REPRESENTATIONS OF SEARCH IN COMPLEX DOMAINS
• Parallel search in bivalued game trees
• Optimal Search on Some Game Trees
• On parallel evaluation of game trees

Cited in

(9)

• The function-inversion problem: barriers and opportunities
• The cell probe complexity of succinct data structures
• scientific article; zbMATH DE number 5995255 (Why is no real title available?)
• scientific article; zbMATH DE number 4213772 (Why is no real title available?)
• A search game with a protector
• On partial information retrieval: the unconstrained 100 prisoner problem
• Haystack hunting hints and locker room communication
• Haystack hunting hints and locker room communication
• The locker puzzle

This page was built for publication: A parallel search game

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5318247)