???global.info.a_carregar???
Diogo Poças did his BSc and MSc in Applied Mathematics at Instituto Superior Técnico, Lisbon. He then moved to Canada where he completed his PhD in Mathematics at McMaster University, Hamilton ON, under the supervision of Prof. Jeffery Zucker. Afterwards he was a postdoctoral researcher at the Operations Research Group in the Technical University of Munich. Currently Diogo Poças is an Invited Assistant Professor at Faculdade de Ciências, Universidade de Lisboa, as well as an Integrated Member of the LASIGE research unit. Diogo's research interests are in theoretical and applied computer science. Currently he is working in the areas of algorithmic game theory, analog computing, and session types.
Identificação

Identificação pessoal

Nome completo
Diogo Miguel Ferreira Poças

Nomes de citação

  • Poças, Diogo

Identificadores de autor

Ciência ID
271E-FFD4-FA52
ORCID iD
0000-0002-5474-3614
Produções

Publicações

Artigo em conferência
  1. Poças, Diogo. "On the Complexity of Equilibrium Computation in First-Price Auctions". 2021.
    10.1145/3465456.3467627
  2. Yiannis Giannakopoulos; Diogo Poças; Alexandros Tsigonias-Dimitriadis; Poças, Diogo. "Robust Revenue Maximization Under Minimal Statistical Information". Trabalho apresentado em International Conference on Web and Internet Economics, 2020.
    10.1007/978-3-030-64946-3_13
  3. Yiannis Giannakopoulos; Diogo Poças. "A Unifying Approximate Potential for Weighted Congestion Games". Trabalho apresentado em International Symposium on Algorithmic Game Theory, 2020.
    10.1007/978-3-030-57980-7_7
  4. Giannakopoulos, Yiannis; Hammerl, Alexander; Poças, Diogo. "A New Lower Bound for Deterministic Truthful Scheduling". Trabalho apresentado em International Symposium on Algorithmic Game Theory, 2020.
    10.1007/978-3-030-57980-7_15
  5. Poças, Diogo; George Christodoulou; Martin Gairing; Yiannis Giannakopoulos; Clara Waldmann. "Existence and Complexity of Approximate Equilibria in Weighted Congestion Games". Trabalho apresentado em International Colloquium on Automata, Languages, and Programming, 2020.
    10.4230/LIPICS.ICALP.2020.32
  6. Diogo Poças; Jeffery Zucker. "Tracking Computability of GPAC-Generable Functions". Trabalho apresentado em International Symposium on Logical Foundations of Computer Science, 2020.
    10.1007/978-3-030-36755-8_14
  7. Poças, Diogo. "Register Requirement Minimization of Fixed-Depth Pipelines for Streaming Data Applications". 2019.
    10.1109/socc46988.2019.1570548393
  8. Beggs, Edwin; Costa, José Félix; Poças, Diogo; Tucker, John V.. "On the Power of Threshold Measurements as Oracles". Trabalho apresentado em International Conference on Unconventional Computing and Natural Computation, 2013.
    10.1007/978-3-642-39074-6_3
Artigo em revista
  1. "The Power of Machines That Control Experiments". International Journal of Foundations of Computer Science (2022): 1-28. http://dx.doi.org/10.1142/s0129054122500010.
    10.1142/s0129054122500010
  2. Layla Martin; Stefan Minner; Diogo Poças; Andreas S. Schulz. "The Competitive Pickup and Delivery Orienteering Problem for Balancing Car-Sharing Systems". Transportation Science (2021): https://doi.org/10.1287/trsc.2021.1041.
    10.1287/trsc.2021.1041
  3. Giannakopoulos, Yiannis; Poças, Diogo; Zhu, Keyu. "Optimal Pricing for MHR and ¿-regular Distributions". ACM Transactions on Economics and Computation 9 1 (2021): 1-28. http://dx.doi.org/10.1145/3434423.
    Publicado • 10.1145/3434423
  4. "Tracking computability of GPAC-generable functions". Journal of Logic and Computation 31 1 (2021): 326-346. http://dx.doi.org/10.1093/logcom/exaa081.
    10.1093/logcom/exaa081
  5. Poças, Diogo. "Approximability in the GPAC". Logical Methods in Computer Science ; Volume 15 (2019): https://lmcs.episciences.org/5727.
    10.23638/LMCS-15(3:24)2019
  6. Poças, Diogo. "Analog networks on function data streams". Computability (2018): http://doi.org/10.3233/COM-170077.
    10.3233/COM-170077
  7. Poças, Diogo. "Transient growth in stochastic Burgers flows". Discrete & Continuous Dynamical Systems - B (2018): http://dx.doi.org/10.3934/dcdsb.2018052.
    10.3934/dcdsb.2018052
  8. Poças, Diogo. "Computations with oracles that measure vanishing quantities". Mathematical Structures in Computer Science (2017): http://dx.doi.org/10.1017/s0960129516000219.
    10.1017/s0960129516000219
  9. Poças, Diogo. "Solving Smullyan Puzzles with Formal Systems". Axiomathes (2017): http://dx.doi.org/10.1007/s10516-017-9339-1.
    10.1007/s10516-017-9339-1
  10. Poças, Diogo; Manzoni, Luca; Porreca, Antonio E.. "Simple Reaction Systems and their Classification". International Journal of Foundations of Computer Science (2014): http://www.worldscientific.com/doi/abs/10.1142/S012905411440005X.
    10.1142/S012905411440005X
  11. Poças, Diogo. "An Analogue-Digital Church-Turing Thesis". International Journal of Foundations of Computer Science (2014): http://www.worldscientific.com/doi/abs/10.1142/S0129054114400012.
    10.1142/S0129054114400012
  12. Beggs, E.; Costa, J. F.; Pocas, D.; Tucker, J. V.. "Oracles that measure thresholds: the Turing machine and the broken balance". Journal of Logic and Computation 23 6 (2013): 1155-1181. http://dx.doi.org/10.1093/logcom/ext047.
    10.1093/logcom/ext047
Capítulo de livro
  1. Yiannis Giannakopoulos; Alexander Hammerl; Diogo Poças. "A New Lower Bound for Deterministic Truthful Scheduling". In Algorithmica, 2895-2913. 2021.
    Publicado • 10.1007/s00453-021-00847-2
  2. Poças, Diogo. "An Analogue-Digital Model of Computation: Turing Machines with Physical Oracles". 2017.
    10.1007/978-3-319-33924-5_4
  3. Poças, Diogo. "Fixed Point Techniques in Analog Systems". 2016.
    10.1007/978-3-319-30379-6_63
  4. Poças, Diogo. "Testes de Primalidade". In Números, cirurgias e nós de gravata: 10 anos de Seminário Diagonal no IST. Portugal, 2012.
    Publicado
Tese / Dissertação
  1. "Analog Computability with Differential Equations". Doutoramento, McMaster University, 2017. http://hdl.handle.net/11375/22593.
  2. "Complexity with costing and stochastic oracles". Mestrado, 2013.