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.
10463 Publications
2003 | Journal Article | LibreCat-ID: 3236
Wehrheim, Heike. “Behavioral Subtyping Relations for Active Objects.” Formal Methods in System Design, no. 2 (2003): 143--170. https://doi.org/10.1023/A:1024764232069.
LibreCat
| DOI
2003 | Conference Paper | LibreCat-ID: 3237
Wehrheim, Heike. “Preserving Properties Under Change.” In Formal Methods for Components and Objects, Second International Symposium, {FMCO} 2003, Leiden, The Netherlands, November 4-7, 2003, Revised Lectures, edited by Frank S. de Boer, Marcello M. Bonsangue, Susanne Graf, and Willem P. de Roever, 330--343. Lecture Notes in Computer Science, 2003. https://doi.org/10.1007/978-3-540-30101-1_16.
LibreCat
| DOI
2003 | Conference Paper | LibreCat-ID: 3238
Wehrheim, Heike. “Inheritance of Temporal Logic Properties.” In Formal Methods for Open Object-Based Distributed Systems, 6th {IFIP} {WG} 6.1 International Conference, {FMOODS} 2003, Paris, France, November 19.21, 2003, Proceedings, edited by Elie Najm, Uwe Nestmann, and Perdita Stevens, 79--93. Lecture Notes in Computer Science, 2003. https://doi.org/10.1007/978-3-540-39958-2_6.
LibreCat
| DOI
2003 | Conference Paper | LibreCat-ID: 3239
Rasch, Holger, and Heike Wehrheim. “Checking Consistency in {UML} Diagramms: Classes and State Machines.” In Formal Methods for Open Object-Based Distributed Systems, 6th {IFIP} {WG} 6.1 International Conference, {FMOODS} 2003, Paris, France, November 19.21, 2003, Proceedings, edited by Elie Najm, Uwe Nestmann, and Perdita Stevens, 229--243. Lecture Notes in Computer Science, 2003. https://doi.org/10.1007/978-3-540-39958-2_16.
LibreCat
| DOI
2003 | Conference Paper | LibreCat-ID: 3240
Derrick, John, and Heike Wehrheim. “Using Coupled Simulations in Non-Atomic Refinement.” In {ZB} 2003: Formal Specification and Development in {Z} and B, Third International Conference of {B} and {Z} Users, Turku, Finland, June 4-6, 2003, Proceedings, edited by Didier Bert, Jonathan P. Bowen, Steve King, and Marina A. Wald{\’{e}}n, 127--147. Lecture Notes in Computer Science, 2003. https://doi.org/10.1007/3-540-44880-2_10.
LibreCat
| DOI
2003 | Dissertation | LibreCat-ID: 2914
May, Alexander. New RSA Vulnerabilities Using Lattice Reduction Methods. Universität Paderborn, 2003.
LibreCat
| Download (ext.)
2003 | Book Chapter | LibreCat-ID: 3016
Blömer, Johannes, and Alexander May. “New Partial Key Exposure Attacks on RSA.” In Advances in Cryptology - CRYPTO 2003, 27–43. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003. https://doi.org/10.1007/978-3-540-45146-4_2.
LibreCat
| DOI
2003 | Book Chapter | LibreCat-ID: 3018
Blömer, Johannes, and Jean-Pierre Seifert. “Fault Based Cryptanalysis of the Advanced Encryption Standard (AES).” In Financial Cryptography, 162–81. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003. https://doi.org/10.1007/978-3-540-45126-6_12.
LibreCat
| DOI
2003 | Conference Paper | LibreCat-ID: 2128
Damerow, Valentina, Friedhelm Meyer auf der Heide, Harald Räcke, Christian Scheideler, and Christian Sohler. “Smoothed Motion Complexity.” In ESA, 2832:161--171. Lecture Notes in Computer Science. Springer, 2003. https://doi.org/10.1007/978-3-540-39658-1_17.
LibreCat
| DOI
2003 | Conference Paper | LibreCat-ID: 2129 | 
Awerbuch, Baruch, André Brinkmann, and Christian Scheideler. “Anycasting in Adversarial Systems: Routing and Admission Control.” In ICALP, 2719:1153--1168. Lecture Notes in Computer Science. Springer, 2003.
LibreCat
| Files available
2003 | Conference Paper | LibreCat-ID: 2130 |
Awerbuch, Baruch, and Christian Scheideler. “Peer-to-Peer Systems for Prefix Search.” In PODC, 123--132. ACM, 2003.
LibreCat
| Files available
2003 | Conference Paper | LibreCat-ID: 2131 |
Czumaj, Artur, Chris Riley, and Christian Scheideler. “Perfectly Balanced Allocation.” In RANDOM-APPROX, 2764:240--251. Lecture Notes in Computer Science. Springer, 2003.
LibreCat
| Files available
2003 | Conference Paper | LibreCat-ID: 2132 |
Jia, Lujun, Rajmohan Rajaraman, and Christian Scheideler. “On Local Algorithms for Topology Control and Routing in Ad Hoc Networks.” In SPAA, 220--229. ACM, 2003.
LibreCat
| Files available
2003 | Conference Paper | LibreCat-ID: 2133 |
Kothapalli, Kishore, and Christian Scheideler. “Information Gathering in Adversarial Systems: Lines and Cycles.” In SPAA, 333--342. ACM, 2003.
LibreCat
| Files available
2003 | Conference Paper | LibreCat-ID: 17423
Mueck, Bengt, Wilhelm Dangelmaier, and Matthias Fischer. “Components for the Active Support of the Analysis of Material Flow Simulations in a Virtual Environment.” In 15th European Simulation Symposium (ESS 2003), 367–71. SCS - Europe, 2003.
LibreCat
2003 | Conference Paper | LibreCat-ID: 18791
Magen, Avner, Funda Ergun, Christian Sohler, Ronitt Rubinfeld, Artur Czumaj, Ilan Newman, and Lance Fortnow. “Sublinear Approximation of Euclidean Minimum Spanning Tree.” In Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA 2003), 813–822, 2003.
LibreCat
2003 | Conference Paper | LibreCat-ID: 18907
Bienkowski, Marcin, Miroslaw Korzeniowski, and Harald Räcke. “A Practical Algorithm for Constructing Oblivious Routing Schemes.” In Proceedings of the Fifteenth Annual ACM Symposium on Parallel Algorithms and Architectures - SPAA ’03, 2003. https://doi.org/10.1145/777412.777418.
LibreCat
| DOI
2003 | Conference Paper | LibreCat-ID: 18947
Rust, Carsten, Friedhelm Stappert, and Tamás Lukovszki. “A Petri Net Model for the Network Layer of a Mobile Ad Hoc Network Architecture.” In 7th World Multiconference on Systemics, Cybernetics and Informatics, 2003.
LibreCat
2003 | Conference Paper | LibreCat-ID: 18960
Schindelhauer, Christian, Tamás Lukovszki, Stefan Rührup, and Klaus Volbert. “Worst Case Mobility in Ad Hoc Networks.” In Proc. of the 15th ACM Symposium on Parallel Algorithms and Architectures (SPAA03), 2003. https://doi.org/10.1145/777412.777448.
LibreCat
| DOI
2003 | Conference Paper | LibreCat-ID: 18966
Azar, Yossi, Edith Cohen, Amos Fiat, Haim Kaplan, and Harald Racke. “Optimal Oblivious Routing in Polynomial Time.” In Proceedings of the Thirty-Fifth ACM Symposium on Theory of Computing - STOC ’03, 2003. https://doi.org/10.1145/780542.780599.
LibreCat
| DOI