[logo ALCOM-IT]

ALCOM-IT

List of reports sorted by name

[TR-334-98]
K. Aardal A.K. Lenstra and C. Hurkens: " An Algorithm for Solving a Diophantine Equation with Lower and Upper Bounds on the Variables", 1998
WP(s): 4.3, responsible site: Utrecht
Download report

[TR-282-97]
K. Aardal S. van Hoesel J.K. Lenstra and L. Stougie: " A Decade of Combinatorial Optimization", 1997
WP(s): 4.3, responsible site: Utrecht
Download report

[TR-343-98]
M. Adler P. Berenbrink and K. Schröder: " Analyzing an Infinite Parallel Job Allocation Process", 1998
WP(s): 3.1, responsible site: Paderborn
Download report

[TR-342-98]
M. Adler W. Dittrich B.H.H. Juurlink M. Kutylowski and I. Rieping: " Communication-Optimal Parallel Minimum Spanning Tree Algorithms", 1998
WP(s): 3.1, responsible site: Paderborn
Download report

[TR-493-99]
M. Adler and C. Scheideler: " Efficient Communication Strategies for Ad-Hoc Wireless Networks", 1999
WP(s): 3.1, responsible site: Paderborn
Download report

[TR-305-97]
P.K. Agarwal L. Arge J. Erickson P.G. Franciosa and J.S. Vitter: " Efficient Searching with Linear Constraints", 1997
WP(s): 3.2, responsible site: Rome
Download report

[TR-438-99]
P.K. Agarwal L. Arge G.S. Brodal and J.S. Vitter: " I/O--Efficient Dynamic Point Location in Monotone Subdivisions", 1999
WP(s): 3.2, responsible site: Aarhus
Download report

[TR-300-97]
R. Agarwala V. Bafna M. Farach M. Paterson and M. Thorup: " On the approximability of numerical taxonomy (Fitting distances by tree metrics)", 1997
WP(s): 3.2, responsible site: Warwick
Download report

[TR-151-97]
S. Albers: " Better Bounds for Online Scheduling", 1997
WP(s): 3.2, responsible site: MPI
Download report

[TR-264-97]
S. Albers N. Garg and S. Leonardi: " Minimizing Stall Time in Single and Parallel Disk System", 1997
WP(s): 3.2, responsible site: MPI
Download report

[TR-054-96]
D. Alberts G. Cattaneo and G.F. Italiano: " An empirical study of dynamic graph algorithms", 1996
WP(s): 1.1, responsible site: Rome
Download report

[TR-358-98]
D. Alberts G. Cattaneo G.F. Italiano U. Nanni and C.D. Zaroliagis: " A Software Library of Dynamic Graph Algorithms", 1998
WP(s): 1.1, responsible site: Rome
Download report

[TR-036-96]
P. Alimonti and T. Calamoneri: " Improved Approximations of Independent Dominating Set in Bounded Degree Graphs", 1996
WP(s): 3.2, responsible site: Rome
Download report

[TR-257-97]
N. Alon P. Bradford and R. Fleischer: " Matching Nuts and Bolts faster (IPL publication)", 1997
WP(s): 3.2, responsible site: MPI
Download report

[TR-207-97]
N. Alon M. Dietzfelbinger P.B. Miltersen E. Petrank and G. Tardos: " Linear Hashing", 1997
WP(s): 3.3, responsible site: Aarhus
Download report

[TR-382-98]
S. Alstrup T. Husfeldt and T. Rauhe: " Marked Ancestor Problems", 1998
WP(s): 3.2, responsible site: Aarhus
Download report

[TR-318-98]
C. Alvarez J. Diaz and M. Serna: " Intervalizing colored graphs is NP-complete for caterpillars with hair length 2", 1998
WP(s): 3.2, responsible site: Barcelona
Download report

[TR-415-98]
C. Alvarez J. Diaz and M. Serna: " The hardness of Intervalizing Four Colored Caterpillars", 1998
WP(s): 3.2, responsible site: Barcelona
Download report

[TR-088-96]
C. Alvarez and R. Greenlaw: " A Compendium of Problems Complete for Symmetric Logarithmic Space", 1996
WP(s): 3.1, responsible site: Barcelona
Download report

[TR-455-99]
C. Alvarez and M. Serna: " The Proper Interval Colered Graph problem for caterpillar trees", 1999
WP(s): 3.2, responsible site: Barcelona
Download report

[TR-055-96]
G. Amato G. Cattaneo and G.F. Italiano: " Experimental analysis of dynamic minimum spanning tree algorithms", 1996
WP(s): 1.1, responsible site: Rome
Download report

[TR-095-96]
A. Andersson P.B. Miltersen and M. Thorup: " Fusion Trees can be implemented with AC$^0$ Instructions only", 1996
WP(s): 3.1, responsible site: Aarhus
Download report

[TR-208-97]
A. Andersson P.B. Miltersen S. Riis and M. Thorup: " Dictionaries on AC0 RAMs: Query Time $\Theta(\sqrt\log n / \log\log n)$ is Necessary and Sufficient", 1997
WP(s): 3.3, responsible site: Aarhus
Download report

[TR-375-98]
K. Antonis J. Garofalakis and P. Spirakis: " Competitive Symmetrical Transfer Policy for Load Sharing", 1998
WP(s): 3.1, responsible site: CTI
Download report

[TR-392-98]
K. Antonis J. Garofalakis J. Mourtos and P. Spirakis: " A Hierarchical Adaptive Distributed Algorithm for Load Balancing", 1998
WP(s): 3.1, responsible site: CTI
Download report

[TR-132-97]
A. Apostolico and G.F. Italiano: " Backtracking", 1997
WP(s): 3.2, responsible site: Rome
Download report

[TR-439-99]
L. Arge and P.B. Miltersen: " On showing lower bounds for external memory computational geometry problems", 1999
WP(s): 3.1, responsible site: Aarhus
Download report

[TR-008-96]
S. Arikati S. Chaudhuri and C.D. Zaroliagis: " All-Pairs Min-Cut in Sparse Networks", 1996
WP(s): 3.2, responsible site: MPI
Download report

[TR-451-99]
V. Arvind R. Beigel and A. Lozano: " The Complexity of Modular Graph Automorphism", 1999
WP(s): 3.2, responsible site: Barcelona
Download report

[TR-462-99]
N. Ascheuer M. Jünger and G. Reinelt: " A Branch-and-Cut Algorithm for the Asymmetric Hamiltonian Path Problem with Precedence Constraints", 1999
WP(s): 3.2, responsible site: Cologne
Download report

[TR-174-97]
M.J. Atallah F. Chyzak and P. Dumas: " An Algorithm for Estimating all Matches Between Two Strings", 1997
WP(s): 3.3, responsible site: INRIA
Download report

[TR-472-99]
M.J. Atallah F. Chyzak and P. Dumas: " A Randomized Algorithm for Approximate String Matching", 1999
WP(s): 3.3, responsible site: INRIA
Download report

[TR-187-97]
A. Atserias and J.L. Balc\'azar: " Refining Logical Characterizations of Advice Complexity Classes", 1997
WP(s): 3.3, responsible site: Barcelona
Download report

[TR-224-97]
V. Auletta I. Caragiannis C. Kaklamanis and P. Persiano: " Bandwidth Allocation Algorithms on Tree Shaped All Optical Networks with Wavelength Converters", 1997
WP(s): 3.2, responsible site: CTI
Download report

[TR-373-98]
V. Auletta I. Caragiannis C. Kaklamanis and P. Persiano: " Efficient Wavelength Routing in Trees with Low-Degree Converters", 1998
WP(s): 3.1, responsible site: CTI
Download report

[TR-376-98]
V. Auletta I. Caragiannis C. Kaklamanis and P. Persiano: " On the Complexity of Wavelength Converters", 1998
WP(s): 3.1, responsible site: CTI
Download report

[TR-134-97]
G. Ausiello P.G. Franciosa D. Frigioni and R. Giaccio: " Decremental maintenance of reachability in hypergraphs and minimum models of Horn formulae", 1997
WP(s): 3.2, responsible site: Rome
Download report

[TR-007-96]
G. Ausiello and R. Giaccio: " On-line Algorithms for Satisfiability Problems with Uncertainty", 1996
WP(s): 3.2, responsible site: Rome
Download report

[TR-238-97]
G. Ausiello R. Giaccio G.F. Italiano and U. Nanni: " Optimal Traversal of Directed Hypergraphs", 1997
WP(s): 3.2, responsible site: Rome
Download report

[TR-359-98]
G. Ausiello G.F. Italiano and U. Nanni: " Hypergraph Traversal Revisited: Cost Measures and Dynamic Algorithms", 1998
WP(s): 3.2, responsible site: Rome
Download report

[TR-142-97]
D. Avis and A. Deza: " Solitaire Cones", 1997
WP(s): 3.2, responsible site: EHESS
Download report

[TR-234-97]
D. Avis and A. Deza: " Multicommodity flow problem vs solitaire peg game", 1997
WP(s): 3.2, responsible site: EHESS
Download report

[TR-170-97]
B. Awerbuch Y. Azar A. Fiat S. Leonardi and A. Ros\`en: " On-line competitive algorithms fo call-admission in optical networks", 1997
WP(s): 3.2, responsible site: Rome
Download report

[TR-510-99]
B. Awerbuch Y. Azar S. Leonardi and O. Regev: " Minimizing the Flow Time without Migration", 1999
WP(s): 3.2, responsible site: Rome
Download report

[TR-135-97]
Y. Azar Y. Bartal A. Fiat E. Feuerstein S. Leonardi and A. Ros\`en: " On Capital Investment", 1997
WP(s): 4.3, responsible site: Rome
Download report

[TR-211-97]
E. Bach J. Boyar and K.S. Larsen: " The Accommodating Ratio for the Seat Reservation Problem", 1997
WP(s): 3.3, responsible site: Aarhus
Download report

[TR-219-97]
R.A. Baeza-Yates J. Gabarr\'o and X. Messeguer: " Fringe analysis for parallel MacroSplit insertion algorithms in 2--3 trees", 1997
WP(s): 3.1, responsible site: Barcelona
Download report

[TR-419-98]
R.A. Baeza-Yates J. Gabarr\'o and X. Messeguer: " Fringe analysis of synchronized parallel algorithms on 2-3 trees", 1998
WP(s): 3.2, responsible site: Barcelona
Download report

[TR-458-99]
R.A. Baeza-Yates J. Gabarr\'o X. Messeguer and M.S. Busquier: " Fringe analysis of synchronized parallel insertion algorithms on 2-3 trees", 1999
WP(s): 3.2, responsible site: Barcelona
Download report

[TR-092-96]
R.A. Baeza-Yates R. Gavald\'a and G. Navarro: " Bounding the Expected Length of Longest Common Subsequences and Forests", 1996
WP(s): 3.3, responsible site: Barcelona
Download report

[TR-413-98]
R.A. Baeza-Yates R. Gavald\'a G. Navarro and R. Scheihing: " Bounding the Expected Length of Longest Common Subsequences and Forests", 1998
WP(s): 3.3, responsible site: Barcelona
Download report

[TR-171-97]
J.E. Baker I.F. Cruz G. Liotta and R. Tamassia: " Visualizing Geometric Algorithms over the Web", 1997
WP(s): 1.2, responsible site: Rome
Download report

[TR-087-96]
J.L. Balc\'azar J. Diaz R. Gavald\'a and O. Watanabe: " Algorithms for Learning Finite Automata from Queries: A Unified View", 1996
WP(s): 3.1, responsible site: Barcelona
Download report

[TR-190-97]
J.L. Balc\'azar and M. Hermo: " The Structure of Logarithmic Advice Complexity Classes", 1997
WP(s): 3.3, responsible site: Barcelona
Download report

[TR-473-99]
C. B erier M. Bousquet-M\'elou A. Denise P. Flajolet D. Gardy and D. Gouyou-Beauchamps: " On Generating Functions of Generating Trees", 1999
WP(s): 4.5, responsible site: INRIA
Download report

[TR-006-96]
Y. Bartal A. Fiat and S. Leonardi: " Lower Bounds for On-line Graph Problems with Application to On-line Circuit and Optical Routing", 1996
WP(s): 3.2, responsible site: Rome
Download report

[TR-288-97]
Y. Bartal and S. Leonardi: " On-line Routing in All-optical Networks", 1997
WP(s): 3.1, responsible site: Rome
Download report

[TR-005-96]
Y. Bartal S. Leonardi A. Marchetti-Spaccamela J. Sgall and L. Stougie: " Multiprocessor Scheduling with Rejection", 1996
WP(s): 3.2, responsible site: Rome
Download report

[TR-035-96]
R. Battiti and M. Protasi: " Reactive Search a history-based heuristic for MAX-SAT", 1996
WP(s): 3.2, responsible site: Rome
Download report

[TR-169-97]
R. Battiti and M. Protasi: " Reactive local search techniques for the maximum conjunctive constraint satisfaction problem (k-CCSP)", 1997
WP(s): 3.2, responsible site: Rome
Download report

[TR-145-97]
A. Bäumker and W. Dittrich: " Parallel Algorithm for Image Processing: Practical Algorithms with Experiments", 1997
WP(s): 3.1, responsible site: Paderborn
Download report

[TR-147-97]
A. Bäumker and W. Dittrich: " Fully dynamic search trees for an extension of the BSP model", 1997
WP(s): 3.2, responsible site: Paderborn
Download report

[TR-196-97]
A. Bäumker and W. Dittrich: " Parallel Algorithm for Image Processing: Practical Algorithms with Experiments (revised)", 1997
WP(s): 3.1, responsible site: Paderborn
Download report

[TR-198-97]
A. Bäumker and W. Dittrich: " Fully dynamic search trees for an extension of the BSP model (revised)", 1997
WP(s): 3.2, responsible site: Paderborn
Download report

[TR-078-96]
A. Bäumker W. Dittrich F. Meyer auf der Heide and I. Rieping: " Priority Queue Operations and Selection for the BSP* Model", 1996
WP(s): 3.1, responsible site: Paderborn
Download report

[TR-146-97]
A. Bäumker W. Dittrich and A. Pietracaprina: " The deterministic complexity of parallel multisearch", 1997
WP(s): 3.1, responsible site: Paderborn
Download report

[TR-148-97]
A. Bäumker W. Dittrich and F. Meyer auf der Heide: " Truly efficient parallel algorithms: 1-optimal multisearch for an extension of the BSP model", 1997
WP(s): 3.1, responsible site: Paderborn
Download report

[TR-197-97]
A. Bäumker W. Dittrich and A. Pietracaprina: " The deterministic complexity of parallel multisearch (revised)", 1997
WP(s): 3.1, responsible site: Paderborn
Download report

[TR-199-97]
A. Bäumker W. Dittrich and F. Meyer auf der Heide: " Truly efficient parallel algorithms: 1-optimal multisearch for an extension of the BSP model (revised)", 1997
WP(s): 3.1, responsible site: Paderborn
Download report

[TR-480-99]
A. Bäumker W. Dittrich and F. Meyer auf der Heide: " Truly Efficient Parallel Algorithms: 1-Optimal Multisearch for an Extension of the BSP Model", 1999
WP(s): 4.1, responsible site: Paderborn
Download report

[TR-269-97]
A. Bäumker and F. Meyer auf der Heide: " Communication Efficient Parallel Searching", 1997
WP(s): 3.1, responsible site: Paderborn
Download report

[TR-298-97]
L. Becchetti and C. Gaibisso: " Lower Bounds for the Virtual Path Layout in ATM Networks", 1997
WP(s): 3.1, responsible site: Rome
Download report

[TR-301-97]
A. Beimel A. Gal and M. Paterson: " Lower Bounds for Monotone Span Programs", 1997
WP(s): 3.2, responsible site: Warwick
Download report

[TR-346-98]
P. Berenbrink T. Friedetzky and E.W. Mayr: " Parallel Continuous Randomized Load Balancing", 1998
WP(s): 3.1, responsible site: Paderborn
Download report

[TR-489-99]
P. Berenbrink T. Friedetzky and A. Steger: " Randomized and Adversarial Load Balancing", 1999
WP(s): 4.1, responsible site: Paderborn
Download report

[TR-272-97]
P. Berenbrink F. Meyer auf der Heide and K. Schroeder: " Allocating Weighted Jobs in Parallel", 1997
WP(s): 3.1, responsible site: Paderborn
Download report

[TR-479-99]
P. Berenbrink F. Meyer auf der Heide and K. Schröder: " Allocating Weighted Jobs in Parallel", 1999
WP(s): 4.1, responsible site: Paderborn
Download report

[TR-488-99]
P. Berenbrink M. Riedel and C. Scheideler: " Simple Competitive Request Scheduling Strategies", 1999
WP(s): 3.1, responsible site: Paderborn
Download report

[TR-492-99]
P. Berenbrink and C. Scheideler: " Locally Efficient On-Line Strategies for Routing Packets along Fixed Paths", 1999
WP(s): 3.1, responsible site: Paderborn
Download report

[TR-166-97]
J.C. Bermond M. Di Ianni M. Flammini and S. Perennes: " Acyclic Orientations for Deadlock Prevention in Interconnection Networks", 1997
WP(s): 3.1, responsible site: Rome
Download report

[TR-314-98]
V. Berry: " An improved polynomial time algorithm for computing the refined Buneman tree", 1998
WP(s): 3.2, responsible site: Warwick
Download report

[TR-315-98]
V. Berry and O. Gascuel: " Inferring Evolutionary Trees with Strong Combinatorial Evidence", 1998
WP(s): 3.2, responsible site: Warwick
Download report

[TR-294-97]
P. Bertolazzi G. Di Battista and W. Didimo: " Computing Orthogonal Drawings with the Minimun Number of Bends", 1997
WP(s): 1.2, responsible site: Rome
Download report

[TR-423-98]
S.L. Bezrukov: " On the Equivalence in Discrete Extremal Problems", 1998
WP(s): 3.2, responsible site: Paderborn
Download report

[TR-425-98]
S.L. Bezrukov: " Edge Isoperimetric Problems on Graphs", 1998
WP(s): 3.2, responsible site: Paderborn
Download report

[TR-426-98]
S.L. Bezrukov: " On Posets whose Products are Macaulay", 1998
WP(s): 3.2, responsible site: Paderborn
Download report

[TR-422-98]
S.L. Bezrukov and A. Blokhuis: " A Kruskal-Katona Type Theorem for the Linear Lattice", 1998
WP(s): 3.2, responsible site: Paderborn
Download report

[TR-347-98]
S.L. Bezrukov J.D. Chavez L.K. Harper M. Röttger and U.P. Schröder: " Embedding of Hypercubes into Grids", 1998
WP(s): 3.1, responsible site: Paderborn
Download report

[TR-349-98]
S.L. Bezrukov J.D. Chavez L.K. Harper M.. Röttger and U.P. Schröder: " The Congestion of n-Cube Layout on a Rectangular Grid", 1998
WP(s): 3.1, responsible site: Paderborn
Download report

[TR-495-99]
S.L. Bezrukov R. Elsässer and U.P. Schroeder: " On k-Partitioning of Hamming Graphs", 1999
WP(s): 3.2, responsible site: Paderborn
Download report

[TR-424-98]
S.L. Bezrukov and B. Monien: " Embedding Ladders and Caterpillars into the Hypercube", 1998
WP(s): 3.2, responsible site: Paderborn
Download report

[TR-351-98]
S.L. Bezrukov and U.P. Schröder: " The Cyclic Wirelength of Trees", 1998
WP(s): 3.1, responsible site: Paderborn
Download report

[TR-283-97]
H.L. Bodlaender: " Treewidth: Algorithmic Techniques and Results", 1997
WP(s): 3.2, responsible site: Utrecht
Download report

[TR-328-98]
H.L. Bodlaender and D.M. Thilikos: " Computing Small Search Numbers in Linear Time", 1998
WP(s): 3.2, responsible site: Utrecht
Download report

[TR-331-98]
H.L. Bodlaender and D.M. Thilikos: " Graphs with Branchwidth at most Three", 1998
WP(s): 3.2, responsible site: Utrecht
Download report

[TR-297-97]
H.L. Bodlaender and B. de Fluiter: " Parallel Algorithms for Series Parallel Graphs", 1997
WP(s): 3.2, responsible site: Utrecht
Download report

[TR-447-99]
M.Ll. Bonet J.L. Esteban N. Galesi and J. Johannsen: " Exponential separations between Resticted Resolution and Cutting Planes Proof Systems", 1999
WP(s): 3.2, responsible site: Barcelona
Download report

[TR-491-99]
O. Bonorden B.H.H. Juurlink I. von Otte and I. Rieping: " The Paderborn University BSP (PUB) Library - Design Implementation and Performance", 1999
WP(s): 4.1, responsible site: Paderborn
Download report

[TR-014-96]
P. Bose G. Di Battista W. Lenhart and G. Liotta: " Proximity Constraints and Representable Trees", 1996
WP(s): 1.2, responsible site: Rome
Download report

[TR-202-97]
L. Boug\'e J. Gabarr\'o X. Messeguer and N. Schabanel: " Concurrent Rebalancing of AVL Trees: A Fine-Grained Approach", 1997
WP(s): 3.1, responsible site: Barcelona
Download report

[TR-319-98]
L. Boug\'e J. Gabarr\'o X. Messeguer and N. Schabanel: " Height-relaxed AVL rebalancing: A unified fine-grained approach to concurrent dictionaries", 1998
WP(s): 3.1, responsible site: Barcelona
Download report

[TR-157-97]
C. Bouras J. Garofalakis P. Spirakis and V. Triantafillou: " A General Performance Model for Multistage Interconnection Networks", 1997
WP(s): 3.1, responsible site: CTI
Download report

[TR-011-96]
C. Bouras V. Kapoulas T. Pantziou and P. Spirakis: " Randomized adaptive video on demand", 1996
WP(s): 3.3, responsible site: CTI
Download report

[TR-215-97]
J. Boyar and K.S. Larsen: " The Seat Reservation Problem", 1997
WP(s): 3.3, responsible site: Aarhus
Download report

[TR-435-99]
J. Boyar K.S. Larsen and N. Nielsen: " Separating the accomodating ratio from the competetive ratio", 1999
WP(s): 3.2, responsible site: Aarhus
Download report

[TR-436-99]
J. Boyar K.S. Larsen and N. Nielsen: " The accomodating function - a generalisation of the competetive ratio", 1999
WP(s): 3.2, responsible site: Aarhus
Download report

[TR-386-98]
J. Boyar R. Peralta and D. Pouchev: " On the Multiplicative Complexity over the Basis (AND XOR 1)", 1998
WP(s): 3.3, responsible site: Aarhus
Download report

[TR-066-96]
M. Boyer G. Brassard P. Hxyer and A. Tapp: " Tight Bounds on Quantum Searching", 1996
WP(s): 3.1, responsible site: Aarhus
Download report

[TR-049-96]
D. Breslauer T. Jiang and Z. Jiang: " Rotation of Periodic Strings and Short Superstrings", 1996
WP(s): 3.2, responsible site: Aarhus
Download report

[TR-084-96]
K. Brockmann and R. Wanka: " Efficient Oblivious Parallel Sorting on the MasPar MP-1", 1996
WP(s): 3.1, responsible site: Paderborn
Download report

[TR-138-97]
G.S. Brodal: " Predecessor Queries in Dynamic Integer Sets", 1997
WP(s): 3.2, responsible site: Aarhus
Download report

[TR-139-97]
G.S. Brodal: " Priority Queues on Parallel Machines", 1997
WP(s): 3.2, responsible site: Aarhus
Download report

[TR-262-97]
G.S. Brodal: " Finger Search Trees with Constant Insertion Time", 1997
WP(s): 3.2, responsible site: MPI
Download report

[TR-097-96]
G.S. Brodal S. Chaudhuri and J. Radhakrishnan: " The Randomized Complexity of Maintaining the Minimum", 1996
WP(s): 3.3, responsible site: Aarhus
Download report

[TR-053-96]
G.S. Brodal and T. Husfeldt: " Communication Complexity Proof that Symmetric Functions have Logarithmic Depth", 1996
WP(s): 3.1, responsible site: Aarhus
Download report

[TR-261-97]
G.S. Brodal and J. Katajainen: " Worst-Case Efficient External-Memory Priority Queues", 1997
WP(s): 3.2, responsible site: MPI
Download report

[TR-441-99]
G.S. Brodal R. Lyngs\o C.N.S. Pedersen and J. Stoye: " Finding maximal pairs with bounded gap", 1999
WP(s): 3.2, responsible site: Aarhus
Download report

[TR-325-98]
G.S. Brodal and M.C. Pinotti: " Comparator Networks for binary Heap Construction", 1998
WP(s): 3.2, responsible site: MPI
Download report

[TR-098-96]
G.G. Brodal and S. Skyum: " The Complexity of Computing the $k$-ary Composition of a Binary Associative Operator", 1996
WP(s): 3.1, responsible site: Aarhus
Download report

[TR-209-97]
A. Brodnik P.B. Miltersen and J.I. Munro: " Trans-Dichotomous Algorithms without Multiplication - some Upper and Lower Bounds", 1997
WP(s): 3.2, responsible site: Aarhus
Download report

[TR-050-96]
M. Buhr: " Newspaper Layout Aesthetics Judged by Artificial Neural Nets", 1996
WP(s): 4.3, responsible site: Aarhus
Download report

[TR-096-96]
J.F. Buss G.S. Fr sen and J.O. Shallit: " The Computational Complexity of Some Problems of Linear Algebra", 1996
WP(s): 3.1, responsible site: Aarhus
Download report

[TR-498-99]
R. Butenuth and H.U. Heiss: " Shared Memory Programming on PC-based SCI Clusters", 1999
WP(s): 4.1, responsible site: Paderborn
Download report

[TR-499-99]
R. Butenuth and H.U. Heiss: " SCI for TCP/IP with Linux", 1999
WP(s): 4.1, responsible site: Paderborn
Download report

[TR-193-97]
E. Caceres F. Dehne A. Ferreira P. Flocchini I. Rieping A. Roncato N. Santoro and S.W. Song: " Efficient parallel graph algorithms for coarse grained multicomputers and BSP", 1997
WP(s): 3.1, responsible site: Paderborn
Download report

[TR-222-97]
I. Caragiannis C. Kaklamanis and P. Persiano: " Bounds on Optical Bandwidth Allocation on Directed Fiber Tree Topologies", 1997
WP(s): 3.2, responsible site: CTI
Download report

[TR-371-98]
I. Caragiannis C. Kaklamanis and P. Persiano: " Wavelength Routing of Symmetric Communication Requests in Directed Fiber Trees", 1998
WP(s): 3.1, responsible site: CTI
Download report

[TR-449-99]
J. Castro and D. Guijarro: " Query PACS and simple-PAC Learning", 1999
WP(s): 3.3, responsible site: Barcelona
Download report

[TR-360-98]
G. Cattaneo U. Ferraro G.F. Italiano and V. Scarano: " Concurrent Algorithm and Data Types Animation over the Internet", 1998
WP(s): 1.1, responsible site: Rome
Download report

[TR-118-96]
G. Cattaneo and G.F. Italiano: " A First Implementation of Sparsification", 1996
WP(s): 1.1, responsible site: Rome
Download report

[TR-433-99]
G. Cattaneo and G.F. Italiano: " Algorithm Engineering", 1999
WP(s): 1.1, responsible site: Rome
Download report

[TR-038-96]
S. Chakrabarti and S. Muthukrishnan: " Resource Scheduling for parallel database and scientific applications", 1996
WP(s): 3.2, responsible site: Warwick
Download report

[TR-129-96]
S. Chaudhuri and N. Garg: " Generalized $k$-Center Problems", 1996
WP(s): 3.2, responsible site: MPI
Download report

[TR-396-98]
P. Chicourrat H. de Fraysseix P. Ossona de Mendez and P. Rosenstiehl: " A Hierarchical Diagram Drawing Software", 1998
WP(s): 1.2, responsible site: EHESS
Download report

[TR-201-97]
B.S. Chlebus A. Czumaj and J.F. Sibeyn: " Routing on the PADAM: Degrees of Optimality", 1997
WP(s): 3.1, responsible site: Paderborn
Download report

[TR-267-97]
B.S. Chlebus A. Czumaj L. Gasieniec M. Kowaluk W. Plandowski: " Algorithms for the Parallel Alternating Direction Access Machine", 1997
WP(s): 3.1, responsible site: Paderborn
Download report

[TR-106-96]
T. Christof M. Jünger J. Kececioglu P. Mutzel and G. Reinelt: " A branch-and-cut approach to physical mapping with end-probes", 1996
WP(s): 3.2, responsible site: Cologne
Download report

[TR-175-97]
F. Chyzak: " An Extension of Zeilberger's Fast Algorithm to General Holonomic Functions", 1997
WP(s): 4.5, responsible site: INRIA
Download report

[TR-287-97]
F. Chyzak: " Groebner Bases Symbolic Summation and Symbolic Integration", 1997
WP(s): 4.5, responsible site: INRIA
Download report

[TR-031-96]
F. Chyzak and B. Salvy: " Non-commutative Elimination in ORE Algebras proves Multivariate Identities", 1996
WP(s): 4.5, responsible site: INRIA
Download report

[TR-075-96]
S. Cicerone D. Frigioni U. Nanni and F. Pugliese: " Counting Edges in a Digraph", 1996
WP(s): 3.2, responsible site: Rome
Download report

[TR-388-98]
S. Cicerone Di Stefano G. and M. Flammini: " Static and Dynamic Low Congested Interval Routing Scheme", 1998
WP(s): 3.1, responsible site: Rome
Download report

[TR-389-98]
S. Cicerone Di Stefano G. and M. Flammini: " Low Congested Interval Routing Schemes for Hypercube-Like Networks", 1998
WP(s): 3.1, responsible site: Rome
Download report

[TR-291-97]
J. Clement P. Flajolet and B. Vall\'ee: " The Analysis of Hybrid Trie Structures", 1997
WP(s): 3.2, responsible site: INRIA
Download report

[TR-476-99]
J. Clement P. Flajolet and B. Vall\'ee: " Dynamical Sources in Information Theory: A General Analysis of Trie Structures", 1999
WP(s): 3.3, responsible site: INRIA
Download report

[TR-255-97]
E.G. Coffman P. Flajolet L. Flatto and M. Hofri: " The Maximum of a Random Walk and Its Application to Rectangle Packing", 1997
WP(s): 3.3, responsible site: INRIA
Download report

[TR-317-98]
R. Cole B. Maggs F. Meyer auf der Heide M. Mitzenmacher A.W. Richa K. Schröder R. Sitaraman and B. Vöcking: " Randomized Protocols for Low-Congestion Circuit Routing in Multistage Interconnection Network", 1998
WP(s): 3.3, responsible site: Paderborn
Download report

[TR-500-99]
H. Crapo and Le Conte de Poly-Barbut C.: " Unities and Negation", 1999
WP(s): 3.2, responsible site: EHESS
Download report

[TR-504-99]
H. Crapo and P. Rosenstiehl: " On 'Lacets' and their manifolds", 1999
WP(s): 1.2, responsible site: EHESS
Download report

[TR-303-97]
M. Cryan L.A. Goldberg and C.A. Phillips: " Approximation Algorithms for the Fixed-Topology Phylogenetic Number Problem", 1997
WP(s): 3.2, responsible site: Warwick
Download report

[TR-402-98]
M. Cryan L.A. Goldberg and P.W. Goldberg: " Evolutionary Trees can be Learned in Polynomial Time in the Two-State General Markov Model", 1998
WP(s): 3.3, responsible site: Warwick
Download report

[TR-082-96]
R. Cypher F. Meyer auf der Heide C. Scheideler and B. Vöcking: " Universal Algorithms for Store-and-Forward and Wormhole Routing", 1996
WP(s): 3.1, responsible site: Paderborn
Download report

[TR-356-98]
A. Czumaj: " Recovery Time of Dynamic Allocation Processes", 1998
WP(s): 3.1, responsible site: Paderborn
Download report

[TR-292-97]
A. Czumaj P. Ferragina L. Gasieniec S. Muthukrishnan and J.L. Träff: " The Architecture of a Software Library for String Processing", 1997
WP(s): 2.3, responsible site: MPI
Download report

[TR-060-96]
A. Czumaj P. Kanarek M. Kutylowski and K. Lorys: " Fast Generation of Random Permutations via Networks Simulation", 1996
WP(s): 3.3, responsible site: Paderborn
Download report

[TR-483-99]
A. Czumaj and A. Lingas: " On Approximability of the Minimum-Cost k-Connected Spanning Subgraph Problem", 1999
WP(s): 3.2, responsible site: Paderborn
Download report

[TR-484-99]
A. Czumaj and A. Lingas: " A Polynomial Time Approximation Scheme for Euclidean Minimum Cost k-Connectivity", 1999
WP(s): 3.2, responsible site: Paderborn
Download report

[TR-496-99]
A. Czumaj F. Meyer auf der Heide and V. Stemann: " Contention Resolution in Hashing Based Shared Memory Simulations", 1999
WP(s): 3.2, responsible site: Paderborn
Download report

[TR-481-99]
A. Czumaj K. Przemyslawa M. Kutylowski and K. Lorys: " Fast Generation of Random Permutations Via Networks Simulation", 1999
WP(s): 3.1, responsible site: Paderborn
Download report

[TR-482-99]
A. Czumaj K. Przemyslawa M. Kutylowski and K. Lorys: " Delayed Path Coupling and Generating Random Permutations via Distributed Stochastic Processes", 1999
WP(s): 3.3, responsible site: Paderborn
Download report

[TR-485-99]
A. Czumaj and V. Stemann: " Randomized Allocation Processes", 1999
WP(s): 4.1, responsible site: Paderborn
Download report

[TR-200-97]
A. Czumaj and W.B. Strothmann: " Bounded Degree Spanning Trees", 1997
WP(s): 3.2, responsible site: Paderborn
Download report

[TR-465-99]
E. Dahlhaus: " An Improved Linear Time Algorithm for Minimal Elimination Ordering in Planar Graphs that is Parallelizable", 1999
WP(s): 3.2, responsible site: Cologne
Download report

[TR-466-99]
E. Dahlhaus: " Minimal Elimination Ordering for Graphs of Bounded Degree", 1999
WP(s): 3.2, responsible site: Cologne
Download report

[TR-467-99]
E. Dahlhaus: " Minimum Fill-in and Treewidth for Graphs Modularly Decomposable into Chordal Graphs", 1999
WP(s): 3.2, responsible site: Cologne
Download report

[TR-468-99]
E. Dahlhaus: " Minimal Elimination Ordering Inside a Given Chordal Graph", 1999
WP(s): 3.2, responsible site: Cologne
Download report

[TR-185-97]
V. Dalmau: " A Dichotomy Theorem for Learning Quantified Boolean Formulas", 1997
WP(s): 3.3, responsible site: Barcelona
Download report

[TR-284-97]
V. Dalmau: " Some Dichotomy Theorems on Constant-free Quantified Boolean Formulas", 1997
WP(s): 3.2, responsible site: Barcelona
Download report

[TR-033-96]
H. Daude P. Flajolet and B. Vall\'ee: " An Average-case Analysis of the Gaussian Algorithm for Lattice Reduction", 1996
WP(s): 3.3, responsible site: INRIA
Download report

[TR-101-96]
C. De Simone M. Diehl M. Jünger P. Mutzel G. Reinelt and G. Rinaldi: " Exact Ground States of Two-Dimensional $\pm$J Ising Spin Glasses", 1996
WP(s): 1.3, responsible site: Cologne
Download report

[TR-102-96]
C. De Simone and M. Jünger: " On the Two-Connected Planar Spanning Subgraph Polytope", 1996
WP(s): 1.2, responsible site: Cologne
Download report

[TR-195-97]
T. Decker: " Virtual data space - A universal load balancing scheme", 1997
WP(s): 4.1, responsible site: Paderborn
Download report

[TR-067-96]
T. Decker and R. Diekmann: " Mapping of Coarse-Grained Applications onto Workstations-Clusters", 1996
WP(s): 4.1, responsible site: Paderborn
Download report

[TR-275-97]
T. Decker and R. Diekmann: " Mapping of Coarse-Grained Applications onto Workstation-Clusters", 1997
WP(s): 4.1, responsible site: Paderborn
Download report

[TR-068-96]
T. Decker R. Diekmann R. Lüling and B. Monien: " Towards Developing Universal Dynamic Mapping Algorithms", 1996
WP(s): 4.1, responsible site: Paderborn
Download report

[TR-497-99]
T. Decker W. Krandick: " Parallel Real Root Isolation using the Descartes Method", 1999
WP(s): 4.1, responsible site: Paderborn
Download report

[TR-355-98]
T. Decker R. Lüling and S. Tschöke: " A Distributed Load Balancing Algorithm for Heterogeneous Parallel Computing Systems", 1998
WP(s): 3.1, responsible site: Paderborn
Download report

[TR-268-97]
F. Dehne W. Dittrich and D. Hutchinson: " Efficient external memory algorithms by simulating coarse-grained parallel algorithms", 1997
WP(s): 3.1, responsible site: Paderborn
Download report

[TR-380-98]
C. Demetrescu and I. Finocchi: " A general purpose logic based visualization framework", 1998
WP(s): 4.4, responsible site: Rome
Download report

[TR-381-98]
C. Demetrescu and I. Finocchi: " A technique for generating graphical abstractions of program data structures", 1998
WP(s): 4.4, responsible site: Rome
Download report

[TR-023-96]
S. Denazis N. Pronios P. Spirakis and B. Tampakas: " An approach towards the simulation of ATM switches", 1996
WP(s): 4.2, responsible site: CTI
Download report

[TR-154-97]
O. Devillers G. Liotta F.P. Preparata and R. Tamassia: " Checking the Convexity of Polytopes and the Planarity of Subdivisions", 1997
WP(s): 3.2, responsible site: Rome
Download report

[TR-028-96]
L. Devroye P. Flajolet F. Hurtado M. Noy and W. Steiger: " Random Triangulations", 1996
WP(s): 3.3, responsible site: INRIA
Download report

[TR-236-97]
A. Deza M. Deza and V. Grishukhin: " Fullerenes and coordination polyhedra versus half-cubes embeddings", 1997
WP(s): 3.2, responsible site: EHESS
Download report

[TR-124-96]
G. Di Battista: " First implementation of QuickOrthogonal and OptimalOrthogonal", 1996
WP(s): 1.2, responsible site: Rome
Download report

[TR-015-96]
G. Di Battista G. Liotta and S.H. Whitesides: " The Strength of Weak Proximity", 1996
WP(s): 1.2, responsible site: Rome
Download report

[TR-009-96]
J. Diaz S. Nikoletseas M. Serna and P. Spirakis: " A genetic approach for the parallel almost-uniform generation and approximate counting of matchings", 1996
WP(s): 3.3, responsible site: CTI
Download report

[TR-110-96]
J. Diaz S. Nikoletseas M. Serna and P. Spirakis: " A genetic approach for the parallel almost-uniform generation and approximate counting of matchings", 1996
WP(s): 3.2, responsible site: CTI
Download report

[TR-159-97]
J. Diaz S. Nikoletseas M. Serna and P. Spirakis: " A Genetic Approach for the Parallel Almost-Uniform Generation and Approximate Counting of Matchings (revised)", 1997
WP(s): 3.2, responsible site: CTI
Download report

[TR-416-98]
J. Diaz M.D. Penrose J. Petit i Silvestre and M. Serna: " Approximating Layout Problems on Geometric Random Graphs", 1998
WP(s): 3.3, responsible site: Barcelona
Download report

[TR-453-99]
J. Diaz M.D. Penrose J. Petit i Silvestre and M. Serna: " Convergence theorems for some layout measures on random lattice and random geometric graphs", 1999
WP(s): 3.3, responsible site: Barcelona
Download report

[TR-454-99]
J. Diaz M.D. Penrose J. Petit i Silvestre and M. Serna: " Linear Orderings of Random Geometric Graphs", 1999
WP(s): 3.3, responsible site: Barcelona
Download report

[TR-321-98]
J. Diaz J. Petit i Silvestre and P. Spirakis: " Heuristics for the MinLa Problem: Some Theoretical and Experimental Considerations", 1998
WP(s): 3.3, responsible site: Barcelona
Download report

[TR-322-98]
J. Diaz J. Petit i Silvestre M. Serna and P. Spirakis: " Sampling Matchings in Parallel", 1998
WP(s): 3.3, responsible site: Barcelona
Download report

[TR-414-98]
J. Diaz J. Petit i Silvestre and M. Serna: " Random Geometric Problems on $[01]^2$", 1998
WP(s): 3.3, responsible site: Barcelona
Download report

[TR-417-98]
J. Diaz J. Petit i Silvestre M. Serna and L. Trevisan: " Approximating Layout Problems on Random Sparse Graphs", 1998
WP(s): 3.3, responsible site: Barcelona
Download report

[TR-111-96]
J. Diaz M. Serna and P. Spirakis: " Sampling matching in parallel", 1996
WP(s): 3.3, responsible site: CTI
Download report

[TR-286-97]
J. Diaz M. Serna and P. Spirakis: " Linear and Non-linear Systems: A Survey", 1997
WP(s): 3.3, responsible site: Barcelona
Download report

[TR-293-97]
W. Didimo and A. Leonforte: " GRID: an Interactive Tool for Computing Orthogonal Drawings with the Minimun Number of Bends", 1997
WP(s): 1.2, responsible site: Rome
Download report

[TR-059-96]
R. Diekmann R. Lüling B. Monien and C. Spräner: " Combining Helpful Sets and Parallel Simulated Annealing for the Graph-Partitioning Problem", 1996
WP(s): 4.1, responsible site: Paderborn
Download report

[TR-421-98]
R. Diekmann and B. Monien: " Efficient Schemes for Nearest Neighbor Load Balancing", 1998
WP(s): 4.1, responsible site: Paderborn
Download report

[TR-353-98]
R. Diekmann R. Preis F. Schlimbach and C. Walshaw: " Quality Balancing for Parallel Adaptive FEM", 1998
WP(s): 3.1, responsible site: Paderborn
Download report

[TR-354-98]
R. Diekmann R. Preis F. Schlimbach and C. Walshaw: " Aspect Ratio for Mesh Partitioning", 1998
WP(s): 3.1, responsible site: Paderborn
Download report

[TR-368-98]
C. Domingo R. Gavald\'a and O. Watanabe: " Practical Algorithms for On-line Sampling", 1998
WP(s): 3.2, responsible site: Barcelona
Download report

[TR-452-99]
C. Domingo R. Gavald\'a and O. Watanabe: " On-Line Sampling Methods for Discovering Association Rules", 1999
WP(s): 3.3, responsible site: Barcelona
Download report

[TR-367-98]
C. Domingo N. Mishra and L. Pitt: " Efficient Read-Restricted Monotone CNF/DNF Dualization by Learning with Membership Queries", 1998
WP(s): 3.2, responsible site: Barcelona
Download report

[TR-412-98]
C. Domingo O. Watanabe and T. Yamazaki: " A role of constraint in self organization", 1998
WP(s): 3.3, responsible site: Barcelona
Download report

[TR-385-98]
D. Dubhashi: " Martingales and Locality in Distributed Computing", 1998
WP(s): 3.3, responsible site: Aarhus
Download report

[TR-051-96]
D. Dubhashi D.A. Grable and A. Panconesi: " Near-Optimal Distributed Edge Colouring via the Nibble Method", 1996
WP(s): 3.3, responsible site: Aarhus
Download report

[TR-420-98]
A. Duch V. Estivill-Castro and C. Martinez: " Randomized k-Dimensional Binary Search Trees", 1998
WP(s): 3.3, responsible site: Barcelona
Download report

[TR-161-97]
T. Eilam M. Flammini and S. Zaks: " A Complete Characterization of the Path Layout Construction Problem for ATM Networks with Given Hop Count and Load", 1997
WP(s): 3.1, responsible site: Rome
Download report

[TR-512-99]
R. Elsässer A. Frommer B. Monien and R. Preis: " Optimal and Alternating-Direction Load Balancing Schemes", 1999
WP(s): 4.1, responsible site: Paderborn
Download report

[TR-056-96]
D. Eppstein Z. Galil and G.F. Italiano: " Dynamic graph algorithms", 1996
WP(s): 3.2, responsible site: Rome
Download report

[TR-057-96]
D. Eppstein Z. Galil G.F. Italiano and A. Nissenzweig: " Sparsification -- A technique for speeding up dynamic graph algorithms", 1996
WP(s): 3.2, responsible site: Rome
Download report

[TR-117-96]
D. Eppstein Z. Galil G.F. Italiano and T.H. Spencer: " Separator based sparsification II: edge and vertex connectivity", 1996
WP(s): 3.2, responsible site: Rome
Download report

[TR-223-97]
T. Erlebach K. Jansen C. Kaklamanis and P. Persiano: " Constrained Bipartite Edge Coloring with Applications to Wavelength Routing", 1997
WP(s): 3.2, responsible site: CTI
Download report

[TR-340-98]
S. Even S. Muthukrishnan M. Paterson and S.C. Sahinalp: " Layout of the Batcher Bitonic Sorter", 1998
WP(s): 3.1, responsible site: Warwick
Download report

[TR-062-96]
R. Fagerberg: " Binary Search Trees: How Low Can You Go?", 1996
WP(s): 3.2, responsible site: Aarhus
Download report

[TR-063-96]
R. Fagerberg: " Optimal Rebalancing of Binary Search Trees", 1996
WP(s): 3.2, responsible site: Aarhus
Download report

[TR-065-96]
R. Fagerberg: " A Note on Worst Case Efficient Meldable Priority Queues", 1996
WP(s): 3.2, responsible site: Aarhus
Download report

[TR-039-96]
M. Farach and S. Muthukrishnan: " Optimal logarithmic time randomized suffix tree construction", 1996
WP(s): 2.3, responsible site: Warwick
Download report

[TR-040-96]
M. Farach and S. Muthukrishnan: " Perfect hashing for string: formalization and algorithms", 1996
WP(s): 2.3, responsible site: Warwick
Download report

[TR-107-96]
P. Fatourou M. Mavronicolas and P. Spirakis: " Efficient Rate-Based Flow Control Algorithms", 1996
WP(s): 3.2, responsible site: CTI
Download report

[TR-225-97]
P. Fatourou M. Mavronicolas and P. Spirakis: " Advances in Rate-Based Flow Control", 1997
WP(s): 3.2, responsible site: CTI
Download report

[TR-248-97]
P. Fatourou M. Mavronicolas and P. Spirakis: " Priority Max-Min Flow Control Sensitive to Traffic Levels", 1997
WP(s): 3.1, responsible site: CTI
Download report

[TR-377-98]
P. Fatourou M. Mavronicolas and P. Spirakis: " The Global Efficiency of Distributed Rate-Based Flow Control Algorithms", 1998
WP(s): 3.1, responsible site: CTI
Download report

[TR-250-97]
P. Fatourou G.E. Pantziou P. Spirakis P. Zarafidis and A. Zoura: " Implementation of a Linear Expected-Time Algorithm for Finding Connected Components", 1997
WP(s): 1.1, responsible site: CTI
Download report

[TR-034-96]
P. Fatourou and P. Spirakis: " Scheduling Algorithms for Strict Multithreaded Computations", 1996
WP(s): 3.1, responsible site: CTI
Download report

[TR-316-98]
U. Feige and C. Scheideler: " Improved Bounds for Acyclic Job Shop Scheduling", 1998
WP(s): 3.1, responsible site: Paderborn
Download report

[TR-041-96]
P. Ferragina and S. Muthukrishnan: " Efficient dynamic method-lookup for object oriented languages", 1996
WP(s): 3.2, responsible site: Warwick
Download report

[TR-263-97]
S. Fialko and P. Mutzel: " A new approximation algorithm for the planar augmentation problem", 1997
WP(s): 1.2, responsible site: MPI
Download report

[TR-265-97]
A. Fiat and S. Leonardi: " On-line Network Routing - A Survey", 1997
WP(s): 3.2, responsible site: MPI
Download report

[TR-128-96]
U. Finkler and K. Mehlhorn: " Runtime Predictions of Real Programs on Real Machines", 1996
WP(s): 1.1, responsible site: MPI
Download report

[TR-344-98]
M. Fischer T. Lukovszki and M. Ziegler: " Geometric Searching in Walk-Through Animations with Weak Spanners in Real Time", 1998
WP(s): 3.2, responsible site: Paderborn
Download report

[TR-362-98]
P. Flajolet: " Singularity analisys and asymptotics of Bernoulli sums", 1998
WP(s): 3.3, responsible site: INRIA
Download report

[TR-032-96]
P. Flajolet X. Gourdon and D. Panario: " Random Polynomials and Polinomial Factorization", 1996
WP(s): 3.3, responsible site: INRIA
Download report

[TR-125-96]
P. Flajolet X. Gourdon and C. Martinez: " Patterns in Random Binary Search Trees", 1996
WP(s): 3.3, responsible site: INRIA
Download report

[TR-308-98]
P. Flajolet X. Gourdon and D. Panario: " The Complete Analysis of a Polynomial Factorization Algorithm over Finite Fields", 1998
WP(s): 3.3, responsible site: INRIA
Download report

[TR-475-99]
P. Flajolet and F. Guillemin: " The Formal Theory of Birth-and-Death Processes Lattice Path Combinatorics and Continued Fractions", 1999
WP(s): 3.3, responsible site: INRIA
Download report

[TR-179-97]
P. Flajolet and M. Noy: " Analytic Combinatorics of Non-crossing Configurations", 1997
WP(s): 3.3, responsible site: INRIA
Download report

[TR-253-97]
P. Flajolet P. Poblete and A. Viola: " On the Analysis of Linear Probing Hashing", 1997
WP(s): 4.5, responsible site: INRIA
Download report

[TR-309-98]
P. Flajolet and H. Prodinger: " On Stirling Numbers for Complex Argument and Hankel Contours", 1998
WP(s): 3.3, responsible site: INRIA
Download report

[TR-133-97]
P. Flajolet and B. Salvy: " Euler Sums and Contour Integral Representations", 1997
WP(s): 4.5, responsible site: INRIA
Download report

[TR-251-97]
P. Flajolet and B. Salvy: " The SIGSAM Challenges: Symbolic Asymptotics in Practice", 1997
WP(s): 4.5, responsible site: INRIA
Download report

[TR-027-96]
P. Flajolet and R. Sedgewick: " The Average Case Analysis of Algorithms: Mellin Transform Asymptotics", 1996
WP(s): 3.3, responsible site: INRIA
Download report

[TR-176-97]
P. Flajolet and R. Sedgewick: " The Average Case Analysis of Algorithms: Multivariate Asymptotics and Limit Distributions", 1997
WP(s): 3.3, responsible site: INRIA
Download report

[TR-430-98]
P. Flajolet and W. Szpankowski: " Analytic Variations on Redundancy Rates of Renewal Processes", 1998
WP(s): 3.3, responsible site: INRIA
Download report

[TR-126-96]
P. Flajolet and B. Vall\'ee: " Continued Fraction Algorithms Functional Operators and Structure Constants", 1996
WP(s): 3.3, responsible site: INRIA
Download report

[TR-162-97]
M. Flammini: " Deadlock-Free Interval Routing Schemes", 1997
WP(s): 3.1, responsible site: Rome
Download report

[TR-167-97]
M. Flammini: " On the Hardness of Devising Interval Routing Schemes", 1997
WP(s): 3.1, responsible site: Rome
Download report

[TR-163-97]
M. Flammini G. Gambosi U. Nanni and R.B. Tan: " Multi-Dimensional Interval Routing Schemes", 1997
WP(s): 3.1, responsible site: Rome
Download report

[TR-390-98]
M. Flammini G. Gambosi U. Nanni and R.B. Tan: " Characterization Results of All Shortest Paths Interval Routing Schemes", 1998
WP(s): 3.1, responsible site: Rome
Download report

[TR-164-97]
M. Flammini and E. Nardelli: " On the Paths Length in Interval Routing Schemes", 1997
WP(s): 3.1, responsible site: Rome
Download report

[TR-165-97]
M. Flammini and S. Perennes: " Lower Bounds on Systolic Gossip", 1997
WP(s): 3.1, responsible site: Rome
Download report

[TR-387-98]
M. Flammini and S. Perennes: " Lower Bounds on Systolic Gossip (revised)", 1998
WP(s): 3.1, responsible site: Rome
Download report

[TR-160-97]
M. Flammini and C. Scheideler: " Simple Efficient Routing Schemes for All-Optical Networks", 1997
WP(s): 3.1, responsible site: Rome
Download report

[TR-464-99]
T. Fleiner V. Kaibel and G. Rote: " Upper Bounds on the Maximal Number of Facets of 0/1-Polytopes", 1999
WP(s): 3.2, responsible site: Cologne
Download report

[TR-237-97]
R. Fleischer: " On the Bahncard Problem", 1997
WP(s): 3.2, responsible site: MPI
Download report

[TR-394-98]
D. Fotakis G.E. Pantziou G.P. Pentaris and P. Spirakis: " Frequency Assignment in Mobile and Radio Networks", 1998
WP(s): 3.1, responsible site: CTI
Download report

[TR-012-96]
D. Fotakis and P. Spirakis: " (poly$(\log \log n)$poly$(\log \log n)$)-restricted verifiers are unlikely to exist for languages in NP", 1996
WP(s): 3.1, responsible site: CTI
Download report

[TR-112-96]
D. Fotakis and P. Spirakis: " Random Bit Recycling PCPs and the Complexity of NP*", 1996
WP(s): 3.3, responsible site: CTI
Download report

[TR-158-97]
D. Fotakis and P. Spirakis: " Linear Programming and Fast Parallel Approximability", 1997
WP(s): 3.2, responsible site: CTI
Download report

[TR-372-98]
D. Fotakis and P. Spirakis: " Random Walks conditional Hitting Sets and Partial Derandomization", 1998
WP(s): 3.3, responsible site: CTI
Download report

[TR-374-98]
D. Fotakis and P. Spirakis: " Graph Labelling and Assignment of Non-Reusable Frequencies", 1998
WP(s): 3.2, responsible site: CTI
Download report

[TR-459-99]
X. Franch J. Gabarr\'o A. G\'omez A. V\'azquez and J. V\'azquez: " Beginning to Programming pilot course IniPro using Java", 1999
WP(s): 3.2, responsible site: Barcelona
Download report

[TR-004-96]
P.G. Franciosa D. Frigioni and R. Giaccio: " Semi-dynamic Shortest Path and Breadth First Search on Digraph", 1996
WP(s): 3.2, responsible site: Rome
Download report

[TR-384-98]
G.S. Fr sen J.P. Hansen and P.B. Miltersen: " Lower Bounds for Dynamic Algebraic Problems", 1998
WP(s): 3.2, responsible site: Aarhus
Download report

[TR-306-98]
D. Frigioni M. Ioffreda U. Nanni and G. Pasqualone: " Experimental analysis of dynamic algorithms for the single source shortest path problem", 1998
WP(s): 3.2, responsible site: Rome
Download report

[TR-204-97]
D. Frigioni and G.F. Italiano: " Dynamically Switching Vertices in Planar Graphs", 1997
WP(s): 3.2, responsible site: Rome
Download report

[TR-002-96]
D. Frigioni A. Marchetti-Spaccamela and U. Nanni: " Semi-Dynamic Algorithms for Maintaining Single Source Shortest Path Trees", 1996
WP(s): 3.2, responsible site: Rome
Download report

[TR-003-96]
D. Frigioni A. Marchetti-Spaccamela and U. Nanni: " Fully Dynamic Output Bounded Single Source Shortest Path Problem", 1996
WP(s): 3.2, responsible site: Rome
Download report

[TR-289-97]
D. Frigioni A. Marchetti-Spaccamela and U. Nanni: " Dynamic Algorithms for Classes of Constraint Satisfaction Problems", 1997
WP(s): 3.2, responsible site: Rome
Download report

[TR-307-98]
D. Frigioni A. Marchetti-Spaccamela and U. Nanni: " Fully dynamic shortest paths and negative cycle detection on digraphs with arbitrary arc weights", 1998
WP(s): 3.2, responsible site: Rome
Download report

[TR-335-98]
L.C. van der Gaag and H.L. Bodlaender: " Comparing Loop cutsets and Clique Trees in Probabilistic Inference", 1998
WP(s): 3.2, responsible site: Utrecht
Download report

[TR-089-96]
J. Gabarr\'o and X. Messeguer: " Massively Parallel and Distributed Dictionaries on AVL and Brother Trees", 1996
WP(s): 3.1, responsible site: Barcelona
Download report

[TR-216-97]
J. Gabarr\'o and X. Messeguer: " Parallel Dictionaries with Local Rules on AVL and Brother Trees", 1997
WP(s): 3.1, responsible site: Barcelona
Download report

[TR-217-97]
J. Gabarr\'o and X. Messeguer: " A Unified Approach to Concurrent and Parallel Algorithms on Balanced Data Structures", 1997
WP(s): 3.1, responsible site: Barcelona
Download report

[TR-188-97]
J. Gabarr\'o X. Messeguer and D. Riu: " Concurrent Rebalancing on Hyper-Red-Black trees", 1997
WP(s): 3.1, responsible site: Barcelona
Download report

[TR-091-96]
J. Gabarr\'o and J. Petit i Silvestre: " ParaDict a Data Parallel Library for Dictionaries", 1996
WP(s): 3.1, responsible site: Barcelona
Download report

[TR-184-97]
J. Gabarr\'o and J. Petit i Silvestre: " Design implementation and evaluation of ParaDict a data parallel library for dictionary", 1997
WP(s): 3.1, responsible site: Barcelona
Download report

[TR-450-99]
J. Gabarr\'o and J. Rosell\'o: " Self-Organization and Evolution on Large Computer Data Structures", 1999
WP(s): 3.2, responsible site: Barcelona
Download report

[TR-432-99]
Z. Galil G.F. Italiano N. Sarnak and G. Cattaneo: " Fully Dynamic Planarity Testing with Applications", 1999
WP(s): 3.2, responsible site: Rome
Download report

[TR-260-97]
N. Garg and J. Koenemann: " Faster and Simpler Algorithms for Multicommodity Flow and other Fractional Packing Problems", 1997
WP(s): 3.2, responsible site: MPI
Download report

[TR-258-97]
N. Garg G. Konjevod and R. Ravi: " A polylogarithmic approximation algorithm for group Steiner tree problem", 1997
WP(s): 3.2, responsible site: MPI
Download report

[TR-152-97]
N. Garg and C. Man\ss: " Evaluating a 2-approximation algorithm for edge-separators in planar graphs", 1997
WP(s): 3.2, responsible site: MPI
Download report

[TR-013-96]
N. Garg M. Papatriantafilou and P. Tsigas: " Distributed List Coloring: How to Dynamically Allocate Frequencies to Mobile Base Stations", 1996
WP(s): 3.1, responsible site: MPI
Download report

[TR-445-99]
R. Gavald\'a E. Ayguad\'e and J. Torres: " Obtaining Synchronization-Free Code with Maximum Parallelism", 1999
WP(s): 3.1, responsible site: Barcelona
Download report

[TR-203-97]
R. Gavald\'a and H.T. Siegelmann: " Discontinuities in Recurrent Neural Networks", 1997
WP(s): 3.3, responsible site: Barcelona
Download report

[TR-042-96]
B. Ghosh S. Muthukrishnan and M.H. Schulz: " First and second order diffusive methods for rapid coarse distributed load balancing", 1996
WP(s): 4.1, responsible site: Warwick
Download report

[TR-256-97]
M. Giusti K. Haegele G. Lecerf J. March and B. Salvy: " Computing the Dimension of a Projective Variety: the Projective Noether Maple Package", 1997
WP(s): 4.5, responsible site: INRIA
Download report

[TR-469-99]
L.A. Goldberg: " Randomly Sampling Unlabelled Structures", 1999
WP(s): 3.3, responsible site: Warwick
Download report

[TR-043-96]
L.A. Goldberg P.W. Goldberg C.A. Phillips and G.B. Sorkin: " Constructing Computer Virus Phylogenies", 1996
WP(s): 3.2, responsible site: Warwick
Download report

[TR-400-98]
L.A. Goldberg P.W. Goldberg M. Paterson P. Pevzner S.C. Sahinalp and E. Sweedyk: " The Complexity of Gene Placement", 1998
WP(s): 3.2, responsible site: Warwick
Download report

[TR-044-96]
L.A. Goldberg W.E. Hart and D.B. Wilson: " Analysis of a simple learning algorithm: Learning foraging thresholds for lizards", 1996
WP(s): 3.1, responsible site: Warwick
Download report

[TR-045-96]
L.A. Goldberg and M. Jerrum: " Randomly Sampling Molecules", 1996
WP(s): 3.3, responsible site: Warwick
Download report

[TR-338-98]
L.A. Goldberg and M. Jerrum: " The "Burnside Process" Converges Slowly", 1998
WP(s): 3.3, responsible site: Warwick
Download report

[TR-074-96]
L.A. Goldberg and P.D. MacKenzie: " Analysis of Practical Backoff Protocols for Contention Resolution with Multiple Servers", 1996
WP(s): 3.1, responsible site: Warwick
Download report

[TR-304-97]
L.A. Goldberg and P.D. MacKenzie: " Contention Resolution with Guaranteed Constant Expected Delay", 1997
WP(s): 3.1, responsible site: Warwick
Download report

[TR-313-98]
L.A. Goldberg P.D. MacKenzie M. Paterson and A. Srinivasan: " Contention Resolution with Constant Expected Delay", 1998
WP(s): 3.3, responsible site: Warwick
Download report

[TR-302-97]
L.A. Goldberg M. Paterson A. Srinivasan and E. Sweedyk: " Better approximation guarantees for job-shop scheduling", 1997
WP(s): 3.2, responsible site: Warwick
Download report

[TR-471-99]
P.W. Goldberg: " Learning Fixed-dimension Linear Thresholds from Fragmented Data", 1999
WP(s): 3.3, responsible site: Warwick
Download report

[TR-299-97]
P.W. Goldberg C.K.I. Williams and C.M. Bishop: " Regression with Input-dependent Noise: A Gaussian Process Treatment", 1997
WP(s): 3.3, responsible site: Warwick
Download report

[TR-428-98]
D. Grigoriev M. Karpinski F. Meyer auf der Heide and R. Smolensky: " A Lower Bound for Randomized Algebraic Decision Trees", 1998
WP(s): 3.3, responsible site: Paderborn
Download report

[TR-131-97]
R. Grossi and G.F. Italiano: " Suffix trees and their applications in string algorithms", 1997
WP(s): 3.2, responsible site: Rome
Download report

[TR-137-97]
R. Grossi and G.F. Italiano: " Efficient Splitting and Merging Algorithms for Order Decomposable Problems", 1997
WP(s): 3.2, responsible site: Rome
Download report

[TR-361-98]
R. Grossi and G.F. Italiano: " Efficient cross-trees for external memory", 1998
WP(s): 3.2, responsible site: Rome
Download report

[TR-431-99]
R. Grossi and G.F. Italiano: " Efficient Techniques for Maintaining Multidimensional Keys in Linked Data Structures", 1999
WP(s): 3.2, responsible site: Rome
Download report

[TR-410-98]
D. Guijarro and V. Lavin: " Monotone Term Decision Lists", 1998
WP(s): 3.2, responsible site: Barcelona
Download report

[TR-418-98]
D. Guijarro V. Lavin and V. Raghavan: " Exact Learning when Irrelevant Variables Abound", 1998
WP(s): 3.2, responsible site: Barcelona
Download report

[TR-370-98]
K. Hatzis G.P. Pentaris P. Spirakis and B. Tampakas: " Implementation and testing eavesdropper protocols using the DSP tool", 1998
WP(s): 2.2, responsible site: CTI
Download report

[TR-391-98]
K. Hatzis G.P. Pentaris P. Spirakis B. Tampakas and R.B. Tan: " Fundamental Distributed Protocols in Mobile Networks", 1998
WP(s): 3.1, responsible site: CTI
Download report

[TR-393-98]
K. Hatzis G.P. Pentaris P. Spirakis and B. Tampakas: " Counting in Mobile Networks: Theory and Experimentation", 1998
WP(s): 3.1, responsible site: CTI
Download report

[TR-404-98]
M.R. Henzinger and S. Leonardi: " Scheduling Multicasts on Unit-Capacity Trees and Meshes", 1998
WP(s): 3.1, responsible site: MPI
Download report

[TR-076-96]
C.Z. Hu F.C.M. Lau and R. Diekmann: " Decentralized Remapping of Data Parallel Applications in Distributed Memory Multiprocessors", 1996
WP(s): 3.1, responsible site: Paderborn
Download report

[TR-336-98]
T. Husfeldt and T. Rauhe: " Hardness Results for Dynamic Problems by Extensions of Fredman and Saks' Chronogram Method", 1998
WP(s): 3.2, responsible site: Aarhus
Download report

[TR-052-96]
T. Husfeldt T. Rauhe and S. Skyum: " Lower Bounds for Dynamic Transitive Closure Planar Point Location and Parentheses Matching", 1996
WP(s): 3.1, responsible site: Aarhus
Download report

[TR-064-96]
P. Hxyer and K.S. Larsen: " Permutation Routing via Matchings", 1996
WP(s): 3.1, responsible site: Aarhus
Download report

[TR-116-96]
G.F. Italiano and R. Raman: " Topics in data structures", 1996
WP(s): 3.2, responsible site: Rome
Download report

[TR-408-98]
K. Jansen: " The mutual exclusion scheduling problem for permutation and comparability graphs", 1998
WP(s): 3.1, responsible site: MPI
Download report

[TR-409-98]
K. Jansen: " A new characterization for parity graphs and a coloring problem with costs", 1998
WP(s): 3.2, responsible site: MPI
Download report

[TR-405-98]
K. Jansen and L. Porkolab: " Improved Approximation Schemes for Scheduling Unrelated Parallel Machines", 1998
WP(s): 3.1, responsible site: MPI
Download report

[TR-406-98]
K. Jansen and L. Porkolab: " Linear Time Approximation Schemes for Scheduling Malleable Parallel Tasks", 1998
WP(s): 3.1, responsible site: MPI
Download report

[TR-330-98]
M.J. Jansen: " On Applying Separator Decompositions to Path Problems and Network Flow", 1998
WP(s): 3.2, responsible site: Utrecht
Download report

[TR-397-98]
B. Jouve: " A new partitioning of large tournaments", 1998
WP(s): 3.2, responsible site: EHESS
Download report

[TR-235-97]
B. Jouve P. Rosenstiehl and M. Imbert: " A mathematical approach to the connectivity between the cortical visual areas of the macaque monkey", 1997
WP(s): 3.2, responsible site: EHESS
Download report

[TR-100-96]
M. Jünger and V. Kaibel: " A Basic Study of the QAP-Polytope", 1996
WP(s): 3.2, responsible site: Cologne
Download report

[TR-103-96]
M. Jünger and V. Kaibel: " On the SQAP-Polytope", 1996
WP(s): 3.2, responsible site: Cologne
Download report

[TR-243-97]
M. Jünger and V. Kaibel: " Box-Inequalities for Quadratic Assignment Polytopes", 1997
WP(s): 1.3, responsible site: Cologne
Download report

[TR-244-97]
M. Jünger and V. Kaibel: " The QAP-Polytope and the Star-Transformation", 1997
WP(s): 1.3, responsible site: Cologne
Download report

[TR-246-97]
M. Jünger S. Leipert and P. Mutzel: " Pitfalls of using PQ-Trees in Automatic Graph Drawing", 1997
WP(s): 1.2, responsible site: Cologne
Download report

[TR-327-98]
M. Jünger S. Leipert and P. Mutzel: " A Note on Computing a Maximal Planar Subgraph using PQ-Trees", 1998
WP(s): 1.2, responsible site: MPI
Download report

[TR-460-99]
M. Jünger S. Leipert and P. Mutzel: " A Note on Computing a Maximal Planar Subgraph using PQ-Trees", 1999
WP(s): 3.2, responsible site: Cologne
Download report

[TR-461-99]
M. Jünger S. Leipert and P. Mutzel: " Level Planarity Testing in Linear Time", 1999
WP(s): 3.2, responsible site: Cologne
Download report

[TR-105-96]
M. Jünger and P. Mutzel: " Exact and Heuristic Algorithms for 2-Layer Straightline Crossing Minimization", 1996
WP(s): 1.2, responsible site: Cologne
Download report

[TR-245-97]
M. Jünger G. Reinelt and G. Rinaldi: " The Traveling Salesman Problem", 1997
WP(s): 1.3, responsible site: Cologne
Download report

[TR-310-98]
M. Jünger and G. Rinaldi: " Relaxations of the Max Cut Problem and Computation of Spin Glass Ground States", 1998
WP(s): 3.2, responsible site: Cologne
Download report

[TR-168-97]
M. Jünger G. Rinaldi and S. Thienel: " Practical Performance of Efficient Minimum Cut Algorithms", 1997
WP(s): 3.2, responsible site: Cologne
Download report

[TR-311-98]
M. Jünger G. Rinaldi and S. Thienel: " Practical Performance of Efficient Minimum Cut Algorithms (revised)", 1998
WP(s): 3.2, responsible site: Cologne
Download report

[TR-001-96]
M. Jünger and S. Thienel: " Basic Design Ideas for the Branch-and-Cut System ABACUS", 1996
WP(s): 1.3, responsible site: Cologne
Download report

[TR-037-96]
M. Jünger and S. Thienel: " Implementation of ABACUS: A Branch-and-Bound algorithm for MIPs", 1996
WP(s): 1.3, responsible site: Cologne
Download report

[TR-143-97]
M. Jünger and S. Thienel: " Introduction to ABACUS - A Branch-And-CUt System", 1997
WP(s): 1.3, responsible site: Cologne
Download report

[TR-144-97]
M. Jünger and S. Thienel: " The Design of the Branch-and-Cut System ABACUS", 1997
WP(s): 1.3, responsible site: Cologne
Download report

[TR-357-98]
M. Jünger and S. Thienel: " The ABACUS System for Branch and Cut and Price Algorithms in Integer Programming and Combinatorial Optimization", 1998
WP(s): 1.3, responsible site: Cologne
Download report

[TR-273-97]
B.H.H. Juurlink: " Experimental Validation of Parallel Computation Models on the Intel Paragon", 1997
WP(s): 3.1, responsible site: Paderborn
Download report

[TR-429-98]
B.H.H. Juurlink: " Experimental Validation of Parallel Computation Models on the Intel Paragon", 1998
WP(s): 3.1, responsible site: Paderborn
Download report

[TR-463-99]
V. Kaibel and M. Wolff: " Simple 0/1-Polytope", 1999
WP(s): 3.2, responsible site: Cologne
Download report

[TR-016-96]
C.W. Kessler and J.L. Träff: " A Library of basic PRAM Algorithms and its Implementation in FORK", 1996
WP(s): 2.3, responsible site: MPI
Download report

[TR-018-96]
C.W. Kessler and J.L. Träff: " Language and Support for Practical PRAM Programming", 1996
WP(s): 2.3, responsible site: MPI
Download report

[TR-312-98]
S. Khanna S. Muthukrishnan and M. Paterson: " On Approximating Rectangle Tiling and Packing", 1998
WP(s): 3.2, responsible site: Warwick
Download report

[TR-108-96]
L.M. Kirousis and Y.C. Stamatiou: " An inequality for reducible increasing properties of randomly generated words", 1996
WP(s): 3.3, responsible site: CTI
Download report

[TR-341-98]
R. Klasing: " Improved Compressions of Cube-Connected Cycles Networks", 1998
WP(s): 3.1, responsible site: Warwick
Download report

[TR-401-98]
R. Klasing: " Methods and Problems of Wavelength-Routing in All-Optical Networks", 1998
WP(s): 3.1, responsible site: Warwick
Download report

[TR-511-99]
G. Kliewer K. Klohs and S. Tschöke: " parSA Library User Manual", 1999
WP(s): 2.1, responsible site: Paderborn
Download report

[TR-073-96]
S.C. Kontogiannis G.E. Pantziou and P. Spirakis: " Efficient Computations on fault-prone BSP machines", 1996
WP(s): 3.1, responsible site: CTI
Download report

[TR-156-97]
S.C. Kontogiannis G.E. Pantziou and P. Spirakis: " Efficient Computations on Fault-Prone BSP Machines", 1997
WP(s): 3.1, responsible site: CTI
Download report

[TR-249-97]
S.C. Kontogiannis G.E. Pantziou and P. Spirakis: " A frame for the Simulation of Shared Memory on Distributed Memory", 1997
WP(s): 2.1, responsible site: CTI
Download report

[TR-487-99]
C. Krick F. Meyer auf der Heide H. Räcke B. Vöcking and M. Westermann: " Data Management in Networks: Experimental Evaluation of a Provably Good Strategy", 1999
WP(s): 4.1, responsible site: Paderborn
Download report

[TR-070-96]
M. Kutylowski and K. Lorys: " Limitations of the QRQW and EREW PRAM Models", 1996
WP(s): 3.1, responsible site: Paderborn
Download report

[TR-069-96]
M. Kutylowski K. Lorys and B. Oesterdiekhoff: " Periodic Merging Networks", 1996
WP(s): 3.1, responsible site: Paderborn
Download report

[TR-276-97]
M. Kutylowski and R. Wanka: " Playing Tetris on Meshes and Multi-Dimensional Shearsort", 1997
WP(s): 3.1, responsible site: Paderborn
Download report

[TR-210-97]
K.S. Larsen: " Partially Persistent Binary Search Trees with Transcript Operations", 1997
WP(s): 3.2, responsible site: Aarhus
Download report

[TR-212-97]
K.S. Larsen: " Amortized Constant Relaxed Rebalancing using Standard Rotations", 1997
WP(s): 3.3, responsible site: Aarhus
Download report

[TR-226-97]
K.S. Larsen: " Regular Expressions with Nested Levels of Back Referencing form a Hierarchy", 1997
WP(s): 3.2, responsible site: Aarhus
Download report

[TR-213-97]
K.S. Larsen T. Ottmann and E. Soisalon-Soininen: " Relaxed Balance for Search Trees with Local Rebalancing", 1997
WP(s): 3.2, responsible site: Aarhus
Download report

[TR-214-97]
K.S. Larsen E. Soisalon-Soininen and P. Widmayer: " Relaxed Balance through Standard Rotations", 1997
WP(s): 3.3, responsible site: Aarhus
Download report

[TR-104-96]
S. Leipert: " The Tree Interface - Version 1.0 User Manual", 1996
WP(s): 1.3, responsible site: Cologne
Download report

[TR-172-97]
W. Lenhart and G. Liotta: " Drawable and Forbidden Minimum Weight Triangulations", 1997
WP(s): 1.2, responsible site: Rome
Download report

[TR-513-99]
S. Leonardi: " On-line Network Routing", 1999
WP(s): 3.1, responsible site: Rome
Download report

[TR-205-97]
S. Leonardi A. Marchetti-Spaccamela A. Presciutti and A. Ros\`en: " On-line Randomized Call-Control Revisited", 1997
WP(s): 3.2, responsible site: Rome
Download report

[TR-259-97]
S. Leonardi A. Marchetti-Spaccamela and A. Presciutti: " Randomized on-line call control revisited", 1997
WP(s): 3.2, responsible site: MPI
Download report

[TR-136-97]
S. Leonardi and D. Raz: " Approximating Total Flow Time on Parallel Machines", 1997
WP(s): 3.2, responsible site: Rome
Download report

[TR-514-99]
S. Leonardi and A. Vitaletti: " Randomized Lower Bounds for Online Path Coloring", 1999
WP(s): 3.2, responsible site: Rome
Download report

[TR-155-97]
G. Liotta A. Lubiw H. Meijer and S.H. Whitesides: " The Rectangle of Influence Drawability Problem", 1997
WP(s): 3.2, responsible site: Rome
Download report

[TR-153-97]
G. Liotta F.P. Preparata and R. Tamassia: " Robust Proximity Queries: an Illustration of Degree-driven Algorithm Design", 1997
WP(s): 3.2, responsible site: Rome
Download report

[TR-123-96]
G. Liotta R. Tamassia I.G. Tollis and P. Vocca: " Area Requirement of Gabriel Drawings", 1996
WP(s): 3.2, responsible site: Rome
Download report

[TR-369-98]
A. Lozano and V. Raghavan: " On the complexity of moving vertices in a graph", 1998
WP(s): 3.2, responsible site: Barcelona
Download report

[TR-192-97]
T. Lukovszki and W.B. Strothmann: " Decremental Biconnectivity on Planar Graphs", 1997
WP(s): 3.2, responsible site: Paderborn
Download report

[TR-444-99]
R. Lyngs\o C.N.S. Pedersen and H. Nielsen: " Metrics and similarity measures for hidden Markov models", 1999
WP(s): 3.3, responsible site: Aarhus
Download report

[TR-442-99]
R. Lyngs\o M. Zuker and C.N.S. Pedersen: " Fast evaluation of internal loops in RNA secondary structure prediction", 1999
WP(s): 3.2, responsible site: Aarhus
Download report

[TR-443-99]
R. Lyngs\o M. Zuker and C.N.S. Pedersen: " Internal loops in RNA secondary structure prediction", 1999
WP(s): 3.2, responsible site: Aarhus
Download report

[TR-274-97]
B. Maggs F. Meyer auf der Heide B. Voecking and M. Westermann: " Exploiting Locality for Data Management in Systems of Limited Bandwidth", 1997
WP(s): 3.1, responsible site: Paderborn
Download report

[TR-363-98]
H.M. Mahmoud P. Flajolet P. Jacquet and M. Regnier: " Analytic Variations on bucket Selection and Sorting", 1998
WP(s): 3.3, responsible site: INRIA
Download report

[TR-030-96]
H.M. Mahmoud R.T. Smythe and M. Regnier: " Analysis of Boyer-Moore-Horspool String-Matching Heuristic", 1996
WP(s): 3.3, responsible site: INRIA
Download report

[TR-141-97]
V. Makarenkov: " Deux algorithmes d'approximation d'une dissimilarite' par une distance d'arbre au sens du critere des moindres carres ponderes", 1997
WP(s): 3.2, responsible site: EHESS
Download report

[TR-140-97]
V. Makarenkov and B. Leclerc: " Tree metrics and their circular orders: some uses for the reconstruction and fitting of phylogenetic trees", 1997
WP(s): 3.2, responsible site: EHESS
Download report

[TR-502-99]
V. Makarenkov and B. Leclerc: " An algorithm for the fitting of a tree metric according to a weighted least squares criterion", 1999
WP(s): 3.2, responsible site: EHESS
Download report

[TR-503-99]
V. Makarenkov and B. Leclerc: " Optimal algorithms for computing the Robinson and Foulds topologic distance between two trees and the strict consensus true for k-trees given their distance matrices", 1999
WP(s): 3.2, responsible site: EHESS
Download report

[TR-072-96]
B. Mamalis P. Spirakis and B. Tampakas: " Optimal High Performance Parallel Text Retrieval via Fat Trees", 1996
WP(s): 3.1, responsible site: CTI
Download report

[TR-411-98]
C. Martinez A. Panholzer and H. Prodinger: " Partial match queries in relaxed multidimensional search trees", 1998
WP(s): 3.2, responsible site: Barcelona
Download report

[TR-180-97]
C. Martinez and H. Prodinger: " On the Number of Descendants and Ascendants in Random Search Trees", 1997
WP(s): 3.3, responsible site: Barcelona
Download report

[TR-182-97]
C. Martinez and S. Roura: " Randomized Binary Search Trees", 1997
WP(s): 3.3, responsible site: Barcelona
Download report

[TR-365-98]
C. Martinez and S. Roura: " Optimal Sampling Strategies in Quicksort and Quickselect", 1998
WP(s): 3.3, responsible site: Barcelona
Download report

[TR-339-98]
Y. Matias S. Muthukrishnan S.C. Sahinalp and J. Ziv: " Augmenting Suffix Trees with Applications", 1998
WP(s): 3.2, responsible site: Warwick
Download report

[TR-058-96]
K. Menzel T. Römke and U.P. Schroeder: " Efficient Use of Parallel and Distributed Systems: From Theory to Practice", 1996
WP(s): 3.1, responsible site: Paderborn
Download report

[TR-320-98]
X. Messeguer and B. Valles: " HyperChromatic trees: a fine-grained approach to distributed algorithms on RedBlack trees", 1998
WP(s): 3.1, responsible site: Barcelona
Download report

[TR-448-99]
X. Messeguer and B. Valles: " Synchronized Parallel Algorithms on Red-Black trees", 1999
WP(s): 3.1, responsible site: Barcelona
Download report

[TR-345-98]
F. Meyer auf der Heide and G.T. Martinez: " Communication-Efficient Parallel Multiway- and Approximate Minimum Cut Computation", 1998
WP(s): 3.1, responsible site: Paderborn
Download report

[TR-079-96]
F. Meyer auf der Heide and C. Scheideler: " Communication in Parallel Systems", 1996
WP(s): 3.1, responsible site: Paderborn
Download report

[TR-080-96]
F. Meyer auf der Heide and C. Scheideler: " Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols", 1996
WP(s): 3.1, responsible site: Paderborn
Download report

[TR-083-96]
F. Meyer auf der Heide and B. Vöcking: " Universal Store-And-Forward Routing", 1996
WP(s): 3.1, responsible site: Paderborn
Download report

[TR-478-99]
F. Meyer auf der Heide and B. Vöcking: " Shortest-Path Routing in Arbitrary Networks", 1999
WP(s): 3.1, responsible site: Paderborn
Download report

[TR-486-99]
F. Meyer auf der Heide B. Vöcking and M. Westermann: " Provably Good and Practical Strategies for Non-Uniform Data Management in Networks", 1999
WP(s): 4.1, responsible site: Paderborn
Download report

[TR-277-97]
F. Meyer auf der Heide and B. Voecking: " Static and Dynamic Data Management in Networks", 1997
WP(s): 3.1, responsible site: Paderborn
Download report

[TR-206-97]
P.B. Miltersen: " Error Correcting Codes Perfect Hashing Circuits and Deterministic Dynamic Dictionaries", 1997
WP(s): 3.2, responsible site: Aarhus
Download report

[TR-241-97]
D.A. Mix Barrington Chi-Jen Lu P.B. Miltersen and S. Skyum: " Searching Constant Width Mazes Captures the AC0 Hierarchy", 1997
WP(s): 3.1, responsible site: Aarhus
Download report

[TR-434-99]
D.A. Mix Barrington Chi-Jen Lu P.B. Miltersen and S. Skyum: " On monotone planar circuits", 1999
WP(s): 3.1, responsible site: Aarhus
Download report

[TR-501-99]
B. Mohar and P. Rosenstiehl: " Tessellation and Visibility Representations of Maps on the Torus", 1999
WP(s): 1.2, responsible site: EHESS
Download report

[TR-191-97]
X. Molinero: " Unranking of Combinatorial Structures", 1997
WP(s): 4.5, responsible site: Barcelona
Download report

[TR-231-97]
S. Moral: " Topology Editor Manual", 1997
WP(s): 2.2, responsible site: Barcelona
Download report

[TR-220-97]
S. Moral and J.L. Balc\'azar: " Empirical results on long-lived renaming algorithms", 1997
WP(s): 3.1, responsible site: Barcelona
Download report

[TR-324-98]
T. Mulders and A. Storjohann: " The Modulo N Extended GCD Problem for Polynomials", 1998
WP(s): 4.5, responsible site: ETH
Download report

[TR-046-96]
S. Muthukrishnan and M. Muller: " Time and space efficient method-lookup for object-oriented programs", 1996
WP(s): 3.2, responsible site: Warwick
Download report

[TR-399-98]
S. Muthukrishnan M. Paterson S.C. Sahinalp and T. Suel: " Compact Grid Layouts of Some Multi-Level Networks", 1998
WP(s): 3.1, responsible site: Warwick
Download report

[TR-150-97]
P. Mutzel: " An Alternative Method to Crossing Minimization on Hierarchical Graphs", 1997
WP(s): 3.2, responsible site: MPI
Download report

[TR-407-98]
P. Mutzel and R. Weiskircher: " Optimizing Over All Combinatorial Embeddings of a Planar Graphs", 1998
WP(s): 1.2, responsible site: MPI
Download report

[TR-477-99]
P. Nicod\'eme B. Salvy and P. Flajolet: " Motif Statistics", 1999
WP(s): 4.5, responsible site: INRIA
Download report

[TR-026-96]
S. Nikoletseas G.E. Pantziou P. Psycharis and P. Spirakis: " On the Reliability of Fat-Trees", 1996
WP(s): 3.1, responsible site: CTI
Download report

[TR-271-97]
B. Oesterdiekhoff: " Periodic Comparator Networks", 1997
WP(s): 3.1, responsible site: Paderborn
Download report

[TR-506-99]
P. Ossona de Mendez: " A note on 3-colorability and contacts of segments", 1999
WP(s): 3.2, responsible site: EHESS
Download report

[TR-509-99]
P. Ossona de Mendez: " The reduced genus of a multigraph", 1999
WP(s): 3.2, responsible site: EHESS
Download report

[TR-437-99]
R. Pagh: " Low Redundancy in Dictionaries with O(1) Worst Case Lookup Time", 1999
WP(s): 3.2, responsible site: Aarhus
Download report

[TR-440-99]
R. Pagh: " Hash and Displace: Efficient Evaluation of Minimal Perfect Hash Functions", 1999
WP(s): 3.2, responsible site: Aarhus
Download report

[TR-383-98]
J. Pagter and T. Rauhe: " Optimal Time-Space Trade-Offs for Sorting", 1998
WP(s): 3.2, responsible site: Aarhus
Download report

[TR-173-97]
G.E. Pantziou G.P. Pentaris and P. Spirakis: " Competitive Call Control in Mobile Networks", 1997
WP(s): 3.2, responsible site: CTI
Download report

[TR-010-96]
G.E. Pantziou A. Roberts and A. Simvonis: " Dynamic Tree Routing under the ``Matching with Consumption'' Model", 1996
WP(s): 3.1, responsible site: CTI
Download report

[TR-047-96]
M. Paterson: " Progress in selection", 1996
WP(s): 3.1, responsible site: Warwick
Download report

[TR-048-96]
M. Paterson and T. Przytycka: " On the complexity of string folding", 1996
WP(s): 3.2, responsible site: Warwick
Download report

[TR-403-98]
M. Paterson H. Schroeder O. Sykora and I. Vrto: " On Permutation Communications in All-Optical Rings", 1998
WP(s): 3.1, responsible site: Warwick
Download report

[TR-295-97]
M. Patrignani and F. Vargiu: " 3DCube: a Tool for Three Dimensional Graph Drawing", 1997
WP(s): 1.2, responsible site: Rome
Download report

[TR-337-98]
C.N.S. Pedersen R. Lyngs\o and J. Hein: " Comparison of Coding DNA", 1998
WP(s): 3.2, responsible site: Aarhus
Download report

[TR-239-97]
A. Pekec: " Hypergraph Optimization Problems: Why is the Objective Function Linear?", 1997
WP(s): 3.2, responsible site: Aarhus
Download report

[TR-240-97]
A. Pekec: " Scalings in Linear Programming: Necessary and Sufficient Conditions for Invariance", 1997
WP(s): 3.2, responsible site: Aarhus
Download report

[TR-221-97]
J. Petit i Silvestre: " Approximation Heuristics and Benchmarkings for the MinLA Problem", 1997
WP(s): 3.3, responsible site: Barcelona
Download report

[TR-229-97]
J. Petit i Silvestre: " PgaFrame - A frame for parallel genetic algorithms", 1997
WP(s): 2.1, responsible site: Barcelona
Download report

[TR-230-97]
J. Petit i Silvestre: " PgaFrame - User Report", 1997
WP(s): 2.1, responsible site: Barcelona
Download report

[TR-285-97]
J. Petit i Silvestre: " Combining Spectral Sequencing with Simulated Annealing for the MinLA Problem: Sequential and Parallel Case", 1997
WP(s): 3.3, responsible site: Barcelona
Download report

[TR-427-98]
R. Preis: " Linear Time 1/2-Approximation Algorithm for Maximum Weighted Matching in General Graphs", 1998
WP(s): 3.2, responsible site: Paderborn
Download report

[TR-085-96]
R. Preis and R. Diekmann: " The PARTY Partitioning-Library User Guide - Version 1.1", 1996
WP(s): 3.1, responsible site: Paderborn
Download report

[TR-494-99]
Y. Rabani A. Sinclair and R. Wanka: " Local Divergence of Markov Chains and the Analysis of Iterative Load-Balancing Schemes", 1999
WP(s): 4.1, responsible site: Paderborn
Download report

[TR-290-97]
M. Regnier: " Generating Functions in Computational Biology: A Survey", 1997
WP(s): 3.2, responsible site: INRIA
Download report

[TR-474-99]
M. Regnier: " A Unified Approach to Word Statistics", 1999
WP(s): 3.3, responsible site: INRIA
Download report

[TR-029-96]
M. Regnier and L. Rostami: " A Simple (but Optimal) 2D-Witness Algorithm", 1996
WP(s): 3.2, responsible site: INRIA
Download report

[TR-177-97]
M. Regnier and W. Szpankowski: " On the Approximate Pattern Occurrences in a Text", 1997
WP(s): 3.3, responsible site: INRIA
Download report

[TR-178-97]
M. Regnier and W. Szpankowski: " On Pattern Frequency Occurrences in a Markovian Sequence", 1997
WP(s): 3.3, responsible site: INRIA
Download report

[TR-086-96]
R. Rehrmann B. Monien R. Lüling and R. Diekmann: " On the Communication Throughput of Buffered Multistage Interconnection Networks", 1996
WP(s): 3.1, responsible site: Paderborn
Download report

[TR-194-97]
T. Reski and W.B. Strothmann: " Compacting graphs according to adjacencies in linear time and space", 1997
WP(s): 3.2, responsible site: Paderborn
Download report

[TR-348-98]
M. Riedel: " Online Request Server Matching", 1998
WP(s): 3.2, responsible site: Paderborn
Download report

[TR-183-97]
T. Römke and J. Petit i Silvestre: " Programming Frames for the Efficient Use of Parallel Systems", 1997
WP(s): 2.1, responsible site: Barcelona
Download report

[TR-505-99]
P. Rosenstiehl: " A new proof of the Gauss interlace conjecture", 1999
WP(s): 1.2, responsible site: EHESS
Download report

[TR-350-98]
M. Röttger and U.P. Schröder: " Embedding 2-Dimensional Grids into Optimal Hypercubes with Edge-Congestion 1 or 2", 1998
WP(s): 3.1, responsible site: Paderborn
Download report

[TR-352-98]
M. Röttger and U.P. Schröder: " Efficient Embeddings of Grids into Grids", 1998
WP(s): 3.1, responsible site: Paderborn
Download report

[TR-181-97]
S. Roura: " An Improved Master Theorem for Divide-and-Conquer Recurrences", 1997
WP(s): 3.3, responsible site: Barcelona
Download report

[TR-456-99]
S. Roura: " Improving Mergesort for Linked Lists", 1999
WP(s): 3.2, responsible site: Barcelona
Download report

[TR-364-98]
S. Roura and C. Martinez: " On the Competitiveness of the Move-to-Front Rule", 1998
WP(s): 3.3, responsible site: Barcelona
Download report

[TR-127-96]
B. Salvy: " Algorithms Seminar", 1996
WP(s): 3.3, responsible site: INRIA
Download report

[TR-254-97]
B. Salvy: " Algorithms seminar 1996-1997", 1997
WP(s): 4.5, responsible site: INRIA
Download report

[TR-395-98]
B. Salvy: " Algorithms seminar", 1998
WP(s): 3.3, responsible site: INRIA
Download report

[TR-252-97]
B. Salvy and J. Shackell: " Symbolic Asymptotics: Multiseries of Inverse Functions", 1997
WP(s): 4.5, responsible site: INRIA
Download report

[TR-081-96]
C. Scheideler and B. Vöcking: " Universal Continuous Routing Strategies", 1996
WP(s): 3.1, responsible site: Paderborn
Download report

[TR-490-99]
C. Scheideler and B. Vöcking: " From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols", 1999
WP(s): 3.1, responsible site: Paderborn
Download report

[TR-189-97]
M. Serna L. Trevisan and F. Xhafa: " The (Parallel) Approximability of Non-Boolean Satisfiability Problems and Restricted Integer Programming", 1997
WP(s): 3.1, responsible site: Barcelona
Download report

[TR-186-97]
M. Serna and F. Xhafa: " Approximating Scheduling Problems in Parallel", 1997
WP(s): 3.1, responsible site: Barcelona
Download report

[TR-366-98]
M. Serna and F. Xhafa: " The Parallel Approximability of the FALSE and TRUE GATES Problems for Nor Circuits", 1998
WP(s): 3.2, responsible site: Barcelona
Download report

[TR-470-99]
J. Sharp: " Tiling Multi-Dimensonal Arrays", 1999
WP(s): 3.2, responsible site: Warwick
Download report

[TR-333-98]
D.B. Shmoys E. Tardos and K. Aardal: " Approximation Algorithms for Facility Location Problems", 1998
WP(s): 4.3, responsible site: Utrecht
Download report

[TR-266-97]
J. Simon and O. Heinz: " SCI Multiprocessor PC Cluster in a WindowsNT Environment", 1997
WP(s): 3.1, responsible site: Paderborn
Download report

[TR-378-98]
P. Spirakis G.P. Pentaris and K. Hatzis: " Testing report of the DSS tool", 1998
WP(s): 4.2, responsible site: CTI
Download report

[TR-379-98]
P. Spirakis G.P. Pentaris and K. Hatzis: " Test report of the DSS tool", 1998
WP(s): 4.2, responsible site: CTI
Download report

[TR-019-96]
P. Spirakis B. Tampakas K. Antonis K. Hatzis and G.P. Pentaris: " The Specifications of the DSP Tool", 1996
WP(s): 2.2, responsible site: CTI
Download report

[TR-020-96]
P. Spirakis B. Tampakas K. Antonis K. Hatzis and G.P. Pentaris: " Requirements for the simulation of distributed protocols", 1996
WP(s): 2.2, responsible site: CTI
Download report

[TR-021-96]
P. Spirakis B. Tampakas K. Antonis and K. Hatzis: " Specifications of the DSS Simulator", 1996
WP(s): 4.2, responsible site: CTI
Download report

[TR-022-96]
P. Spirakis B. Tampakas K. Hatzis and G.P. Pentaris: " An Overview of Existing Network Simulators", 1996
WP(s): 4.2, responsible site: CTI
Download report

[TR-024-96]
P. Spirakis B. Tampakas K. Antonis K. Hatzis and G.P. Pentaris: " Specification Languages of Distributed and Communication Systems: State of the Art", 1996
WP(s): 2.2, responsible site: CTI
Download report

[TR-025-96]
P. Spirakis B. Tampakas K. Antonis K. Hatzis and G.P. Pentaris: " The Specifications of the DSPL", 1996
WP(s): 2.2, responsible site: CTI
Download report

[TR-113-96]
P. Spirakis B. Tampakas G.P. Pentaris and K. Hatzis: " The description of a distributed system under the DSP tool: The BNF notation", 1996
WP(s): 2.2, responsible site: CTI
Download report

[TR-114-96]
P. Spirakis B. Tampakas G.P. Pentaris and K. Hatzis: " The design of the DSP tool", 1996
WP(s): 2.2, responsible site: CTI
Download report

[TR-115-96]
P. Spirakis B. Tampakas G.P. Pentaris and K. Hatzis: " The design of the DSS tool", 1996
WP(s): 4.2, responsible site: CTI
Download report

[TR-109-96]
P. Spirakis and T. Vassilis: " Pure greedy hot-potato routing in the 2-d mesh with random destinations", 1996
WP(s): 3.1, responsible site: CTI
Download report

[TR-457-99]
A. Stewart M. Clint and J. Gabarr\'o: " Axiomatic frameworks for developing BSP-style programs", 1999
WP(s): 3.1, responsible site: Barcelona
Download report

[TR-121-96]
A. Storjohann: " A Fast $+$ Practical $+$ Deterministic Algorithm for Triangularizing Integer Matrices", 1996
WP(s): 4.5, responsible site: ETH
Download report

[TR-122-96]
A. Storjohann: " Computing Hermite and Smith Normal Forms of Triangular Integer Matrices", 1996
WP(s): 4.5, responsible site: ETH
Download report

[TR-326-98]
A. Storjohann: " An $O(n^3)$ Algorithm for Frobenius Normal Form", 1998
WP(s): 4.5, responsible site: ETH
Download report

[TR-323-98]
A. Storjohann and T. Mulders: " Fast Algorithms for Linear Algebra Modulo N", 1998
WP(s): 4.5, responsible site: ETH
Download report

[TR-061-96]
S. Thienel: " A Simple TSP Solver: An ABACUS Tutorial", 1996
WP(s): 1.3, responsible site: Cologne
Download report

[TR-099-96]
S. Thienel: " ABACUS 1.2 User's Guide and Reference Manual", 1996
WP(s): 1.3, responsible site: Cologne
Download report

[TR-329-98]
D.M. Thilikos: " Algorithms and Obstructions for Linear Width and Related Parameters", 1998
WP(s): 3.2, responsible site: Utrecht
Download report

[TR-017-96]
J.L. Träff: " PAD: A Library of basic PRAM Algorithms: Preliminary Overview", 1996
WP(s): 2.3, responsible site: MPI
Download report

[TR-094-96]
J.L. Träff: " PAD: A Library of basic PRAM Algorithms", 1996
WP(s): 2.3, responsible site: MPI
Download report

[TR-149-97]
J.L. Träff and C.D. Zaroliagis: " A Simple Parallel Algorithm for the Single-Source Shortest Path Problem on Planar Digraphs", 1997
WP(s): 3.1, responsible site: MPI
Download report

[TR-446-99]
L. Trevisan and F. Xhafa: " The Parallel Complexity of Positive Linear Programming", 1999
WP(s): 3.1, responsible site: Barcelona
Download report

[TR-090-96]
T. Tsujiki and F. Xhafa: " On the Depth of Randomly Generated Circuits", 1996
WP(s): 3.3, responsible site: Barcelona
Download report

[TR-279-97]
J. Verriet: " The complexity of scheduling graphs of bounded width subject to non-zero communication delay", 1997
WP(s): 4.3, responsible site: Utrecht
Download report

[TR-296-97]
J. Verriet: " Scheduling tree-structured programs in the LogP model", 1997
WP(s): 3.1, responsible site: Utrecht
Download report

[TR-130-96]
B. Verweij: " Multiple Destination Bin Packing", 1996
WP(s): 3.2, responsible site: Utrecht
Download report

[TR-332-98]
B. Verweij K. Aardal and G. Kant: " On an Integer Multicommodity flow Problem from the Airplane Industry", 1998
WP(s): 4.3, responsible site: Utrecht
Download report

[TR-071-96]
A. Wachsmann and R. Wanka: " Sorting on a Massively Parallel System Using a Library of Basic Primitives: Modelling and Experimental Results", 1996
WP(s): 2.1, responsible site: Paderborn
Download report

[TR-218-97]
F. Xhafa: " A Short Note on Non-Symetric Semidefinite Programming", 1997
WP(s): 3.2, responsible site: Barcelona
Download report

[TR-093-96]
F. Xhafa and G. Navarro: " A Maple Package for Semidefinite Programming", 1996
WP(s): 3.2, responsible site: Barcelona
Download report

[TR-077-96]
C.Z. Xu B. Monien R. Lüling and F.C.M. Lau: " An Analytical Comparison of Nearest Neighbor Algorithms for Load Balancing in Parallel Computers", 1996
WP(s): 3.1, responsible site: Paderborn
Download report

[TR-281-97]
K. Yamazaki H.L. Bodlaender B. de Fluiter and D.M. Thilikos: " Isomorphism for Graphs of Bounded Distance Width", 1997
WP(s): 3.2, responsible site: Utrecht
Download report

[TR-228-97]
F. d'Amore L. Becchetti S.L. Bezrukov A. Marchetti-Spaccamela M. Ottaviani R. Preis M. Röttger and U.P. Schroeder: " On the Embedding of Refinements of 2-dimensional Grids", 1997
WP(s): 3.1, responsible site: Rome
Download report

[TR-232-97]
F. d'Amore P.G. Franciosa R. Giaccio and M. Talamo: " Maintaining maxima under boundary updates (Extended abstract)", 1997
WP(s): 3.2, responsible site: Rome
Download report

[TR-233-97]
F. d'Amore and R. Giaccio: " Maintaining a hive-graph between two sweep lines", 1997
WP(s): 3.2, responsible site: Rome
Download report

[TR-227-97]
F. d'Amore and F. Iacobini: " On-line algorithms for networks of temporal constraints", 1997
WP(s): 3.2, responsible site: Rome
Download report

[TR-278-97]
B. de Fluiter and H.L. Bodlaender: " Parallel Algorithms for Treewidth Two", 1997
WP(s): 3.1, responsible site: Utrecht
Download report

[TR-280-97]
B. de Fluiter and H.L. Bodlaender: " Intervalizing Sandwich Graphs", 1997
WP(s): 3.2, responsible site: Utrecht
Download report

[TR-398-98]
H. de Fraysseix and P. Ossona de Mendez: " On topological aspects of orientations", 1998
WP(s): 1.2, responsible site: EHESS
Download report

[TR-507-99]
H. de Fraysseix and P. Ossona de Mendez: " Stretchability of Jordan arc contact systems", 1999
WP(s): 1.2, responsible site: EHESS
Download report

[TR-508-99]
H. de Fraysseix and P. Ossona de Mendez: " Connectivity of planar graphs", 1999
WP(s): 3.2, responsible site: EHESS
Download report

[TR-119-96]
C. de Jong G. Kant and A. Van Vliet: " Efficient Implementation of the Savings Method for the Vehicle Routing Problem with Time Windows", 1996
WP(s): 4.3, responsible site: Utrecht
Download report

[TR-120-96]
C. de Jong G. Kant and A. Van Vliet: " On Finding Minimal Route Duration in the Vehicle Routing Problem with Multiple Time Windows", 1996
WP(s): 4.3, responsible site: Utrecht
Download report

ALCOM-IT Home page Reports Archive Project partners Events