Rendezvous search on labeled networks (Q4533473): Difference between revisions

@@ Property / author @@
+Steven Alpern
@@ Property / author: Steven Alpern / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1002/nav.10011
@@ Property / full work available at URL: https://doi.org/10.1002/nav.10011 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2071069929
@@ Property / OpenAlex ID: W2071069929 / rank @@
+Normal rank
@@ Property / cites work @@
+The Rendezvous Search Problem
@@ Property / cites work: The Rendezvous Search Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Asymmetric rendezvous search on the circle
@@ Property / cites work: Asymmetric rendezvous search on the circle / rank @@
+Normal rank
@@ Property / cites work @@
+Asymmetric Rendezvous on the Line Is a Double Linear Search Problem
+Normal rank
@@ Property / cites work @@
+Rendezvous Search on the Line with Indistinguishable Players
+Normal rank
@@ Property / cites work @@
+Note: Two rendezvous search problems on the line
@@ Property / cites work: Note: Two rendezvous search problems on the line / rank @@
+Normal rank
@@ Property / cites work @@
+Rendezvous on the Line when the Players' Initial Distance is Given by an Unknown Probability Distribution
+Normal rank
@@ Property / cites work @@
+Rendezvous Search on the Line
@@ Property / cites work: Rendezvous Search on the Line / rank @@
+Normal rank
@@ Property / cites work @@
+Rendezvous Search on the Interval and the Circle
@@ Property / cites work: Rendezvous Search on the Interval and the Circle / rank @@
+Normal rank
@@ Property / cites work @@
+Searching for targets who want to be found
@@ Property / cites work: Searching for targets who want to be found / rank @@
+Normal rank