Diogo Poças

Orcid: 0000-0002-5474-3614

According to our database1, Diogo Poças authored at least 24 papers between 2013 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Polymorphic higher-order context-free session types.
Theor. Comput. Sci., 2024

Simple grammar bisimilarity, with an application to session type equivalence.
CoRR, 2024

2023
A Unifying Approximate Potential for Weighted Congestion Games.
Theory Comput. Syst., August, 2023

On the Complexity of Equilibrium Computation in First-Price Auctions.
SIAM J. Comput., February, 2023

Existence and Complexity of Approximate Equilibria in Weighted Congestion Games.
Math. Oper. Res., February, 2023

System F<sup>μ</sup><sub>ω</sub> with Context-free Session Types.
CoRR, 2023

Comparing the expressive power of Strongly-Typed and Grammar-Guided Genetic Programming.
Proceedings of the Genetic and Evolutionary Computation Conference, 2023

System F<sup>μ</sup> <sub>ømega</sub> with Context-free Session Types.
Proceedings of the Programming Languages and Systems, 2023

2022
Robust Revenue Maximization Under Minimal Statistical Information.
ACM Trans. Economics and Comput., September, 2022

The Power of Machines That Control Experiments.
Int. J. Found. Comput. Sci., 2022

Higher-order Context-free Session Types in System F.
Proceedings of the 13th International Workshop on Programming Language Approaches to Concurrency and Communication-cEntric Software, 2022

The Different Shades of Infinite Session Types.
Proceedings of the Foundations of Software Science and Computation Structures, 2022

2021
The Competitive Pickup and Delivery Orienteering Problem for Balancing Car-Sharing Systems.
Transp. Sci., 2021

Optimal Pricing for MHR and λ-regular Distributions.
ACM Trans. Economics and Comput., 2021

Tracking computability of GPAC-generable functions.
J. Log. Comput., 2021

A New Lower Bound for Deterministic Truthful Scheduling.
Algorithmica, 2021

2019
Approximability in the GPAC.
Log. Methods Comput. Sci., 2019

Register Requirement Minimization of Fixed-Depth Pipelines for Streaming Data Applications.
Proceedings of the 32nd IEEE International System-on-Chip Conference, 2019

2018
Analog networks on function data streams.
Comput., 2018

2017
Computations with oracles that measure vanishing quantities.
Math. Struct. Comput. Sci., 2017

2014
Simple reaction Systems and their Classification.
Int. J. Found. Comput. Sci., 2014

An analogue-Digital Church-Turing Thesis.
Int. J. Found. Comput. Sci., 2014

2013
Oracles that measure thresholds: the Turing machine and the broken balance.
J. Log. Comput., 2013

On the Power of Threshold Measurements as Oracles.
Proceedings of the Unconventional Computation and Natural Computation, 2013


  Loading...