Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).

We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.

792 Publications


2002 | Journal Article | LibreCat-ID: 18853
C. Sohler and A. Czumaj, “Abstract Combinatorial Programs and Efficient Property Testers,” Proceedings of the 43th Symposium on Foundations of Computer Science (FOCS), pp. 83–92, 2002.
LibreCat
 

2002 | Report | LibreCat-ID: 18961
T. Lukovszki and A. Benczúr, A Degree O(log log n) Fault Tolerant Distributed Location Service for Geographic Ad-Hoc Routing. Paderborn, 2002.
LibreCat
 

2002 | Dissertation | LibreCat-ID: 18169
M. Ziegler, Zur Berechenbarkeit reeller geometrischer Probleme, vol. 115. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2002.
LibreCat | Files available
 

2002 | Journal Article | LibreCat-ID: 18176
M. Ziegler, “Computability on Regular Subsets of Euclidean Space,” Mathematical Logic Quarterly (MLQ), vol. 48, no. S1, pp. 157–181, 2002.
LibreCat | DOI
 

2002 | Conference Paper | LibreCat-ID: 18177
M. Ziegler, V. Damerow, and L. Finschi, “Point Location Algorithms of Minimum Size,” in Proceedings of the 14th Canadian Conference on Computational Geometry (CCCG’02), 2002.
LibreCat
 

2002 | Conference Paper | LibreCat-ID: 18179
V. Brattka and M. Ziegler, “Computability of Linear Equations,” in Proceedings of the 2nd IFIP International Conference on Theoretical Computer Science, 2002, pp. 95–106.
LibreCat | DOI
 

2002 | Conference Paper | LibreCat-ID: 18369
B. Mueck, W. Dangelmaier, M. Fischer, and W. Klemisch, “Bi-directional Coupling of Simulation Tools with a Walkthrough-System,” in Simulation und Visualisierung, 2002, pp. 71–84.
LibreCat
 

2002 | Conference Paper | LibreCat-ID: 18566
M. Adler, H. Räcke, N. Sivadasan, C. Sohler, and B. Vöcking, “Randomized Pursuit-Evasion in Graphs,” in Proceedings of the 29th International Colloquium on Automata, Languages and Programming, 2002.
LibreCat | DOI
 

2002 | Journal Article | LibreCat-ID: 16489
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,” Theory of Computing Systems, pp. 217–245, 2002, doi: 10.1007/s00224-001-1045-z.
LibreCat | DOI
 

2002 | Conference Paper | LibreCat-ID: 16490
J. Klein, J. Krokowski, M. Fischer, M. Wand, R. Wanka, and F. Meyer auf der Heide, “The randomized sample tree: a data structure for interactive walkthroughs in externally stored virtual environments,” in Proceedings of the ACM symposium on Virtual reality software and technology  - VRST ’02, 2002.
LibreCat | DOI
 

2002 | Conference Paper | LibreCat-ID: 16491
F. Meyer auf der Heide, C. Schindelhauer, K. Volbert, and M. Grünewald, “Energy, congestion and dilation in radio networks,” in Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures  - SPAA ’02, 2002.
LibreCat | DOI
 

2002 | Book Chapter | LibreCat-ID: 16723
F. Meyer auf der Heide, M. Kumar, S. Nikoletseas, and P. Spirakis, “Mobile Computing, Mobile Networks,” in Euro-Par 2002 Parallel Processing, Lecture Notes in Computer Science, vol 2400., Berlin, Heidelberg, 2002.
LibreCat | DOI
 

2001 | Dissertation | LibreCat-ID: 19622
K. Schröder, Balls into Bins: A Paradigm for Job Allocation, Data Distribution Processes, and Routing, vol. 89. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2001.
LibreCat | Files available
 

2001 | Conference Paper | LibreCat-ID: 19797
K. Salzwedel, G. Hartmann, C. Wolff, and R. Preis, “Efficient Parallel Simulations of Pulse-Coded Neural Networks (PCNN),” in Proceedings of the PDPTA 2001, 2001, vol. 1, pp. 463–470.
LibreCat
 

2001 | Journal Article | LibreCat-ID: 2139
F. Meyer auf der Heide and C. Scheideler, “Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols,” Combinatorica, vol. 21, no. 1, pp. 95--138, 2001.
LibreCat | DOI
 

2001 | Conference Paper | LibreCat-ID: 2141 | OA
P. Berenbrink, A. Brinkmann, and C. Scheideler, “SIMLAB-A Simulation Environment for Storage Area Networks,” in PDP, 2001, pp. 227--234.
LibreCat | Files available
 

2001 | Journal Article | LibreCat-ID: 18749
A. Czumaj and C. Sohler, “Testing Hypergraph Coloring,” Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP), pp. 493–505, 2001.
LibreCat | DOI
 

2001 | Conference Paper | LibreCat-ID: 18750
C. Sohler and A. Czumaj, “Soft Kinetic Data Structures,” in Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms, 2001, pp. 865–872.
LibreCat
 

2001 | Journal Article | LibreCat-ID: 18857
C. Sohler and A. Czumaj, “Property Testing with Geometric Queries,” Proceedings of the 9th Annual European Symposium on Algorithms (ESA`01), pp. 266–277, 2001.
LibreCat | DOI
 

2001 | Conference Paper | LibreCat-ID: 18964
T. Lukovszki, A. Maheshwari, and N. Zeh, “I/O-Efficient Batched Range Counting and Its Applications to Proximity Problems,” in Proceedings of the 21st Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2001), LNCS, 2001.
LibreCat | DOI
 

2001 | Journal Article | LibreCat-ID: 23731
O. Bonorden, J. von zur Gathen, J. Gerhard, and O. Müller, “Factoring a binary polynomial of degree over one million,” ACM SIGSAM Bulletin, pp. 16–18, 2001.
LibreCat | DOI
 

2001 | Conference Paper | LibreCat-ID: 18152
M. Ziegler and V. Brattka, “A Computable Spectral Theorem,” in Proceedings of the 4th Workshop on Computability and Complexity in Analysis (CCA’2000), 2001, vol. 2064, pp. 378–388.
LibreCat | DOI
 

2001 | Conference Paper | LibreCat-ID: 18166
M. Ziegler and M. R. Emamy-Khansari, “New Bounds for Hypercube Slicing Numbers,” in Proceedings of the First International Conference on Discrete Models - Combinatorics, Computation and Geometry (DM-CCG’2001), 2001, vol. AA, pp. 155–164.
LibreCat
 

2001 | Conference Paper | LibreCat-ID: 18168
V. Brattka and M. Ziegler, “Turing Computability of (Non-)Linear Optimization,” in Proceedings of the 13th Canadian Conference on Computational Geometry (CCCG’01), 2001, pp. 181–184.
LibreCat
 

2001 | Conference Paper | LibreCat-ID: 18370
J. Klein and M. Fischer, “Occlusion Culling for Virtual Environments based on the 3D-Sectorgraph,” in Proc. of 3. GI-Informatiktage 2001, 2001, pp. 275–278.
LibreCat | Files available
 

2001 | Conference Paper | LibreCat-ID: 16492
M. Wand, M. Fischer, I. Peter, F. Meyer auf der Heide, and W. Straßer, “The randomized z-buffer algorithm,” in Proceedings of the 28th annual conference on Computer graphics and interactive techniques  - SIGGRAPH ’01, 2001.
LibreCat | DOI
 

2001 | Book Chapter | LibreCat-ID: 16493
F. Meyer auf der Heide, “Data Management in Networks,” in Graph-Theoretic Concepts in Computer Science, vol. 2204, Berlin, Heidelberg, 2001.
LibreCat | DOI
 

2001 | Book Chapter | LibreCat-ID: 16494
F. Meyer auf der Heide and R. Wanka, “Parallel Bridging Models and Their Impact on Algorithm Design,” in Computational Science - ICCS 2001, Berlin, Heidelberg, 2001.
LibreCat | DOI
 

2001 | Book (Editor) | LibreCat-ID: 16722
F. Meyer auf der Heide, Ed., Algorithms — ESA 2001, 9th Annual European Symposium Århus, Denmark, Lecture Notes in Computer Science (LNCS, Volume 2161). Berlin, Heidelberg: Springer , 2001.
LibreCat | DOI
 

2000 | Dissertation | LibreCat-ID: 19620
I. Rieping, Communication in Parallel Systems-Models, Algorithms and Implementations, vol. 81. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2000.
LibreCat
 

2000 | Dissertation | LibreCat-ID: 19621
M. Westermann, Caching in Networks: Non-Uniform Algorithms and Memory Capacity Constraints, vol. 90. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2000.
LibreCat | Files available
 

2000 | Report | LibreCat-ID: 19733
O. Bonorden, I. Rieping, I. von Otte, and B. Juurlink, PUB-Library, Release 7.0, User Guide and Function Reference. 2000.
LibreCat | Files available
 

2000 | Habilitation | LibreCat-ID: 19784
C. Scheideler, Probabilistic Methods for Coordination Problems. 2000.
LibreCat
 

2000 | Conference Paper | LibreCat-ID: 19849
M. Bednara, O. Beyer, J. Teich, and R. Wanka, “Tradeoff analysis and architecture design of a hybrid hardware/software sorter,” in Proc. Int. Conf. on Application Specific Systems, Architectures, and Processors (ASAP), 2000, pp. 299–308, doi: 10.1109/asap.2000.862400.
LibreCat | DOI
 

2000 | Journal Article | LibreCat-ID: 2143
M. Adler and C. Scheideler, “Efficient Communication Strategies for Ad Hoc Wireless Networks,” Theory Comput. Syst., vol. 33, no. 5/6, pp. 337--391, 2000.
LibreCat | DOI
 

2000 | Journal Article | LibreCat-ID: 2145
C. Scheideler and B. Vöcking, “From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols,” SIAM J. Comput., vol. 30, no. 4, pp. 1126--1155, 2000.
LibreCat | DOI
 

2000 | Conference Paper | LibreCat-ID: 2146 | OA
P. Berenbrink, A. Brinkmann, and C. Scheideler, “Distributed Path Selection for Storage Networks,” in PDPTA, 2000.
LibreCat | Files available
 

2000 | Conference Paper | LibreCat-ID: 2147 | OA
A. Czumaj and C. Scheideler, “Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma,” in SODA, 2000, pp. 30--39.
LibreCat | Files available
 

2000 | Journal Article | LibreCat-ID: 2148
A. Czumaj and C. Scheideler, “Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lovász local lemma,” Random Struct. Algorithms, vol. 17, no. 3–4, pp. 213--237, 2000.
LibreCat
 

2000 | Conference Paper | LibreCat-ID: 2149 | OA
A. Brinkmann, K. Salzwedel, and C. Scheideler, “Efficient, distributed data placement strategies for storage area networks (extended abstract),” in SPAA, 2000, pp. 119--128.
LibreCat | Files available
 

2000 | Conference Paper | LibreCat-ID: 2150 | OA
A. Czumaj and C. Scheideler, “A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (extended abstract),” in STOC, 2000, pp. 38--47.
LibreCat | Files available
 

2000 | Report | LibreCat-ID: 17865
M. Wand, M. Fischer, and F. Meyer auf der Heide, Randomized Point Sampling for Output-Sensitive Rendering of Complex Dynamic Scenes. Universität Paderborn, 2000.
LibreCat | Files available
 

2000 | Conference Paper | LibreCat-ID: 18962
S. Govindarajan, T. Lukovszki, A. Maheshwari, and N. Zeh, “I/O-Efficient Well-Separated Pair Decomposition and Applications,” in Proceedings of the 8th Annual European Symposium on Algorithms (ESA 2000), LNCS, 2000, pp. 585–614.
LibreCat | DOI
 

2000 | Conference Paper | LibreCat-ID: 17990
A. Czumaj, C. Sohler, and M. Ziegler, “Property Testing in Computational Geometry,” in Proceedings of the 8th Annual European Symposium on Algorithms (ESA’00), 2000, vol. 4698, pp. 155–166.
LibreCat | DOI
 

2000 | Conference Paper | LibreCat-ID: 18146
M. Ziegler and V. Brattka, “Computing the Dimension of Linear Subspaces,” in SOFSEM 2000: Theory and Practice of Informatics, 2000, vol. 1963, pp. 450–458.
LibreCat | DOI
 

2000 | Conference Paper | LibreCat-ID: 18150
M. Ziegler and C. Sohler, “Computing Cut Numbers,” in Proceedings of the 12th Canadian Conference on Computational Geometry (CCCG’00), 2000, pp. 73–79.
LibreCat
 

2000 | Journal Article | LibreCat-ID: 18446
K. Lorys, R. Wanka, B. Oesterdiekhoff, and M. Kutylowski, “Periodification Scheme: Constructing Sorting Networks with Constant Period,” Journal of the ACM, vol. 45, pp. 944–967, 2000, doi: 10.1145/355483.355490.
LibreCat | DOI
 

2000 | Conference Paper | LibreCat-ID: 2211 | OA
A. Czumaj and C. Scheideler, “A New Algorithmic Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems ,” in 32nd ACM Symposium on Theory of Computing, 2000, pp. 38–47.
LibreCat | Files available
 

2000 | Conference Paper | LibreCat-ID: 16495
F. Meyer auf der Heide, H. Räcke, and M. Westermann, “Data management in hierarchical bus networks,” 2000, doi: 10.1145/341800.341814.
LibreCat | DOI
 

2000 | Conference Paper | LibreCat-ID: 16496
F. Meyer auf der Heide, B. Vöcking, and M. Westermann, “Caching in networks,” in SODA ’00: Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms, 2000, pp. 430–439.
LibreCat
 

2000 | Book Chapter | LibreCat-ID: 16497
F. Meyer auf der Heide, M. Kutyłowski, and P. Ragde, “Complexity Theory and Algorithms,” in Euro-Par 2000 Parallel Processing, Berlin, Heidelberg, 2000.
LibreCat | DOI
 

2000 | Journal Article | LibreCat-ID: 17010
A. Czumaj, F. Meyer auf der Heide, and V. Stemann, “Contention Resolution in Hashing Based Shared Memory Simulations,” SIAM Journal on Computing, pp. 1703–1739, 2000.
LibreCat | DOI
 

2000 | Journal Article | LibreCat-ID: 16345
F. Meyer auf der Heide and R. Wanka, “Von der Hollerith-Maschine zum Parallelrechner - Die alltägliche Aufgabe des Sortierens als Fortschrittsmotor für die Informatik,” ForschungsForum Paderborn, pp. 112–116, 2000.
LibreCat | Files available
 

1999 | Conference Paper | LibreCat-ID: 19732
O. Bonorden, B. Juurlink, I. Von Otte, and I. Rieping, “The Paderborn university BSP (PUB) library-design, implementation and performance,” in Proceedings 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing, 1999, pp. 99–104, doi: 10.1109/ipps.1999.760442.
LibreCat | DOI
 

1999 | Journal Article | LibreCat-ID: 2151
M. Flammini and C. Scheideler, “Simple, Efficient Routing Schemes for All-Optical Networks,” Theory Comput. Syst., vol. 32, no. 3, pp. 387--420, 1999.
LibreCat | DOI
 

1999 | Conference Paper | LibreCat-ID: 2164 | OA
P. Berenbrink and C. Scheideler, “Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths,” in SODA, 1999, pp. 112--121.
LibreCat | Files available
 

1999 | Conference Paper | LibreCat-ID: 2165 | OA
P. Berenbrink, M. Riedel, and C. Scheideler, “Simple Competitive Request Scheduling Strategies,” in SPAA, 1999, pp. 33--42.
LibreCat | Files available
 

1999 | Conference Paper | LibreCat-ID: 17864
M. Fischer, T. Lukovszki, and M. Ziegler, “Partitioned neighborhood spanners of minimal outdegree,” in Proceedings of the 11th Canadian Conference on Computational Geometry, 1999.
LibreCat | Files available
 

1999 | Conference Paper | LibreCat-ID: 18747
C. Sohler, “Fast Reconstruction of Delaunay Triangulations,” in Proceedings of the 11th Canadian Conference on Computational Geometry ( CCCG’99), 1999, pp. 136–141.
LibreCat
 

1999 | Dissertation | LibreCat-ID: 18942
T. Lukovszki, New Results on Geometric Spanners and Their Applications, vol. 63. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1999.
LibreCat | Files available
 

1999 | Conference Paper | LibreCat-ID: 18959
T. Lukovszki, “New Results on Fault Tolerant Geometric Spanners,” in Proceedings of the 6th Workshop on Algorithms an Data Structures (WADS’99), LNCS, 1999, pp. 193–204.
LibreCat | DOI
 

1999 | Conference Paper | LibreCat-ID: 18965
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,” in Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures  - SPAA ’99, 1999, pp. 165–174.
LibreCat | DOI
 

1999 | Conference Paper | LibreCat-ID: 18576
C. Sohler, “Generating Random Star-Shaped Polygons,” in Proceedings of the 11th Canadian Conference on Computational Geometry ('CCCG’99), 1999, pp. 174–177.
LibreCat
 

1999 | Conference Paper | LibreCat-ID: 2210 | OA
P. Berenbrink, M. Riedel, and C. Scheideler, “Design of the PRESTO Multimedia Storage Network (Extended Abstract),” in International Workshop on Communication and Data Management in Large Networks (CDMLarge), 1999, pp. 2–12.
LibreCat | Files available
 

1999 | Conference Paper | LibreCat-ID: 2166 | OA
C. Scheideler and B. Vöcking, “From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols,” in STOC, 1999, pp. 215--224.
LibreCat | Files available
 

1999 | Journal Article | LibreCat-ID: 16501
F. Meyer auf der Heide and B. Vöcking, “Shortest-Path Routing in Arbitrary Networks,” Journal of Algorithms, pp. 105–131, 1999.
LibreCat | DOI
 

1999 | Journal Article | LibreCat-ID: 16502
P. Berenbrink, F. Meyer auf der Heide, and K. Schröder, “Allocating Weighted Jobs in Parallel,” Theory of Computing Systems, pp. 281–300, 1999.
LibreCat | DOI
 

1999 | Book Chapter | LibreCat-ID: 17052
E. W. Mayr, F. Meyer auf der Heide, and R. Wanka, “International Workshop on Communication and Data Management in Large Networks,” in Informatik aktuell, Berlin, Heidelberg, 1999.
LibreCat | DOI
 

1999 | Book Chapter | LibreCat-ID: 17053
F. Meyer auf der Heide, B. Vöcking, and M. Westermann, “Provably Good and Practical Strategies for Non-uniform Data Management in Networks,” in Algorithms - ESA’ 99, Berlin, Heidelberg, 1999.
LibreCat | DOI
 

1998 | Dissertation | LibreCat-ID: 19639
B. Vöcking, Static and Dynamic Data Management in Networks, vol. 46. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1998.
LibreCat | Files available
 

1998 | Report | LibreCat-ID: 19735
O. Bonorden, I. Rieping, I. von Otte, and B. Juurlink, The Paderborn University BSP (PUB) Library - Design, Implementation and Performance. 1998.
LibreCat | Files available
 

1998 | Book Chapter | LibreCat-ID: 17412
M. Fischer, T. Lukovszki, and M. Ziegler, “Geometric Searching in Walkthrough Animations with Weak Spanners in Real Time,” in Algorithms — ESA’ 98, Berlin, Heidelberg, 1998.
LibreCat | Files available | DOI
 

1998 | Conference Paper | LibreCat-ID: 17863
M. Fischer, T. Lukovszki, and M. Ziegler, “A Network Based Approach for Realtime Walkthrough of Massive Models,” in Algorithm Engineering, 2nd International Workshop, {WAE ’98}, 1998, pp. 133--142.
LibreCat | Files available
 

1998 | Report | LibreCat-ID: 18145
M. Ziegler, M. Fischer, and T. Lukovszki, Multimediale Entdeckungsreisen unserer Welt mit dem Internet. 1998.
LibreCat
 

1998 | Dissertation | LibreCat-ID: 18445
B. Oesterdiekhoff, On Periodic Comparator Networks. Universität Paderborn, 1998.
LibreCat
 

1998 | Journal Article | LibreCat-ID: 2168
C. Scheideler and B. Vöcking, “Universal Continuous Routing Strategies,” Theory Comput. Syst., vol. 31, no. 4, pp. 425--449, 1998.
LibreCat | DOI
 

1998 | Conference Paper | LibreCat-ID: 2169 | OA
M. Adler and C. Scheideler, “Efficient Communication Strategies for Ad-Hoc Wireless Networks (Extended Abstract),” in SPAA, 1998, pp. 259--268.
LibreCat | Files available
 

1998 | Conference Paper | LibreCat-ID: 2170 | OA
U. Feige and C. Scheideler, “Improved Bounds for Acyclic Job Shop Scheduling (Extended Abstract),” in STOC, 1998, pp. 624--633.
LibreCat | Files available
 

1998 | Book | LibreCat-ID: 2185
C. Scheideler, Universal Routing Strategies for Interconnection Networks, vol. 1390. 1998.
LibreCat | DOI
 

1998 | Journal Article | LibreCat-ID: 16503
F. Meyer auf der Heide, K. Schröder, and F. Schwarze, “Routing on networks of optical crossbars,” Theoretical Computer Science, vol. 196, pp. 181–200, 1998.
LibreCat | DOI
 

1998 | Journal Article | LibreCat-ID: 16504
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,” Theoretical Computer Science, pp. 175–203, 1998.
LibreCat | DOI
 

1998 | Book Chapter | LibreCat-ID: 16562
F. Meyer auf der Heide and G. T. Martinez, “Communication-efficient parallel multiway and approximate minimum cut computation,” in LATIN’98: Theoretical Informatics, Berlin, Heidelberg, 1998.
LibreCat | DOI
 

1998 | Conference Paper | LibreCat-ID: 16563
R. Cole et al., “Randomized protocols for low-congestion circuit routing in multistage interconnection networks,” in Proceedings of the thirtieth annual ACM symposium on Theory of computing  - STOC ’98, 1998.
LibreCat | DOI
 

1997 | Dissertation | LibreCat-ID: 19631
A. Bäumker, Communication Efficient Parallel Searching, vol. 28. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1997.
LibreCat
 

1997 | Dissertation | LibreCat-ID: 19636
W. Dittrich, Communication and I/O Efficient Parallel Data Structures, vol. 27. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1997.
LibreCat
 

1997 | Dissertation | LibreCat-ID: 19637
W.-B. Strothmann, Bounded Degree Spanning Trees, vol. 35. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1997.
LibreCat | Files available
 

1997 | Conference Paper | LibreCat-ID: 19869
A. Czumaj and W.-B. Strothmann, “Bounded degree spanning trees,” 1997, doi: 10.1007/3-540-63397-9_9.
LibreCat | DOI
 

1997 | Report | LibreCat-ID: 18955
W.-B. Strothmann and T. Lukovszki, Decremental Biconnectivity on Planar Graphs. Paderborn, 1997.
LibreCat | Files available
 

1997 | Conference Paper | LibreCat-ID: 18575
C. Sohler and M. Denny, “Encoding a Triangulation as a Permutation of its Point Set,” in Proceedings of the 9th Canadian Conference on Computational Geometry, 1997, pp. 39–43.
LibreCat
 

1997 | Conference Paper | LibreCat-ID: 2175 | OA
S. Bock, F. Meyer auf der Heide, and C. Scheideler, “Optimal Wormhole Routing in the (n, d)-Torus,” in IPPS, 1997, pp. 326--332.
LibreCat | Files available
 

1997 | Conference Paper | LibreCat-ID: 2179 | OA
M. Flammini and C. Scheideler, “Simple, Efficient Routing Schemes for All-Optical Networks,” in SPAA, 1997, pp. 170--179.
LibreCat | Files available
 

1997 | Journal Article | LibreCat-ID: 16564
D. Grigoriev, M. Karpinski, F. Meyer auf der Heide, and R. Smolensky, “A lower bound for randomized algebraic decision trees,” computational complexity, pp. 357–375, 1997.
LibreCat | DOI
 

1997 | Journal Article | LibreCat-ID: 16565
A. Czumaj, F. Meyer auf der Heide, and V. Stemann, “Simulating Shared Memory in Real Time: On the Computation Power of Reconfigurable Architectures,” Information and Computation, pp. 103–120, 1997.
LibreCat | DOI
 

1997 | Journal Article | LibreCat-ID: 16567
F. Meyer auf der Heide, M. Storch, and R. Wanka, “Optimal Tradeoffs Between Size and Slowdown for Universal Parallel Networks,” Theory of Computing Systems, pp. 627–644, 1997, doi: 10.1007/s002240000071.
LibreCat | DOI
 

1997 | Conference Paper | LibreCat-ID: 16568
M. Fischer, F. Meyer auf der Heide, and W.-B. Strothmann, “Dynamic data structures for realtime management of large geometric scenes,” in 5th Annual European Symposium on Algorithms (ESA ’97), 1997, vol. 1284, pp. 1157–170, doi: 10.1007/3-540-63397-9_13.
LibreCat | DOI
 

1997 | Book Chapter | LibreCat-ID: 16569
F. Meyer auf der Heide and B. Vöcking, “Static and dynamic data management in networks,” in Euro-Par’97 Parallel Processing, Berlin, Heidelberg, 1997.
LibreCat | DOI
 

1997 | Conference Paper | LibreCat-ID: 16604
P. Berenbrink, F. Meyer auf der Heide, and K. Schröder, “Allocating weighted jobs in parallel,” in Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures  - SPAA ’97, 1997.
LibreCat | DOI
 

1997 | Book Chapter | LibreCat-ID: 16605
A. Bäumker and F. Meyer auf der Heide, “Communication efficient parallel searching,” in Solving Irregularly Structured Problems in Parallel, Berlin, Heidelberg, 1997.
LibreCat | DOI
 

1997 | Book Chapter | LibreCat-ID: 16687
E. Karaivazoglou and F. Meyer auf der Heide, “Routing on asyncronous processor networks,” in Euro-Par’97 Parallel Processing, Berlin, Heidelberg, 1997.
LibreCat | DOI
 

1997 | Conference Paper | LibreCat-ID: 16689
B. M. Maggs, F. Meyer auf der Heide, B. Vöcking, and M. Westermann, “Exploiting locality for data management in systems of limited bandwidth,” 1997, doi: 10.1109/sfcs.1997.646117.
LibreCat | DOI
 

Filters and Search Terms

department=63

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed