Randomized algorithms with splitting: Why the classic randomized algorithms do not work and how to make them work (Q2270192): Difference between revisions

@@ Property / author @@
-Q596383
@@ Property / author: Q596383 / rank @@
-Normal rank
@@ Property / author @@
+Reuven Y. Rubinstein
@@ Property / author: Reuven Y. Rubinstein / 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.1007/s11009-009-9126-6
+Normal rank
@@ Property / OpenAlex ID @@
+W2093911591
@@ Property / OpenAlex ID: W2093911591 / rank @@
+Normal rank
@@ Property / cites work @@
+Discrete Hit-and-Run for Sampling Points from Arbitrary Distributions Over Subsets of Integer Hyperrectangles
+Normal rank
@@ Property / cites work @@
+An efficient algorithm for rare-event probability estimation, combinatorial optimization, and counting
+Normal rank
@@ Property / cites work @@
+Q4819702
@@ Property / cites work: Q4819702 / rank @@
+Normal rank
@@ Property / cites work @@
+Randomly coloring planar graphs with fewer colors than the maximum degree
+Normal rank
@@ Property / cites work @@
+Probability and Computing
@@ Property / cites work: Probability and Computing / rank @@
+Normal rank
@@ Property / cites work @@
+Q4856179
@@ Property / cites work: Q4856179 / rank @@
+Normal rank
@@ Property / cites work @@
+The Gibbs cloner for combinatorial optimization, counting and sampling
+Normal rank
@@ Property / cites work @@
+Q4828558
@@ Property / cites work: Q4828558 / rank @@
+Normal rank