995 search results - page 191 / 199 » complexity 2011 |
141
click to vote
POPL
2011
ACM
14 years 5 months ago
2011
ACM
There have been several efforts to bring static type inference to object-oriented dynamic languages such as Ruby, Python, and Perl. In our experience, however, such type inference...
198
Voted
POPL
2011
ACM
14 years 5 months ago
2011
ACM
We define a new logic, STRAND, that allows reasoning with heapmanipulating programs using deductive verification and SMT solvers. STRAND logic (“STRucture ANd Data” logic) f...
132
click to vote
SAC
2011
ACM
14 years 5 months ago
2011
ACM
Dynamically typed programming languages are powerful tools for rapid software development. However, there are scenarios that would benefit from actual type information being avai...
149
click to vote
SIGECOM
2011
ACM
14 years 5 months ago
2011
ACM
In a landmark paper, Papadimitriou and Roughgarden [2008] described a polynomial-time algorithm (“Ellipsoid Against Hope”) for computing sample correlated equilibria of concis...
246
click to vote
SIGECOM
2011
ACM
14 years 5 months ago
2011
ACM
Market making refers broadly to trading strategies that seek to profit by providing liquidity to other traders, while avoiding accumulating a large net position in a stock. In th...