182 search results - page 6 / 37 » A Theory of Strict P-completeness |
163
Voted
POPL
2009
ACM
15 years 10 months ago
2009
ACM
Previous deforestation and supercompilation algorithms may introduce accidental termination when applied to call-by-value programs. This hides looping bugs from the programmer, an...
73
Voted
HSNMC
2003
Springer
15 years 2 months ago
2003
Springer
The provision of Quality of Service (QoS) in a seamless way over the dominating internetworking protocol of our times (IP), has been a challenge for many researchers in the past ye...
INFOCOM
2006
IEEE
2006
IEEE
Multistage Constructions of Linear Compressors, Non-Overtaking Delay Lines, and Flexible Delay Lines
15 years 3 months ago
— Queueing theory is generally known as the theory to study the performance of queues. In this paper, we are interested in another aspect of queueing theory, the theory to constr...
CPC
2000
14 years 9 months ago
2000
We examine the specialization to simple matroids of certain problems in extremal matroid theory that are concerned with bounded cocircuit size. Assume that each cocircuit of a simp...
103
click to vote
POPL
1997
ACM
15 years 1 months ago
1997
ACM
Pizza is a strict superset of Java that incorporates three ideas from the academic community: parametric polymorphism, higher-order functions, and algebraic data types. Pizza is d...