1071 search results - page 113 / 215 » Theories of Automatic Structures and Their Complexity |
CALCO
2005
Springer
14 years 1 months ago
2005
Springer
Scalars, Loops, and Free Traced and Strongly Compact Closed Categories Samson Abramsky Oxford University Computing Laboratory Wolfson Building, Parks Road, Oxford OX1 3QD, U.K. htt...
COMPGEOM
2009
ACM
14 years 28 days ago
2009
ACM
We present a new (1 + ε)-spanner for sets of n points in Rd . Our spanner has size O(n/εd−1 ) and maximum degree O(logd n). The main advantage of our spanner is that it can be...
STACS
1994
Springer
14 years 9 days ago
1994
Springer
The L ? = NL question remains one of the major unresolved problems in complexity theory. Both L and NL have logical characterizations as the sets of totally ordered ( ) structures...
EDCC
2008
Springer
13 years 10 months ago
2008
Springer
In avionics domain, the software applications grew to millions of source lines of code representing important development expenditures. To cut the costs, the avionics suppliers ar...
IPPS
2000
IEEE
14 years 19 days ago
2000
IEEE
Abstract. Many parallel scienti c applications have dynamic and irregular computational structure. However, most such applications exhibit persistence of computational load and com...