From post

Probabilistic Construction of Small Strongly Sum-Free Sets via Large Sidon Sets.

, , и . RANDOM-APPROX, том 1671 из Lecture Notes in Computer Science, стр. 138-143. Springer, (1999)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

 

Другие публикации лиц с тем же именем

Approximation Algorithms for Pick-and-Place Robots., , и . Ann. Oper. Res., 107 (1-4): 321-338 (2001)Bounds and constructions for the star-discrepancy via ?-covers., , и . J. Complex., 21 (5): 691-709 (2005)Fast Approximation of Minimum Multicast Congestion - Implementation versus Theory., и . CIAC, том 2653 из Lecture Notes in Computer Science, стр. 165-177. Springer, (2003)Constructions of Sparse Asymmetric Connectors: Extended Abstract., , и . FSTTCS, том 2914 из Lecture Notes in Computer Science, стр. 13-22. Springer, (2003)A Randomised Approximation Algorithm for the Partial Vertex Cover Problem in Hypergraphs., , и . MedAlg, том 7659 из Lecture Notes in Computer Science, стр. 174-187. Springer, (2012)Enhanced Quantum Evolutionary Algorithms for Difficult Knapsack Problems., , и . PReMI, том 4815 из Lecture Notes in Computer Science, стр. 252-260. Springer, (2007)Bounds for Static Black-Peg AB Mastermind., , , и . COCOA (2), том 10628 из Lecture Notes in Computer Science, стр. 409-424. Springer, (2017)Experimental Study of Non-oblivious Greedy and Randomized Rounding Algorithms for Hypergraph b-Matching., и . SEA, том 5526 из Lecture Notes in Computer Science, стр. 185-196. Springer, (2009)A Streaming Algorithm for the Undirected Longest Path Problem., , и . ESA, том 57 из LIPIcs, стр. 56:1-56:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Integer Multicommodity Flows with Reduced Demands., и . ESA, том 726 из Lecture Notes in Computer Science, стр. 360-371. Springer, (1993)