Sciweavers

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

12

SLIP
2000
ACM

favoriteEmaildiscussreport

67views Computer Networks» more SLIP 2000»

Efficient representation of interconnection length distributions using generating polynomials

13 years 8 months ago

Efficient representation of interconnection length distributions using generating polynomials

Download escher.elis.ugent.be

Dirk Stroobandt, Herwig Van Marck

Real-time Traffic

Computer Networks | SLIP 2000 |

claim paper

Related Content

» Learning OneVariable Pattern Languages Very Efficiently on Average in Parallel and by Aski...

» Eliminating Exception Constraints of Java Programs for IA64

» Rational stochastic languages

Post Info
More Details (n/a)

Added	25 Aug 2010
Updated	25 Aug 2010
Type	Conference
Year	2000
Where	SLIP
Authors	Dirk Stroobandt, Herwig Van Marck

Comments (0)