PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Skopalik, Alexander"

Author of the publication

copydeleteadd this publication to your clipboard
Taxing Subnetworks.

, , and . WINE, volume 5385 of Lecture Notes in Computer Science, page 286-294. Springer, (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. You can also use the button next to the name to display some publications already assigned to the person.

Alexander Verl

On the Dynamics and Emergency Stop Behavior of Cable-Driven Parallel Robots, , and . ROMANSY 21 - Robot Design, Dynamics and Control, volume 569 of CISM International Centre for Mechanical Sciences, page 431--438. Switzerland, Springer Verlag and Springer International Publishing, (2016)

Alexander Jaust

Alexander Jaust

Alexander Keller

Alexander Bartler University of Stuttgart

 

Other publications of authors with the same name

Efficient Computation of Approximate Pure Nash Equilibria in Congestion Games., , , and . FOCS, page 532-541. IEEE Computer Society, (2011)Hiring Secretaries over Time: The Benefit of Concurrent Employment., , , , , , , and . CoRR, (2016)Pure Nash equilibria in restricted budget games., , , and . J. Comb. Optim., 37 (2): 620-638 (2019)Doing Good with Spam Is Hard., , and . SAGT, volume 5814 of Lecture Notes in Computer Science, page 263-274. Springer, (2009)Disaggregating User Evaluations Using the Shapley Value., , , and . NetEcon@SIGMETRICS, page 5:1-5:6. ACM, (2018)Multi-Unit Bilateral Trade., , , , and . AAAI, page 1973-1980. AAAI Press, (2019)Approximate Pure Nash Equilibria in Social Context Congestion Games., , and . WINE, volume 8877 of Lecture Notes in Computer Science, page 480-485. Springer, (2014)Sharing is Caring: Multiprocessor Scheduling with a Sharable Resource., , , and . SPAA, page 123-132. ACM, (2017)Routing Games With Progressive Filling., , , and . IEEE/ACM Trans. Netw., 24 (4): 2553-2562 (2016)Computing approximate pure Nash equilibria in congestion games., , , and . SIGecom Exchanges, 11 (1): 26-29 (2012)