Jitter Regulation in an Internet Router with Delay Consideration (English)
- New search for: Koga, Hisashi
- New search for: Paterson, Mike S.
- New search for: Koga, Hisashi
In:
Algorithms - ESA 2000
: 8th Annual European Symposium Saarbrücken, Germany, September 5–8, 2000 Proceedings
;
Chapter: 28
;
302-313
;
2003
-
ISSN:
- Article/Chapter (Book) / Electronic Resource
-
Title:Jitter Regulation in an Internet Router with Delay Consideration
-
Contributors:Paterson, Mike S. ( editor ) / Koga, Hisashi ( author )
-
Conference:European Symposium on Algorithms ; 2000 ; Saarbrücken, Germany
-
Published in:Algorithms - ESA 2000 : 8th Annual European Symposium Saarbrücken, Germany, September 5–8, 2000 Proceedings ; Chapter: 28 ; 302-313Lecture Notes in Computer Science ; 1879 ; 302-313
-
Publisher:
- New search for: Springer Berlin Heidelberg
-
Place of publication:Berlin, Heidelberg
-
Publication date:2003-02-11
-
Size:12 pages
-
ISBN:
-
ISSN:
-
DOI:
-
Type of media:Article/Chapter (Book)
-
Type of material:Electronic Resource
-
Language:English
-
Keywords:
-
Source:
Table of contents eBook
The tables of contents are generated automatically and are based on the data records of the individual contributions available in the index of the TIB portal. The display of the Tables of Contents may therefore be incomplete.
- 1
-
Web Information Retrieval - an Algorithmic PerspectiveHenzinger, Monika et al. | 2003
- 2
-
Computational Biology — Algorithms and MoreLengauer, Thomas et al. | 2003
- 3
-
Polygon Decomposition for Efficient Construction of Minkowski SumsAgarwal, Pankaj K. / Flato, Eyal / Halperin, Dan et al. | 2003
- 4
-
An Approximation Algorithm for Hypergraph Max k-Cut with Given Sizes of PartsAgeev, Alexander A. / Sviridenko, Maxim I. et al. | 2003
- 5
-
Offline List Update is NP-hardAmbühl, Christoph et al. | 2003
- 6
-
Computing Largest Common Point Sets under Approximate CongruenceAmbühl, Christoph / Chakraborty, Samarjit / Gärtner, Bernd et al. | 2003
- 7
-
Online Algorithms for Caching Multimedia StreamsAndrews, Matthew / Munagala, Kamesh et al. | 2003
- 8
-
On Recognizing Cayley GraphsBarrière, Lali / Fraigniaud, Pierre / Gavoille, Cyril / Mans, Bernard / Robson, John M. et al. | 2003
- 9
-
Fast Algorithms for Even/Odd Minimum Cuts and GeneralizationsBenczúr, András A. / Fülöp, Ottilia et al. | 2003
- 10
-
Efficient Algorithms for Centers and Medians in Interval and Circular-Arc GraphsBespamyatnikh, S. / Bhattacharya, B. / Keil, J. Mark / Kirkpatrick, D. / Segal, M. et al. | 2003
- 11
-
Exact Point Pattern Matching and the Number of Congruent Triangles in a Three-Dimensional PointsetBrass, Peter et al. | 2003
- 12
-
Range Searching over Tree Cross ProductsBuchsbaum, Adam L. / Goodrich, Michael T. / Westbrook, Jeffery R. et al. | 2003
- 13
-
A 2 1/10-Approximation Algorithm for a Generalization of the Weighted Edge-Dominating Set ProblemCarr, Robert / Fujito, Toshihiro / Konjevod, Goran / Parekh, Ojas et al. | 2003
- 14
-
The Minimum Range Assignment Problem on Linear Radio NetworksClementi, A. E. F. / Ferreira, A. / Penna, P. / Perennes, S. / Silvestri, R. et al. | 2003
- 15
-
Property Testing in Computational GeometryCzumaj, Artur / Sohler, Christian / Ziegler, Martin et al. | 2003
- 16
-
On R-Trees with Low Stabbing Numberde Berg, Mark / Gudmundsson, Joachim / Hammar, Mikael / Overmars, Mark et al. | 2003
- 17
-
K-D Trees Are Better when Cut on the Longest SideDickerson, Matthew / Duncan, Christian A. / Goodrich, Michael T. et al. | 2003
- 18
-
On Multicriteria Online ProblemsFlammini, Michele / Nicosia, Gaia et al. | 2003
- 19
-
Online Scheduling RevisitedFleischer, Rudolf / Wahl, Michaela et al. | 2003
- 20
-
Constant Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning ProblemGaur, Daya Ram / Ibaraki, Toshihide / Krishnamurti, Ramesh et al. | 2003
- 21
-
I/O-Efficient Well-Separated Pair Decomposition and Its ApplicationsGovindarajan, Sathish / Lukovszki, Tamás / Maheshwari, Anil / Zeh, Norbert et al. | 2003
- 22
-
Higher Order Delaunay TriangulationsGudmundsson, Joachim / Hammar, Mikael / van Kreveld, Marc et al. | 2003
- 23
-
On Representations of Algebraic-Geometric Codes for List DecodingGuruswami, Venkatesan / Sudan, Madhu et al. | 2003
- 24
-
Minimizing a Convex Cost Closure SetHochbaum, Dorit S. / Queyranne, Maurice et al. | 2003
- 25
-
Preemptive Scheduling with RejectionHoogeveen, Han / Skutella, Martin / Woeginger, Gerhard J. et al. | 2003
- 26
-
Simpler and Faster Vertex-Connectivity Augmentation AlgorithmsHsu, Tsan -sheng et al. | 2003
- 27
-
Scheduling Broadcasts in Wireless NetworksKalyanasundaram, Bala / Pruhs, Kirk / Velauthapillai, Mahe et al. | 2003
- 28
-
Jitter Regulation in an Internet Router with Delay ConsiderationKoga, Hisashi et al. | 2003
- 29
-
Approximation of Curvature-Constrained Shortest Paths through a Sequence of PointsLee, Jae -Ha / Cheong, Otfried / Kwon, Woo -Cheol / Shin, Sung Yong / Chwa, Kyung -Yong et al. | 2003
- 30
-
Resource Constrained Shortest PathsMehlhorn, Kurt / Ziegelmann, Mark et al. | 2003
- 31
-
On the Competitiveness of Linear SearchMunro, J. Ian et al. | 2003
- 32
-
Maintaining a Minimum Spanning Tree under Transient Node FailuresNardelli, Enrico / Proietti, Guido / Widmayer, Peter et al. | 2003
- 33
-
Minimum Depth Graph EmbeddingPizzonia, Maurizio / Tamassia, Roberto et al. | 2003
- 34
-
New Algorithms for Two-Label Point LabelingQin, Zhongping / Wolff, Alexander / Xu, Yinfeng / Zhu, Binhai et al. | 2003
- 35
-
Analysing the Cache Behaviour of Non-uniform Distribution Sorting AlgorithmsRahman, Naila / Raman, Rajeev et al. | 2003
- 36
-
How Helpers Hasten h-RelationsSanders, Peter / Solis-Oba, Roberto et al. | 2003
- 37
-
Computing Optimal Linear Layouts of Trees in Linear TimeSkodinis, Konstantin et al. | 2003
- 38
-
Coloring Sparse Random Graphs in Polynomial Average TimeSubramanian, C. R. et al. | 2003
- 39
-
Restarts Can Help in the On-Line Minimization of the Maximum Delivery Time on a Single Machinevan den Akker, Marjan / Hoogeveen, Han / Vakhania, Nodari et al. | 2003
- 40
-
Collision Detection Using Bounding Boxes: Convexity HelpsZhou, Yunhong / Suri, Subhash et al. | 2003