 |
|
|
|
 Parallel Complexity Theory (Research Notes in Theoretical Computers Science)
Parallel complexity theory, the study of resource-bounded parallel computation,
is surely one of the fastest-growing areas of theoretical Computer Science. In the
light of this, it would be foolish to attempt an encyclopedic coverage of the field.
However, it is the belief of the author that its foundations are becoming increas
ingly... |  |  |  |  Automata, Languages and Programming: 38th International Colloquium, ICALP 2011, Zurich, Switzerland
ICALP 2011, the 38th edition of the International Colloquium on Automata,
Languages and Programming, was held in Z¨urich, Switzerland, during July
4–8, 2011. ICALP is a series of annual conferences of the European Association
for Theoretical Computer Science (EATCS) which first took place in 1972. This
year, the ICALP... |
|
|
| Result Page: 25 24 23 22 21 20 19 18 17 16 15 14 13 12 11 10 9 8 7 |