4940 search results - page 53 / 988 » On the Complexity of Universal Programs |
ICALP
2007
Springer
15 years 8 months ago
2007
Springer
ICLP
2007
Springer
15 years 8 months ago
2007
Springer
ICALP
2004
Springer
15 years 7 months ago
2004
Springer
117
click to vote
ESOP
2004
Springer
15 years 7 months ago
2004
Springer
t) Peter W. O’Hearn Queen Mary, University of London In the 1960s Dijkstra suggested that, in order to limit the complexity of potential process interactions, concurrent programs...
119
click to vote
CPHYSICS
2007
15 years 1 months ago
2007
During the last decade, several quantum information protocols, such as quantum key distribution, teleportation or quantum computation, have attracted a lot of interest. Despite th...