16844 search results - page 25 / 3369 » How to Design Programs |
138
click to vote
FUN
2007
Springer
15 years 11 months ago
2007
Springer
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...
OR
2005
Springer
15 years 10 months ago
2005
Springer
CHES
2004
Springer
15 years 10 months ago
2004
Springer
EUNIS
2001
15 years 6 months ago
2001
109
Voted
SIGPLAN
2008
15 years 4 months ago
2008
