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.

264 Publications


2010 | Conference Paper | LibreCat-ID: 15137
S. Böttcher, R. Hartel, and C. Messinger, “Searchable Compression of Office Documents by XML Schema Subtraction,” in Database and XML Technologies - 7th International XML Database Symposium, XSym 2010, 2010, pp. 103–112.
LibreCat | DOI
 

2010 | Book Chapter | LibreCat-ID: 16365
B. Degener, B. Kempkes, P. Kling, and F. Meyer auf der Heide, “A Continuous, Local Strategy for Constructing a Short Chain of Mobile Robots,” in Structural Information and Communication Complexity, Berlin, Heidelberg, 2010, pp. 168–182.
LibreCat | DOI
 

2010 | Book (Editor) | LibreCat-ID: 16403
S. Abramsky, C. Gavoille, C. Kirchner, F. Meyer auf der Heide, and P. G. Spirakis, Eds., Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part II. Berlin, Heidelberg, 2010.
LibreCat | DOI
 

2010 | Book (Editor) | LibreCat-ID: 16404
S. Abramsky, C. Gavoille, C. Kirchner, F. Meyer auf der Heide, and P. G. Spirakis, Eds., Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I. Berlin, Heidelberg, 2010.
LibreCat | DOI
 

2010 | Book Chapter | LibreCat-ID: 13301
M. Trier and C. Müller, “Towards a Systematic Approach for Capturing Knowledge-Intensive Business Processes,” in Practical Aspects of Knowledge Management, Berlin, Heidelberg, 2010.
LibreCat | DOI
 

2009 | Book Chapter | LibreCat-ID: 19724
O. Bonorden, B. Degener, B. Kempkes, and P. Pietrzyk, “Complexity and Approximation of a Geometric Local Robot Assignment Problem,” in Algorithmic Aspects of Wireless Sensor Networks, Berlin, Heidelberg: Springer, 2009, pp. 252–262.
LibreCat | DOI
 

2009 | Book Chapter | LibreCat-ID: 2920
S. Kakvi, “Reinforcement Learning for Blackjack,” in Lecture Notes in Computer Science, Berlin, Heidelberg: Springer Berlin Heidelberg, 2009, pp. 300–301.
LibreCat | DOI
 

2009 | Book Chapter | LibreCat-ID: 3000
J. Schrieb, H. Wehrheim, and D. Wonisch, “Three-Valued Spotlight Abstractions,” in FM 2009: Formal Methods, Berlin, Heidelberg: Springer Berlin Heidelberg, 2009, pp. 106–122.
LibreCat | DOI
 

2009 | Book Chapter | LibreCat-ID: 23744
P. Briest, M. Hoefer, L. Gualà, and C. Ventre, “On Stackelberg Pricing with Computationally Bounded Consumers,” in Lecture Notes in Computer Science, Berlin, Heidelberg, 2009.
LibreCat | DOI
 

2009 | Book Chapter | LibreCat-ID: 1830
T. Biermann, A. Schwabe, and H. Karl, “Creating Butterflies in the Core – A Network Coding Extension for MPLS/RSVP-TE,” in NETWORKING 2009, Berlin, Heidelberg: Springer Berlin Heidelberg, 2009, pp. 883–894.
LibreCat | DOI
 

2009 | Book Chapter | LibreCat-ID: 9616
S. Kakvi, “Reinforcement Learning for Blackjack,” in Lecture Notes in Computer Science, Berlin, Heidelberg, 2009.
LibreCat | DOI
 

2008 | Conference Paper | LibreCat-ID: 19686
P. Briest, “Uniform Budgets and the Envy-Free Pricing Problem,” in Proceedings of the 35th InternationalColloquium on Automata, Languages and Programming (ICALP), 2008.
LibreCat | DOI
 

2008 | Conference Paper | LibreCat-ID: 19003
B. Degener, J. Gehweiler, and C. Lammersen, “The Kinetic Facility Location Problem,” in Proceedings of the 11th Scandinavian Workshop on Algorithm Theory (SWAT), 2008, pp. 378–389.
LibreCat | DOI
 

2008 | Conference Paper | LibreCat-ID: 20367
H. Hamann and H. Wörn, “Aggregating Robots Compute: An Adaptive Heuristic for the Euclidean Steiner Tree Problem,” in The tenth International Conference on Simulation of Adaptive Behavior (SAB’08), 2008, vol. 5040, pp. 447--456.
LibreCat | DOI
 

2008 | Book Chapter | LibreCat-ID: 17978
K. Lürwer-Brüggemeier and M. Ziegler, “On Faster Integer Calculations Using Non-arithmetic Primitives,” in Unconventional Computing, Berlin, Heidelberg, 2008.
LibreCat | DOI
 

2007 | Conference Paper | LibreCat-ID: 24276
M. Bienkowski and J. Kutyłowski, “The k-Resource Problem on Uniform and on Uniformly Decomposable Metric Spaces,” 2007, doi: 10.1007/978-3-540-73951-7_30.
LibreCat | DOI
 

2007 | Book Chapter | LibreCat-ID: 3019
A. May, “Cryptanalysis of Unbalanced RSA with Small CRT-Exponent,” in Advances in Cryptology — CRYPTO 2002, Berlin, Heidelberg: Springer Berlin Heidelberg, 2007, pp. 242–256.
LibreCat | DOI
 

2007 | Book Chapter | LibreCat-ID: 3020
J. Blömer and A. May, “Low Secret Exponent RSA Revisited,” in Lecture Notes in Computer Science, Berlin, Heidelberg: Springer Berlin Heidelberg, 2007, pp. 4–19.
LibreCat | DOI
 

2007 | Book Chapter | LibreCat-ID: 3021
J. Blömer and A. May, “Key Revocation with Interval Cover Families,” in Selected Areas in Cryptography, Berlin, Heidelberg: Springer Berlin Heidelberg, 2007, pp. 325–341.
LibreCat | DOI
 

2007 | Book Chapter | LibreCat-ID: 3022
A. May and J. H. Silverman, “Dimension Reduction Methods for Convolution Modular Lattices,” in Lecture Notes in Computer Science, Berlin, Heidelberg: Springer Berlin Heidelberg, 2007, pp. 110–125.
LibreCat | DOI
 

2007 | Book Chapter | LibreCat-ID: 3026
J. Blömer, “A Probabilistic Zero-Test for Expressions Involving Roots of Rational Numbers,” in Algorithms — ESA’ 98, Berlin, Heidelberg: Springer Berlin Heidelberg, 2007, pp. 151–162.
LibreCat | DOI
 

2007 | Conference Paper | LibreCat-ID: 18929
M. Dynia, M. Korzeniowski, and J. Kutyłowski, “Competitive Maintenance of Minimum Spanning Trees in Dynamic Graphs,” in Proc. of the 33rd International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM’07), 2007, vol. 4362, pp. 260--271.
LibreCat | DOI
 

2007 | Book Chapter | LibreCat-ID: 17982
M. Ziegler, “(Short) Survey of Real Hypercomputation,” in Lecture Notes in Computer Science, Berlin, Heidelberg, 2007.
LibreCat | DOI
 

2007 | Book Chapter | LibreCat-ID: 17983
K. Meer and M. Ziegler, “Real Computational Universality: The Word Problem for a Class of Groups with Infinite Presentation,” in Mathematical Foundations of Computer Science 2007, Berlin, Heidelberg, 2007.
LibreCat | DOI
 

2007 | Book Chapter | LibreCat-ID: 16640
B. Monien and R. Preis, “Upper Bounds on the Bisection Width of 3- and 4-Regular Graphs,” in Mathematical Foundations of Computer Science 2001, Berlin, Heidelberg, 2007.
LibreCat | DOI
 

2007 | Conference Paper | LibreCat-ID: 15144
S. Böttcher and R. Steinmetz, “Evaluating XPath Queries on XML Data Streams,” in Data Management. Data, Data Everywhere, 24th British National Conference on Databases, BNCOD 24, 2007, pp. 101–113.
LibreCat | DOI
 

2007 | Conference Paper | LibreCat-ID: 15146
S. Böttcher and R. Steinmetz, “Data Management for Mobile Ajax Web 2.0 Applications,” in Database and Expert Systems Applications, 18th International Conference, DEXA 2007, 2007, pp. 424–433.
LibreCat | DOI
 

2006 | Conference Paper | LibreCat-ID: 19838
S. Rührup and C. Schindelhauer, “Online Multi-path Routing in a Maze,” in Proc. of the 17th International Symposium on Algorithms and Computation (ISAAC 2006), 2006.
LibreCat | DOI
 

2006 | Conference Paper | LibreCat-ID: 24277
J. Kutyłowski and F. Zagórski, “Reliable Broadcasting Without Collision Detection,” 2006, doi: 10.1007/11611257_37.
LibreCat | DOI
 

2006 | Book Chapter | LibreCat-ID: 3004
J. Blömer and V. Krummel, “Fault Based Collision Attacks on AES,” in Lecture Notes in Computer Science, Berlin, Heidelberg: Springer Berlin Heidelberg, 2006, pp. 106–120.
LibreCat | DOI
 

2006 | Book Chapter | LibreCat-ID: 3005
J. Blömer and M. Otto, “Wagner’s Attack on a Secure CRT-RSA Algorithm Reconsidered,” in Lecture Notes in Computer Science, Berlin, Heidelberg: Springer Berlin Heidelberg, 2006, pp. 13–23.
LibreCat | DOI
 

2006 | Book Chapter | LibreCat-ID: 3007
J. Blömer, M. Otto, and J.-P. Seifert, “Sign Change Fault Attacks on Elliptic Curve Cryptosystems,” in Lecture Notes in Computer Science, Berlin, Heidelberg: Springer Berlin Heidelberg, 2006, pp. 36–52.
LibreCat | Files available | DOI
 

2006 | Conference Paper | LibreCat-ID: 18926
M. Dynia, M. Korzeniowski, and C. Schindelhauer, “Power-Aware Collective Tree Exploration,” in Architecture of Computing Systems - ARCS, 2006, no. 3894, pp. 341--351.
LibreCat | DOI
 

2006 | Book Chapter | LibreCat-ID: 17987
K. Meer and M. Ziegler, “Uncomputability Below the Real Halting Problem,” in Logical Approaches to Computational Barriers, Berlin, Heidelberg, 2006.
LibreCat | DOI
 

2006 | Book Chapter | LibreCat-ID: 16472
E. D. Demaine, F. Meyer auf der Heide, R. Pagh, and M. Pǎtraşcu, “De Dictionariis Dynamicis Pauco Spatio Utentibus ({lat.} On Dynamic Dictionaries Using Little Space),” in LATIN 2006: Theoretical Informatics, Berlin, Heidelberg, 2006.
LibreCat | DOI
 

2006 | Book Chapter | LibreCat-ID: 16473
M. Dynia, J. Kutyłowski, F. Meyer auf der Heide, and C. Schindelhauer, “Smart Robot Teams Exploring Sparse Trees,” in Lecture Notes in Computer Science, Berlin, Heidelberg, 2006.
LibreCat | DOI
 

2006 | Conference Paper | LibreCat-ID: 15150
S. Böttcher and R. Steinmetz, “DTD-Driven Structure Preserving XML Compression,” in Flexible and Efficient Information Handling, 23rd British National Conference on Databases, BNCOD 23, 2006, pp. 266–269.
LibreCat | DOI
 

2006 | Conference Paper | LibreCat-ID: 15152
S. Böttcher and R. Steinmetz, “Information Disclosure by XPath Queries,” in Secure Data Management, Third VLDB Workshop, SDM 2006, 2006, pp. 160–174.
LibreCat | DOI
 

2006 | Book Chapter | LibreCat-ID: 35958
É. Fouvry and J. Klüners, “Cohen–Lenstra Heuristics of Quadratic Number Fields,” in Lecture Notes in Computer Science, Berlin, Heidelberg: Springer Berlin Heidelberg, 2006.
LibreCat | Files available | DOI
 

2006 | Book Chapter | LibreCat-ID: 53181
W. Geiselmann, F. Januszewski, H. Köpfer, J. Pelzl, and R. Steinwandt, “A Simpler Sieving Device: Combining ECM and TWIRL,” in Information Security and Cryptology – ICISC 2006, Berlin, Heidelberg: Springer Berlin Heidelberg, 2006.
LibreCat | DOI
 

2005 | Conference Paper | LibreCat-ID: 19835
S. Rührup, C. Schindelhauer, and K. Volbert, “Performance Analysis of the Hierarchical Layer Graph for Wireless Networks,” in Proc. of 4th International Conference on Ad-Hoc, Mobile & Wireless Networks (ADHOC-NOW 2005), 2005, vol. 3738, pp. 244–257.
LibreCat | DOI
 

2005 | Book Chapter | LibreCat-ID: 19836
C. Schindelhauer and K. Voß, “Probability Distributions for Channel Utilisation,” in Proc. of 4th International Conference on Ad-Hoc Networks & Wireless (ADHOC-NOW 2005), 2005, pp. 271–284.
LibreCat | DOI
 

2005 | Conference Paper | LibreCat-ID: 19912
C. Loeser, G. Schomaker, A. Brinkmann, M. Vodisek, and M. Heidebuer, “Content Distribution in Heterogenous Video-on-Demand P2P Networks with ARIMA Forecasts,” in Proceedings of the 4th International Conference on Networking, 2005, vol. 3421, pp. 800–810.
LibreCat | DOI
 

2005 | Book Chapter | LibreCat-ID: 3006
J. Blömer and A. May, “A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers,” in EUROCRYPT 2005, Berlin, Heidelberg: Springer Berlin Heidelberg, 2005, pp. 251–267.
LibreCat | Files available | DOI
 

2005 | Book Chapter | LibreCat-ID: 3010
M. Ernst, E. Jochemsz, A. May, and B. de Weger, “Partial Key Exposure Attacks on RSA up to Full Size Exponents,” in EUROCRYPT 2005, Berlin, Heidelberg: Springer Berlin Heidelberg, 2005, pp. 371–386.
LibreCat | DOI
 

2005 | Book Chapter | LibreCat-ID: 26991
S. Rührup and C. Schindelhauer, “Online Routing in Faulty Meshes with Sub-linear Comparative Time and Traffic Ratio,” in Algorithms – ESA 2005, Berlin, Heidelberg, 2005.
LibreCat | DOI
 

2005 | Conference Paper | LibreCat-ID: 18768
M. Bădoiu, A. Czumaj, P. Indyk, and C. Sohler, “Facility Location in Sublinear Time,” in Proc. of the 32nd International Colloquium on Automata, Languages and Programming (ICALP), 2005, pp. 866–877.
LibreCat | DOI
 

2005 | Conference Paper | LibreCat-ID: 18867
G. Frahling and J. Krokowski, “Online Occlusion Culling,” in Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005), 2005, vol. 3669, pp. 758–769.
LibreCat | DOI
 

2005 | Conference Paper | LibreCat-ID: 18912
M. Bienkowski and M. Korzeniowski, “Dynamic Page Migration Under Brownian Motion,” in Proc. of the European Conference in Parallel Processing (Euro-Par), 2005.
LibreCat | DOI
 

2005 | Conference Paper | LibreCat-ID: 18915
M. Bienkowski and J. Byrka, “Bucket Game with Applications to Set Multicover and Dynamic Page Migration,” in Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005), 2005, vol. 3669, pp. 815–826.
LibreCat | DOI
 

2005 | Conference Paper | LibreCat-ID: 18924
M. Bienkowski, A. Brinkmann, M. Korzeniowski, and O. Orhan, “Cube Connected Cycles Based Bluetooth Scatternet Formation,” in Proceedings of the 4th International Conference on Networking, 2005, vol. 3420, pp. 413–420.
LibreCat | DOI
 

2005 | Conference Paper | LibreCat-ID: 18925
M. Bienkowski, M. Dynia, and M. Korzeniowski, “Improved Algorithms for Dynamic Page Migration,” in Proc. of the 22nd Symposium on Theoretical Aspects of Computer Science (STACS), 2005, pp. 365–376.
LibreCat | DOI
 

2005 | Book Chapter | LibreCat-ID: 17988
S. Köhler, C. Schindelhauer, and M. Ziegler, “On Approximating Real-World Halting Problems,” in Fundamentals of Computation Theory, Berlin, Heidelberg, 2005.
LibreCat | DOI
 

2005 | Book Chapter | LibreCat-ID: 17989
K. Meer and M. Ziegler, “An Explicit Solution to Post’s Problem over the Reals,” in Fundamentals of Computation Theory, Berlin, Heidelberg, 2005.
LibreCat | DOI
 

2005 | Conference Paper | LibreCat-ID: 18280
M. Ziegler, “Computability and Continuity on the Real Arithmetic Hierarchy and the Power of Type-2 Nondeterminism,” in Proc. CiE 2005: New Computational Paradigms, 2005, vol. 3526, pp. 562–571.
LibreCat | DOI
 

2005 | Book Chapter | LibreCat-ID: 16468
M. Bienkowski, M. Korzeniowski, and F. Meyer auf der Heide, “Dynamic Load Balancing in Distributed Hash Tables,” in Peer-to-Peer Systems IV, Berlin, Heidelberg, 2005.
LibreCat | DOI
 

2005 | Book Chapter | LibreCat-ID: 16469
M. Bienkowski and F. Meyer auf der Heide, “Page Migration in Dynamic Networks,” in Mathematical Foundations of Computer Science 2005, Berlin, Heidelberg, 2005.
LibreCat | DOI
 

2005 | Conference Paper | LibreCat-ID: 16470
O. Bonorden, J. Gehweiler, and F. Meyer auf der Heide, “A Web Computing Environment for Parallel Algorithms in Java,” in Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM), 2005, pp. 801–808.
LibreCat | DOI
 

2005 | Conference Paper | LibreCat-ID: 16471
O. Bonorden, J. Gehweiler, and F. Meyer auf der Heide, “Load Balancing Strategies in a Web Computing Environment,” in Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM), 2005, pp. 839–846.
LibreCat | DOI
 

2005 | Conference Paper | LibreCat-ID: 15156
S. Böttcher and R. Steinmetz, “Detecting Privacy Violations in Sensitive XML Databases,” in Secure Data Management, Second VLDB Workshop, SDM 2005, 2005, pp. 143–154.
LibreCat | DOI
 

2004 | Conference Paper | LibreCat-ID: 19692
P. Briest et al., “The Ising Model: Simple Evolutionary Algorithms as Adaptation Schemes,” in Parallel Problem Solving from Nature - PPSN VIII, 2004.
LibreCat | DOI
 

2004 | Book Chapter | LibreCat-ID: 3011
J. Blömer, J. Guajardo, and V. Krummel, “Provably Secure Masking of AES,” in Selected Areas in Cryptography, Berlin, Heidelberg: Springer Berlin Heidelberg, 2004, pp. 69–83.
LibreCat | DOI
 

2004 | Book Chapter | LibreCat-ID: 3012
J. Blömer and A. May, “A Generalized Wiener Attack on RSA,” in Public Key Cryptography – PKC 2004, Berlin, Heidelberg: Springer Berlin Heidelberg, 2004, pp. 1–13.
LibreCat | Files available | DOI
 

2004 | Book Chapter | LibreCat-ID: 3014
A. May, “Secret Exponent Attacks on RSA-type Schemes with Moduli N=p^{r}q,” in Public Key Cryptography – PKC 2004, Berlin, Heidelberg: Springer Berlin Heidelberg, 2004, pp. 218–230.
LibreCat | DOI
 

2004 | Book Chapter | LibreCat-ID: 3015
A. May, “Computing the RSA Secret Key Is Deterministic Polynomial Time Equivalent to Factoring,” in Advances in Cryptology – CRYPTO 2004, Berlin, Heidelberg: Springer Berlin Heidelberg, 2004, pp. 213–219.
LibreCat | DOI
 

2004 | Conference Paper | LibreCat-ID: 18778
V. Damerow and C. Sohler, “Extreme Points Under Random Noise,” in Proceedings of the 12th European Symposium on Algorithms (ESA’04), 2004.
LibreCat | DOI
 

2004 | Conference Paper | LibreCat-ID: 18263
M. Nüsken and M. Ziegler, “Fast Multipoint Evaluation of Bivariate Polynomials,” in Proc. 12th Annual Symposium on Algorithms (ESA’04), 2004, vol. 3221, pp. 544–555.
LibreCat | DOI
 

2004 | Conference Paper | LibreCat-ID: 18279
C. Schindelhauer, K. Volbert, and M. Ziegler, “Spanners, Weak Spanners, and Power Spanners for Wireless Networks,” in Proc. of 15th Annual International Symposium on Algorithms and Computation (ISAAC’04), 2004, vol. 3341, pp. 805–821.
LibreCat | DOI
 

2004 | Conference Paper | LibreCat-ID: 16474
V. Bansal, F. Meyer auf der Heide, and C. Sohler, “Labeling Smart Dust,” in 12th Annual European Symposium on Algorithms (ESA 2004), 2004, vol. 3221.
LibreCat | DOI
 

2004 | Conference Paper | LibreCat-ID: 13618
H. Walder and M. Platzner, “A Runtime Environment for Reconfigurable Hardware Operating Systems,” in Proceedings of the 14th International Conference on Field Programmable Logic and Applications (FPL), 2004, pp. 831–835.
LibreCat | DOI
 

2003 | Journal Article | LibreCat-ID: 19785
K. A. Salzwedel, “Algorithmic Approaches for Storage Networks,” Algorithms for Memory Hierarchies, vol. 2625, 2003.
LibreCat | DOI
 

2003 | Book Chapter | LibreCat-ID: 3016
J. Blömer and A. May, “New Partial Key Exposure Attacks on RSA,” in Advances in Cryptology - CRYPTO 2003, Berlin, Heidelberg: Springer Berlin Heidelberg, 2003, pp. 27–43.
LibreCat | DOI
 

2003 | Book Chapter | LibreCat-ID: 3018
J. Blömer and J.-P. Seifert, “Fault Based Cryptanalysis of the Advanced Encryption Standard (AES),” in Financial Cryptography, Berlin, Heidelberg: Springer Berlin Heidelberg, 2003, pp. 162–181.
LibreCat | DOI
 

2003 | Conference Paper | LibreCat-ID: 18196
M. Ziegler, “Quasi-optimal Arithmetic for Quaternion Polynomials,” in Proc. 14th Annual International Symposium on Algorithms and Computation (ISAAC’03), 2003, pp. 705–715.
LibreCat | DOI
 

2003 | Book Chapter | LibreCat-ID: 18258
M. Ziegler, “Fast Relative Approximation of Potential Fields,” in Lecture Notes in Computer Science, vol. 2748, F. Dehne, J. Sack, M. Smid, and Algorithms and Data Structures. WADS 2003, Eds. Berlin, Heidelberg: Springer, 2003.
LibreCat | DOI
 

2003 | Book Chapter | LibreCat-ID: 16543
M. Dellnitz and R. Preis, “Congestion and Almost Invariant Sets in Dynamical Systems,” in Lecture Notes in Computer Science, Berlin, Heidelberg, 2003.
LibreCat | DOI
 

2003 | Book Chapter | LibreCat-ID: 16664
O. Schütze, “A New Data Structure for the Nondominance Problem in Multi-objective Optimization,” in Lecture Notes in Computer Science, Berlin, Heidelberg, 2003.
LibreCat | DOI
 

2003 | Book Chapter | LibreCat-ID: 16665
O. Schütze, S. Mostaghim, M. Dellnitz, and J. Teich, “Covering Pareto Sets by Multilevel Evolutionary Subdivision Techniques,” in Lecture Notes in Computer Science, Berlin, Heidelberg, 2003.
LibreCat | DOI
 

2003 | Conference Paper | LibreCat-ID: 15077
S. Böttcher and R. Steinmetz, “Testing Containment of XPath Expressions in Order to Reduce the Data Transfer to Mobile Clients,” in Advances in Databases and Information Systems, 7th East European Conference, ADBIS 2003, 2003, pp. 400–410.
LibreCat | DOI
 

2003 | Conference Paper | LibreCat-ID: 15078
S. Böttcher and R. Steinmetz, “A DTD Graph Based XPath Query Subsumption Test,” in Database and XML Technologies, First International XML Database Symposium, XSym 2003, 2003, pp. 85–99.
LibreCat | DOI
 

2003 | Conference Paper | LibreCat-ID: 13615
C. Steiger, H. Walder, and M. Platzner, “Heuristics for Online Scheduling Real-Time Tasks to Partially Reconfigurable Devices,” in Proceedings of the 13th International Conference on Field Programmable Logic and Applications (FPL), 2003, pp. 575–584.
LibreCat | DOI
 

2002 | Conference Paper | LibreCat-ID: 19850
R. Wanka, “Any Load-Balancing Regimen for Evolving Tree Computations on Circulant Graphs Is Asymptotically Optimal,” in Proc. Workshop on Graph-Theoretic Concepts in Computer Science (WG), 2002, pp. 413–420.
LibreCat | DOI
 

2002 | Conference Paper | LibreCat-ID: 24338
M. Grünewald, T. Lukovszki, C. Schindelhauer, and K. Volbert, “Distributed Maintenance of Resource Efficient Wireless Network Topologies,” 2002, doi: 10.1007/3-540-45706-2_134.
LibreCat | DOI
 

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 | 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 | 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: 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 | 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 | 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 | Book Chapter | LibreCat-ID: 3023
J. Blömer, “Closest Vectors, Successive Minima, and Dual HKZ-Bases of Lattices,” in Automata, Languages and Programming, Berlin, Heidelberg: Springer Berlin Heidelberg, 2000, pp. 248–259.
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 | 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
 

1999 | Book Chapter | LibreCat-ID: 2435
J. Simon, A. Reinefeld, and O. Heinz, “Large-Scale SCI Clusters in Practice: Architecture and Performance in SCI,” in SCI: Scalable Coherent Interface. Architecture and Software for High-Performance Compute Clusters, vol. 1734, H. Hellwagner and A. Reinefeld, Eds. Berlin / Heidelberg: Springer, 1999, pp. 367–381.
LibreCat | DOI
 

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 | 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
 

1999 | Conference Paper | LibreCat-ID: 13608
M. Eisenring, M. Platzner, and L. Thiele, “Communication Synthesis for Reconfigurable Embedded Systems,” in Proceedings of the 9th International Workshop on Field Programmable Logic and Applications (FPL), 1999, vol. 1673, pp. 205–214.
LibreCat | DOI
 

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
 

Filters and Search Terms

issn=0302-9743

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed