( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Tight information-theoretic lower bounds for welfare maximization in combinatorial auctions.

, , и . EC, стр. 70-77. ACM, (2008)

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.

Dirk Jansen

Temperaturkorrektur von mit dem Falling-Weight-Deflectometer gemessenen Deflexionen auf Asphaltbefestigungen. Uni Duisburg-Essen, (2009)

Tsai-Yu Jansen

Einfluss der Konversion laparoskopischer Operationen auf Tumorwachstum, hepatische Metastasierung und Tumorangiogenese. Uni Heidelberg, (2010)

Matthäus Janczyk

Synthese funktionalisierter Trinukleotide und ihre Anwendung bei der Randomisierung. Uni Greifswald, (2009)

Christoph Janello

Wertschöpfung im digitalisierten Buchmarkt. Uni München, (2010)

Richard Janissen

Biomolecular based nano-manipulation with a combined atomic force microscope and single molecule fluorescence setup. Uni Düsseldorf, (2009)
 

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

Submodular Optimization in the MapReduce Model., и . SOSA, том 69 из OASIcs, стр. 18:1-18:10. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Communication Complexity of Combinatorial Auctions with Submodular Valuations., и . SODA, стр. 1205-1215. SIAM, (2013)Secretary Problems: The Power of a Single Sample., и . SODA, стр. 2015-2029. SIAM, (2023)Fixed-Price Approximations in Bilateral Trade., , и . CoRR, (2021)Tight Bounds on ℓ1 Approximation and Learning of Self-Bounding Functions., , и . ALT, том 76 из Proceedings of Machine Learning Research, стр. 540-559. PMLR, (2017)The Submodular Welfare Problem with Demand Queries., и . Theory of Computing, 6 (1): 247-290 (2010)On Multiplicative Weight Updates for Concave and Submodular Function Maximization., , и . ITCS, стр. 201-210. ACM, (2015)Multiway cut, pairwise realizable distributions, and descending thresholds., и . STOC, стр. 724-733. ACM, (2014)Stochastic Covering and Adaptivity., и . LATIN, том 3887 из Lecture Notes in Computer Science, стр. 532-543. Springer, (2006)Hardness of Submodular Cost Allocation: Lattice Matching and a Simplex Coloring Conjecture., и . APPROX-RANDOM, том 28 из LIPIcs, стр. 144-159. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2014)