Author of the publication

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Handling forecast errors while bidding for display advertising.

K. Lang, B. Moseley, and S. Vassilvitskii. WWW, page 371-380. ACM, (2012)

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. You can also use the button next to the name to display some publications already assigned to the person.

Univ. -Prof. Dr. Benjamin Stamm University of Stuttgart

Replication Data for: "Numerical simulation of the Gross-Pitaevskii equation via vortex tracking"G. Kemlin, T. Carvalho Corso, B. Stamm, and C. Melcher. Software, (2024)Related to: T. Carvalho Corso, G. Kemlin, C. Melcher and B. Stamm. Numerical simulation of the Gross-Pitaevskii equation via vortex tracking. Preprint (2024). arXiv: 2404.02133.

Benjamin Rothaupt

Dr. phil. Benjamin Holfelder University of Stuttgart

Benjamin Bursik University of Stuttgart

Benjamin Kaiser University of Stuttgart

Other publications of authors with the same name

A Dynamic Programming Framework for Non-Preemptive Scheduling Problems on Multiple Machines Extended Abstract.S. Im, S. Li, B. Moseley, and E. Torng. SODA, page 1070-1086. SIAM, (2015)Fair Scheduling via Iterative Quasi-Uniform Sampling.S. Im, and B. Moseley. SODA, page 2601-2615. SIAM, (2017)Online Scheduling on Identical Machines using SRPTK. Fox, and B. Moseley. CoRR, (2010)The Complexity of Scheduling for p-norms of Flow and StretchB. Moseley, K. Pruhs, and C. Stein. CoRR, (2013)Scheduling to Approximate Minimization Objectives on Identical Machines.B. Moseley. ICALP, volume 132 of LIPIcs, page 86:1-86:14. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2019)Practically Efficient Scheduler for Minimizing Average Flow Time of Parallel Jobs.K. Agrawal, I. Lee, J. Li, K. Lu, and B. Moseley. IPDPS, page 134-144. IEEE, (2019)Online Non-clairvoyant Scheduling to Simultaneously Minimize All Convex Functions.K. Fox, S. Im, J. Kulkarni, and B. Moseley. APPROX-RANDOM, volume 8096 of Lecture Notes in Computer Science, page 142-157. Springer, (2013)Bargaining for Revenue Shares on Tree Trading Networks.A. Ghosh, S. Kale, K. Lang, and B. Moseley. IJCAI, page 129-135. IJCAI/AAAI, (2013)Online Non-preemptive Scheduling on Unrelated Machines with Rejections.G. Lucarelli, B. Moseley, N. Thang, A. Srivastav, and D. Trystram. SPAA, page 291-300. ACM, (2018)Temporal Fairness of Round Robin: Competitive Analysis for Lk-norms of Flow Time.S. Im, J. Kulkarni, and B. Moseley. SPAA, page 155-160. ACM, (2015)