On the complexity of equilibrium computation in first-price auctions A Filos-Ratsikas, Y Giannakopoulos, A Hollender, P Lazos, D Poças Proceedings of the 22nd ACM Conference on Economics and Computation, 454-476, 2021 | 33 | 2021 |
Simple reaction systems and their classification L Manzoni, D Pocas, AE Porreca International Journal of Foundations of Computer Science 25 (04), 441-457, 2014 | 30 | 2014 |
Robust revenue maximization under minimal statistical information Y Giannakopoulos, D Poças, A Tsigonias-Dimitriadis ACM Transactions on Economics and Computation 10 (3), 1-34, 2023 | 22 | 2023 |
An analogue-digital Church-Turing thesis E Beggs, JF Costa, D Poças, JV Tucker International Journal of Foundations of Computer Science 25 (04), 373-389, 2014 | 20 | 2014 |
Oracles that measure thresholds: the Turing machine and the broken balance E Beggs, JF Costa, D Poças, JV Tucker Journal of Logic and Computation 23 (6), 1155-1181, 2013 | 19 | 2013 |
An analogue-digital model of computation: Turing machines with physical oracles T Ambaram, E Beggs, J Félix Costa, D Poças, JV Tucker Advances in Unconventional Computing: Volume 1: Theory, 73-115, 2017 | 16 | 2017 |
The competitive pickup and delivery orienteering problem for balancing car-sharing systems L Martin, S Minner, D Poças, AS Schulz Transportation Science 55 (6), 1232-1259, 2021 | 15 | 2021 |
The different shades of infinite session types SJ Gay, D Poças, VT Vasconcelos International Conference on Foundations of Software Science and Computation …, 2022 | 12 | 2022 |
Existence and complexity of approximate equilibria in weighted congestion games G Christodoulou, M Gairing, Y Giannakopoulos, D Poças, C Waldmann Mathematics of Operations Research 48 (1), 583-602, 2023 | 11 | 2023 |
Computations with oracles that measure vanishing quantities E Beggs, JF Costa, D Poças, JV Tucker Mathematical Structures in Computer Science 27 (8), 1315-1363, 2017 | 11 | 2017 |
Transient growth in stochastic Burgers flows D Poças, B Protas arXiv preprint arXiv:1510.05037, 2015 | 11 | 2015 |
A new lower bound for deterministic truthful scheduling Y Giannakopoulos, A Hammerl, D Poças International Symposium on Algorithmic Game Theory, 226-240, 2020 | 10 | 2020 |
Higher-order context-free session types in system F D Costa, A Mordido, D Poças, VT Vasconcelos arXiv preprint arXiv:2203.12877, 2022 | 9 | 2022 |
Optimal pricing for MHR and λ-regular distributions Y Giannakopoulos, D Poças, K Zhu ACM Transactions on Economics and Computation (TEAC) 9 (1), 1-28, 2021 | 9 | 2021 |
On the power of threshold measurements as oracles E Beggs, JF Costa, D Poças, JV Tucker Unconventional Computation and Natural Computation: 12th International …, 2013 | 9 | 2013 |
System with Context-free Session Types D Poças, D Costa, A Mordido, VT Vasconcelos European Symposium on Programming, 392-420, 2023 | 7 | 2023 |
A unifying approximate potential for weighted congestion games Y Giannakopoulos, D Poças Theory of Computing Systems 67 (4), 855-876, 2023 | 4 | 2023 |
Analog networks on function data streams D Poças, J Zucker Computability 7 (4), 301-322, 2018 | 4 | 2018 |
Comparing the Expressive Power of Strongly-Typed and Grammar-Guided genetic programming A Fonseca, D Poças Proceedings of the Genetic and Evolutionary Computation Conference, 1100-1108, 2023 | 3 | 2023 |
A new lower bound for deterministic truthful scheduling Y Giannakopoulos, A Hammerl, D Poças Algorithmica 83 (9), 2895-2913, 2021 | 3 | 2021 |