Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

171

POPL
2002
ACM

102views Programming Languages» more POPL 2002»

The strength of non-size increasing computation

16 years 3 months ago

The strength of non-size increasing computation

Download www2.tcs.ifi.lmu.de

Martin Hofmann

Real-time Traffic

Non-size Increasing Computation | POPL 2002 | Programming Languages |

claim paper

Related Content

» On Computing Strength of Evidence for Writer Verification

» Operating Appliances with Mobile Phones Strengths and Limits of a Universal Interaction D...

» Resource Matching in a PeertoPeer Computational Framework

» Is the media equation a flash in the pan the durability and longevity of social responses ...

» In Search of Resonant Human Computer Interaction Building and Testing Aesthetic Installati...

» An Analysis of UCT in Multiplayer Games

» Location Estimation in Ad Hoc Networks with Directional Antennas

» Parallel MonteCarlo Tree Search

» Self Location Estimation Scheme Using ROA in Wireless Sensor Networks

Post Info
More Details (n/a)

Added	03 Dec 2009
Updated	03 Dec 2009
Type	Conference
Year	2002
Where	POPL
Authors	Martin Hofmann

Comments (0)