ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1405.1688
  4. Cited By
Trade-offs between Selection Complexity and Performance when Searching
  the Plane without Communication

Trade-offs between Selection Complexity and Performance when Searching the Plane without Communication

7 May 2014
Christoph Lenzen
Nancy A. Lynch
Calvin C. Newport
Tsvetomira Radeva
ArXivPDFHTML

Papers citing "Trade-offs between Selection Complexity and Performance when Searching the Plane without Communication"

3 / 3 papers shown
Title
The ANTS problem
The ANTS problem
O. Feinerman
Amos Korman
33
28
0
10 Jan 2017
Parallel Linear Search with no Coordination for a Randomly Placed
  Treasure
Parallel Linear Search with no Coordination for a Randomly Placed Treasure
Amos Korman
Yoav Rodeh
LRM
11
4
0
16 Feb 2016
Memory Lower Bounds for Randomized Collaborative Search and Applications
  to Biology
Memory Lower Bounds for Randomized Collaborative Search and Applications to Biology
O. Feinerman
Amos Korman
FedML
54
48
0
21 May 2012
1