Sciweavers

16844 search results - page 25 / 3369
» How to Design Programs
Sort
View
FUN
2007
Springer
91views Algorithms» more  FUN 2007»
15 years 6 months ago
High Spies (or How to Win a Programming Contest)
We analyse transports between leaves in an edge-weighted tree. We prove under which conditions there exists a transport matching the weights of a given tree. We use this to compute...
André H. Deutz, Rudy van Vliet, Hendrik Jan...
CHES
2004
Springer
96views Cryptology» more  CHES 2004»
15 years 5 months ago
How to Disembed a Program?
Benoît Chevallier-Mames, David Naccache, Pas...
EUNIS
2001
15 years 1 months ago
How to learn introductory programming over Web
Arto Haataja, Jarkko Suhonen, Erkki Sutinen