Deutsch Intern
Institute of Computer Science

Technical Reports

Institute of Computer Science
University of Würzburg

Publisher: The directors of the Institute of Computer Science.


The entries are sorted according to the publication date, the most recent entry is at the beginning.

This list is maintained on www.bibsonomy.org under URL http://www.bibsonomy.org/user/trcsuniwue.

2017[ to top ]
  • Illmer, Joachim ; Janke, Daniel ; Kayal, Hakan ; Knapp, Andreas ; van der Lucht, Joschka ; Lutz, Jonas ; Shamloonia, Mehrnaz ; Sommer, Kai ; et al.: Mars Base 2030 ( Nr. 500), 2017
  • Seipel, D. ; Hanus, M. ; Abreu, S. (eds.): Declare 2017 – Conference on Declarative Programming ( Nr. 499) : Institut für Informatik, 2017
2016[ to top ]
  • Gebert, Steffen ; Zinner, Thomas ; Lange, Stanislav ; Schwartz, Christian ; Tran-Gia, Phuoc: Discrete-Time Analysis: Deriving the Distribution of the Number of Events in an Arbitrarily Distributed Interval ( Nr. 498), 2016
2015[ to top ]
  • Hirth, Matthias ; Lehrieder, Frank ; Oberste-Vorth, Stephan ; Hoßfeld, Tobias ; Tran-Gia, Phuoc: Wikipedia and its Network of Human and Automated Authors from a Social Network Perspective ( Nr. 494), 2015
  • Seufert, Michael ; Hoßfeld, Tobias ; Machado, Guilherme Sperb ; Bocek, Thomas ; Biancani, Matteo ; Cruschelli, Paolo ; Lapacz, Roman ; Darzanos, George ; et al.: A Survey of Cloud Services and Potential Applications of Social Awareness ( Nr. 496), 2015
  • Kiesner, Maximilian ; Nehmeier, Marco ; Wolff von Gudenberg, Jürgen: ITF1788: An Interval Testframework for IEEE 1788 ( Nr. 495), 2015
  • Gebert, Steffen ; Schwartz, Christian ; Zinner, Thomas ; Tran-Gia, Phuoc: Agile Management of Software Based Networks ( Nr. 493), 2015
2014[ to top ]
  • Nalepa, Grzegorz J. ; Baumeister, Joachim: Proceedings of the 10th Workshop on Knowledge Engineering and Software Engineering (KESE) ( Nr. 492). Department of Computer Science, 2014
  • Wamser, Florian ; Klein, Dominik ; Tran-Gia, Phuoc: Second Interim Report for the DFG Project FunkOFDMA ( Nr. 489). Department of Computer Science, 2014
  • Hoßfeld, Tobias ; Seufert, Michael ; Sieber, Christian ; Zinner, Thomas: Crowdsourced subjective user study results on QoE influence factors of HTTP Adaptive Streaming ( Nr. 491), 2014
  • Seufert, Michael ; Egger, Sebastian ; Slanina, Martin ; Zinner, Thomas ; Hoßfeld, Tobias ; Tran-Gia, Phuoc: A Survey on Quality of Experience of HTTP Adaptive Streaming ( Nr. 490), 2014
  • Cunis, Torbjørn ; Fischer, Wendelin ; Gillmann, Florian ; van gen Hassend, Max ; Hempfling, Christina ; Kayal, Hakan ; König, Frederik ; Lauterbach, Helge ; et al.: Moon Base 2030 ( Nr. 497), 2014
2013[ to top ]
  • Schwartz, Christian ; Hossfeld, Tobias ; Lehrieder, Frank ; Tran-Gia, Phuoc: Performance Analysis of the Trade-off Between Signalling Load and Power Consumption for Popular Smartphone Apps in 3G Networks ( Nr. 485). Department of Computer Science, 2013
  • Hoßfeld, Tobias ; Keimel, Christian ; Hirth, Matthias ; Gardlo, Bruno ; Habigt, Julian ; Diepold, Klaus ; Tran-Gia, Phuoc: CrowdTesting: A Novel Methodology for Subjective User Studies and QoE Evaluation ( Nr. 486). Department of Computer Science, 2013
  • Nalepa, Grzegorz J. ; Baumeister, Joachim: Proceedings of the 9th Workshop on Knowledge Engineering and Software Engineering (KESE) ( Nr. 487). Department of Computer Science, 2013
  • Zinner, Thomas ; Hoßfeld, Tobias ; Tran-Gia, Phuoc ; Kellerer, Wolfgang: A Compass through SDN networks ( Nr. 488). Department of Computer Science, 2013
2012[ to top ]
  • Metzger, Florian ; Gebert, Steffen ; Salzlechner, Katharina ; Ratetseder, Albert ; Romirer, Peter ; Tutschku, Kurt: Research Report On Signaling Load and Tunnel Management in a 3G Core Network ( Nr. 484). Department of Computer Science, 2012
2011[ to top ]
  • Nehmeier, Marco: Generative Programming for Automatic Differentiation in C++0x ( Nr. 483). Department of Computer Science, 2011
  • Hoßfeld, Tobias ; Zinner, Thomas ; Schatz, Raimund ; Seufert, Michael ; Tran-Gia, Phuoc: Transport Protocol Influences on YouTube QoE ( Nr. 482). Department of Computer Science, 2011
  • Tschorsch, F. ; Scheuermann, B.: Tor is Unfair - and What to Do About It ( Nr. 481). Department of Computer Science, 2011
  • Fleszar, K. ; Glaßer, Christian ; Lipp, F. ; Reitwießner, Christian ; Witek, Maximilian: The Complexity of Solving Multiobjective Optimization Problems and its Relation to Multivalued Functions ( Nr. 480). Department of Computer Science, 2011
  • Schlosser, Daniel ; Duelli, Michael ; Goll, Sebastian: Performance Comparison of Common Server Hardware Virtualization Solutions Regarding the Network Throughput of Virtualized Systems ( Nr. 479). Department of Computer Science, 2011
  • Hirth, Matthias ; Hoßfeld, Tobias ; Tran-Gia, Phuoc: Human Cloud as Emerging Internet Application - Anatomy of the Microworkers Crowdsourcing Platform ( Nr. 478). Department of Computer Science, 2011
2010[ to top ]
  • Menth, Michael ; Hartmann, Matthias ; Klein, Dominik: Global Locator, Local Locator, and Identifier Split (GLI-Split) ( Nr. 470). Department of Computer Science, 2010
  • Selivanov, Victor: Fine Hierarchies via Priestley Duality ( Nr. 466). Department of Computer Science, 2010
  • Staehle, Barbara ; Hirth, Matthias ; Wamser, F. ; Pries, Rastin ; Staehle, Dirk: YoMo: A YouTube Application Comfort Monitoring Tool ( Nr. 467). Department of Computer Science, 2010
  • Menth, Michael ; Lehrieder, Frank: PCN-Based Marked Flow Termination ( Nr. 469). Department of Computer Science, 2010
  • Menth, Michael ; Lehrieder, Frank: Applicability of PCN-Based Admission Control ( Nr. 468). Department of Computer Science, 2010
  • Klein, Dominik ; Tutschku, Kurt ; Zinner, Thomas: Measurement-based Topology and Performance Investigations of D-A-CH Research Networks ( Nr. 473). Department of Computer Science, 2010
  • Pries, Rastin ; Staehle, Dirk ; Hock, David ; Hirth, Matthias: A Policy-Based Vertical Handover System ( Nr. 471). Department of Computer Science, 2010
  • Menth, Michael ; Hartmann, Matthias ; Höfling, M.: Mapping Systems for Loc/ID Split Internet Routing ( Nr. 472). Department of Computer Science, 2010
  • Mühlberger, Clemens: Integrating Time-Stamped Synchronization into a Periodical MAC Protocol - Problems and Experiences ( Nr. 477). Department of Computer Science, 2010
  • Hirth, Matthias ; Hoßfeld, Tobias ; Tran-Gia, Phuoc: Cheat-Detection Mechanisms for Crowdsourcing ( Nr. 474). Department of Computer Science, 2010
  • Nalepa, G. ; Baumeister, Joachim: KESE: tth Workshop on Knowledge Engineering and Software Engineering ( Nr. 475). Department of Computer Science, 2010
  • Nehmeier, Marco ; von Gudenberg, Jürgen Wolff: Interval Comparisons and Lattice Operations based on the Interval Overlapping Relation ( Nr. 476). Department of Computer Science, 2010
2009[ to top ]
  • Klein, Alexander: Statistic-Based Routing (SBR) ( Nr. 453). Department of Computer Science, 2009
  • Zinner, Thomas ; Tutschku, Kurt ; Nakao, Akihiro ; Tran-Gia, Phuoc: Influence of Packet Re-ordering on Concurrent Multipath Transmissions for Transport Virtualization ( Nr. 452). Department of Computer Science, 2009
  • Staehle, Dirk ; Staehle, Barbara ; Pries, Rastin: Max-Min Fair Throughput in Multi-Gateway Multi-Rate Mesh Networks ( Nr. 454). Department of Computer Science, 2009
  • Baunach, Marcel ; Mühlberger, Clemens ; Appold, Christian ; Schröder, Martin ; Füller, Florian: Analysis of Radio Signal Parameters for Calibrating RSSI Localization Systems ( Nr. 455). Department of Computer Science, 2009
  • Zinner, Thomas ; Staehle, Dirk ; Oechsner, Simon ; Tran-Gia, Phuoc ; Tutschku, Kurt: An Analytical Model for the Evaluation of the Information Processing in Multi-Probe Networks ( Nr. 456). Department of Computer Science, 2009
  • Freiberg, Martina: Usability Assessment of Knowledge-Based Consultation Systems ( Nr. 457). Department of Computer Science, 2009
  • Mühlberger, Clemens ; Kolla, Reiner: Extended Desynchronization for Multi-Hop Topologies ( Nr. 460). Department of Computer Science, 2009
  • Atzmüller, Martin ; Nalepa, G.: Towards Rapid Knowledge Capture using Textual Subgroup Mining for Rule Prototyping ( Nr. 458). Department of Computer Science, 2009
  • Oechsner, Simon ; Lehrieder, Frank ; Hoßfeld, Tobias ; Metzger, Florian ; Pussep, K. ; Staehle, Dirk: Pushing the Performance of Biased Neighbor Selection through Biased Unchoking ( Nr. 459). Department of Computer Science, 2009
  • Baumeister, Joachim ; Nalepa, G. J.: Proceedings of the 5th workshop on Knowledge Engineering and Software Engineering (KESE 2009) ( Nr. 461). Department of Computer Science, 2009
  • Glaßer, Christian ; Reitwießner, Christian ; Witek, Maximilian: Improved and Derandomized Approximations for Two-Criteria Metric Traveling Salesman ( Nr. 462). Department of Computer Science, 2009
  • Atzmüller, Martin ; Lemmerich, F. ; Reutelshoefer, Jochen ; Puppe, Frank: An Extensible Architecture for Wiki-Enabled Semantic Data Mining ( Nr. 463). Department of Computer Science, 2009
  • Hoßfeld, Tobias ; Hock, David ; Oechsner, Simon ; Lehrieder, Frank ; Despotovic, Z. ; Kellerer, W. ; Michel, M.: Measurement of BitTorrent Swarms and their AS Topologies ( Nr. 464). Department of Computer Science, 2009
  • Karl, Stefan: NP-Complete Ranges of Counting Functions of Nondeterministic Finite Automata ( Nr. 465). Department of Computer Science, 2009
2008[ to top ]
  • Fischer, Gregor ; Lusiardi, Joachim: JaML: XML Representation of Java source code ( Nr. 445). Department of Computer Science, 2008
  • Spoerhase, Joachim ; Wirth, H.-C.: (r,p)-Centroid Problems on Paths and Trees. ( Nr. 441). Department of Computer Science, 2008
  • Glaßer, Christian ; Reitwießner, Christian ; Selivanov, Victor: The Shrinking Property for NP and coNP. ( Nr. 440). Department of Computer Science, 2008
  • Hoßfeld, Tobias ; Hock, David ; Tran-Gia, Phuoc ; Tutschku, Kurt ; Fiedler, Markus: Testing the IQX Hypothesis for Exponential Interdependency between QoS and QoE of Voice Codecs iLBC and G.711 ( Nr. 442). Department of Computer Science, 2008
  • Fischer, Gregor ; Lusiardi, Joachim ; von Gudenberg, Jürgen Wolff: Source Code Model Hierarchies ( Nr. 444). Department of Computer Science, 2008
  • Glaßer, Christian ; Reitwießner, Christian ; Schmitz, Heinz: Multiobjective Disk Cover Admits a PTAS ( Nr. 443). Department of Computer Science, 2008
  • Hoßfeld, Tobias ; Oechsner, Simon ; Lehrieder, Frank ; Bergner, Christian ; Tran-Gia, Phuoc: Investigation of chunk selection strategies in peer-assisted video-on-demand systems ( Nr. 446). Department of Computer Science, 2008
  • Okhotin, Alexander ; Reitwießner, Christian: Conjunctive grammars with restricted disjuction ( Nr. 447). Department of Computer Science, 2008
  • Baumeister, Joachim ; Atzmüller, Martin: Proceedings of LWA 2008 (Lernen, Wissen, Adaptivität) ( Nr. 448). Department of Computer Science, 2008
  • Tutschku, Kurt ; Zinner, Thomas ; Nakao, Akihiro ; Tran-Gia, Phuoc: The Case of Network Virtualization: Concurrent Multipath Transmissions within Routing Overlays ( Nr. 449). Department of Computer Science, 2008
  • Freiberg, Martina ; Baumeister, Joachim: A Survey on Usability Evaluation Techniques and an Analysis of their actual Application ( Nr. 450). Department of Computer Science, 2008
  • Pries, Rastin ; Staehle, Dirk ; Stoykova, Marieta: On the Usability of Genetic Algorithms for Wireless Mesh Network Planning and Optimization ( Nr. 451). Department of Computer Science, 2008
2007[ to top ]
  • Mäder, Andreas ; Staehle, Dirk ; Spahn, Markus: Performance Comparison of HSDPA Transmit Power Allocation Schemes in UMTS Networks. ( Nr. 411). Department of Computer Science, 2007
  • Norros, Ilkka ; Pehkonen, Vesa ; Reittu, Hannu ; Binzenhöfer, Andreas ; Tutschku, Kurt: Relying on Randomness - PlanetLab Experiments with Distributed File-sharing Protocols. ( Nr. 407). Department of Computer Science, 2007
  • Oechsner, Simon ; Tran-Gia, Phuoc: Performance Evaluation of a Reliable Content Mediation Platform in the Emerging Future Internet. ( Nr. 408). Department of Computer Science, 2007
  • Emmert, Barbara ; Binzenhöfer, Andreas ; Schlosser, Daniel ; Weiss, Markus: Source Traffic Characterization for Thin Client Based Office Applications. ( Nr. 406). Department of Computer Science, 2007
  • Menth, Michael ; Martin, Rüdiger ; Spörlein, Ulrich: Failure-Specific Self-Protecting Multipaths: Increased Capacity Savings or Overengineering?. ( Nr. 420). Department of Computer Science, 2007
  • Menth, Michael ; Martin, Rüdiger ; Koster, Arie M.C.A. ; Orlowski, Sebastian: Overview of Resilience Mechanisms Based on Multipath Structures. ( Nr. 421). Department of Computer Science, 2007
  • Jansen, Lasse ; Gojmerac, Ivan ; Menth, Michael ; Reichl, Peter ; Tran-Gia, Phuoc: Discrete-Time Algorithms for Flow-Level Simulation of Data Networks. ( Nr. 416). Department of Computer Science, 2007
  • Binzenhöfer, Andreas ; Leibnitz, Kenji: Estimating Churn in Structured P2P Overlay Networks. ( Nr. 404). Department of Computer Science, 2007
  • Staehle, Dirk ; Mäder, Andreas: A Model for Time-Efficient HSDPA Simulations. ( Nr. 414). Department of Computer Science, 2007
  • Binzenhöfer, Andreas ; Schnabel, Holger: Improving the Performance and Robustness of Kademlia-based Overlay Networks. ( Nr. 405). Department of Computer Science, 2007
  • Mäder, Andreas ; Staehle, Dirk ; Barth, Hans: A Novel Performance Model for the HSDPA with Adaptive Resource Allocation. ( Nr. 409). Department of Computer Science, 2007
  • Martin, Rüdiger ; Menth, Michael ; Hemmkeppler, Michael: Accuracy and Dynamics of Multi-Stage Load Balancing for Multipath Internet Routing. ( Nr. 419). Department of Computer Science, 2007
  • Pries, Rastin ; Mäder, Andreas ; Staehle, Dirk: Performance of Header Compression for VoIP in Wireless LANs. ( Nr. 403). Department of Computer Science, 2007
  • Glaßer, Christian ; Reitwießner, Christian ; Travers, Stephen ; Waldherr, M.: Satisfiability of Algebraic Circuits over Sets of Natural Numbers. ( Nr. 402). Department of Computer Science, 2007
  • Spoerhase, Joachim ; Wirth, H.-C.: Relaxed Voting and Competitive Location on Trees under Monotonuos Gain Functions. ( Nr. 401). Department of Computer Science, 2007
  • Glaßer, Christian: Logspace Mitoticity. ( Nr. 400). Department of Computer Science, 2007
  • Tutschku, Kurt ; Hoßfeld, Tobias ; Berl, A. ; de Meer, Hermann ; Oberender, Jend: Mobile P2P Applications in Infrastructure-based Mobile Networks. ( Nr. 398). Department of Computer Science, 2007
  • Baunach, Marcel ; Kolla, Reiner ; Mühlberger, Clemens: SNoW5:a modular platform for sophisticated real-time wireless sensor networking. ( Nr. 399). Department of Computer Science, 2007
  • Tutschku, Kurt: P2P-based Network and Service Operation for the Emerging Future Internet. ( Nr. 397). Department of Computer Science, 2007
  • Mäder, Andreas ; Staehle, Dirk ; Spahn, Markus: Impact of HSDPA Radio Resource Allocation Schemes on the System Performance of UMTS Networks. ( Nr. 410). Department of Computer Science, 2007
  • Leibnitz, Kenji ; Hoßfeld, Tobias ; Wakamiya, Naoki ; Murata, Masayuki: Peer-to-Peer vs. Client/Server: Reliability and Efficiency of a Content Distribution Service. ( Nr. 422). Department of Computer Science, 2007
  • Staehle, Dirk: On the Code and Soft Capacity of the UMTS FDD Downlink and the Capacity Increase by using a Secondary Scrambling Code. ( Nr. 413). Department of Computer Science, 2007
  • Selivanov, Victor: Fine Hierarchies and m-Reducibilities in Theoretical Computer Science. ( Nr. 430). Department of Computer Science, 2007
  • Pries, Rastin ; Staehle, Dirk ; Oechsner, Simon ; Menth, Michael ; Menth, Stefan: A New Perspective on the Unfair Channel Access Phenomenon in Wireless Local Area Networks. ( Nr. 439). Department of Computer Science, 2007
  • Wirth, H.-C.: On the Complexity of Budgeted Maximum Path Coverage on Trees. ( Nr. 438). Department of Computer Science, 2007
  • Glaßer, Christian ; Pavan, A. ; Travers, Stephen: False Positives and NP-Hard Sets. ( Nr. 435). Department of Computer Science, 2007
  • Spoerhase, Joachim ; Wirth, H.-C.: A Linear Time Algorithm for Absolute Optima under Monotonous Gain Functions on Trees. ( Nr. 433). Department of Computer Science, 2007
  • Menth, Michael ; Lehrieder, Frank: Comparison of Marking Algorithms for PCN-Based Admission Control. ( Nr. 437). Department of Computer Science, 2007
  • Selivanov, Victor ; Wagner, Klaus: Complexity of Topological Properties of Regular omega-Languages. ( Nr. 436). Department of Computer Science, 2007
  • Seipel, Dietmar ; Hanus, M. ; Wolf, Armin ; Baumeister, Joachim: Proceedings INAP / WLP 2007. ( Nr. 434). Department of Computer Science, 2007
  • Glaßer, Christian ; Schmitz, Heinz ; Selivanov, Victor: Efficient Algorithms for Membership in Boolean Hierarchies of Regular Languages. ( Nr. 429). Department of Computer Science, 2007
  • Tutschku, Kurt ; Tran-Gia, Phuoc ; Andersen, Frank-Uwe: Trends in Network and Service Operation for the Emerging Future Internet. ( Nr. 431). Department of Computer Science, 2007
  • Martin, Rüdiger ; Menth, Michael ; Hartmann, Matthias: The Effect of Combining Loop-Free Alternates and Not-Via Addresses in IP Fast Reroute. ( Nr. 432). Department of Computer Science, 2007
  • Duelli, Michael ; Hoßfeld, Tobias ; Staehle, Dirk: Impact of Vertical Handovers on Cooperative Content Distribution Systems. ( Nr. 428). Department of Computer Science, 2007
  • Martin, Rüdiger ; Menth, Michael ; Spörlein, Ulrich: Integer SPM: Intelligent Path Selection for Resilient Network. ( Nr. 417). Department of Computer Science, 2007
  • Menth, Michael ; Martin, Rüdiger ; Spörlein, Ulrich: Optimization of the Self-Protecting Multipath for Deployment in Legacy Networks. ( Nr. 418). Department of Computer Science, 2007
  • Menth, Michael ; Hartmann, Matthias ; Martin, Rüdiger: Robust IP Link Costs for Multilayer Resilience . ( Nr. 427). Department of Computer Science, 2007
  • Emmert, Barbara ; Staehle, Dirk: Impact of Energy Models on Energy Efficient Sensor Network Routing. ( Nr. 415). Department of Computer Science, 2007
  • Klügl, Franziska: Towards a Formal Framework for Multi-Agent Simulation Models. ( Nr. 412). Department of Computer Science, 2007
  • Hoßfeld, Tobias ; Tran-Gia, Phuoc ; Fiedler, Markus: Quantification of Quality of Experience for Edge-Based Applications. ( Nr. 423). Department of Computer Science, 2007
  • Menth, Michael ; Binzenhöfer, Andreas ; Mühleck, Stefan: Source Models for Speech Traffic Revisited. ( Nr. 426). Department of Computer Science, 2007
  • Menth, Michael ; Martin, Rüdiger ; Hartmann, Matthias ; Spoerlein, Ulrich: Efficiency of Routing and Resilience Mechanisms in Packet-Switched Networks. ( Nr. 425). Department of Computer Science, 2007
  • Baunach, Marcel ; Kolla, Reiner ; Mühlberger, Clemens: SNoW BAT: A high precise WSN based location system. ( Nr. 424). Department of Computer Science, 2007
2006[ to top ]
  • Reitwießner, Christian: Zusammenfalten des Postschen Verbandes mittels Operationen aus binären Booleschen Funktionen. ( Nr. 386). Department of Computer Science, 2006
  • Chevul, Stefan ; Binzenhöfer, Andreas ; Schmid, Matthias ; Tutschku, Kurt ; Fiedler, Markus: A Self-Organizing Concept for Distributed End-to-End Quality Monitoring. ( Nr. 378). Department of Computer Science, 2006
  • Milbrandt, Jens ; Menth, Michael ; Junker, Jan: Experience-Based Admission Control with Type-Specific Overbooking. ( Nr. 382). Department of Computer Science, 2006
  • Menth, Michael ; Henjes, Robert ; Gehrsitz, Sebastian ; Zepfel, Christian: Throughput Comparison of Professional JMS Servers. ( Nr. 380). Department of Computer Science, 2006
  • Milbrandt, Jens ; Menth, Michael ; Junker, Jan: Performance of Experience-Based Admission Control in the Presence of Traffic Changes. ( Nr. 381). Department of Computer Science, 2006
  • Glaßer, Christian ; Selman, Alan L. ; Travers, Stephen ; Wagner, Klaus W.: The Complexity of Disjoint Unions. ( Nr. 384). Department of Computer Science, 2006
  • Binzenhöfer, Andreas ; Schlosser, Daniel ; auf dem Graben, Björn: A Novel Approach to Verify End-to-End Connectivity in an Autonomic Way. ( Nr. 383). Department of Computer Science, 2006
  • Schlosser, Daniel ; Hoßfeld, Tobias ; Tutschku, Kurt: Comparison of Robust Cooperation Strategies for P2P Content Distribution Networks with Multiple Source Download. ( Nr. 385). Department of Computer Science, 2006
  • Milbrandt, Jens ; Humm, Korbinian ; Menth, Michael: Adaptive Bandwidth Allocation: Impact of Routing and Load Balancing on Tunnel Capacity Requirements. ( Nr. 379). Department of Computer Science, 2006
  • Mäder, Andreas ; Staehle, Dirk: An Analytical Model for Best-Effort Traffic over the UMTS Enhanced Uplink. ( Nr. 388). Department of Computer Science, 2006
  • von Gudenberg, Jürgen Wolff ; Niederle, A. ; Ebner, Marc ; Eichelberger, Holger: An Evolutionary Algorithm for the Layout of UML Class Diagrams. ( Nr. 391). Department of Computer Science, 2006
  • Selivanov, Victor: Fine Hierarchy of Regular Aperiodic omega-Languages. ( Nr. 390). Department of Computer Science, 2006
  • Glaßer, Christian ; Selman, Alan L. ; Travers, Stephen ; Zhang, Liyu: Non-Mitotic Sets. ( Nr. 389). Department of Computer Science, 2006
  • Meister, D.: Generating maximal spanning forests for some geometric graph classes. ( Nr. 393). Department of Computer Science, 2006
  • Glaßer, Christian ; Herr, K. ; Reitwießner, Christian ; Travers, Stephen ; Waldherr, M.: Equivalence Problems for Circuits over Sets of Natural Numbers. ( Nr. 392). Department of Computer Science, 2006
  • Brümmer, N. ; Baumeister, Joachim ; Puppe, Frank: Relations between Visual and Textual Representations of Temporal Patterns for Medical Data Abstraction. ( Nr. 394). Department of Computer Science, 2006
  • Selivanov, Victor: Classifying omega-Regular Partitions. ( Nr. 396). Department of Computer Science, 2006
  • Pries, Rastin ; Mäder, Andreas ; Staehle, Dirk: UMTS Load Metrics for a Policy-Based Vertical Handover Framework. ( Nr. 395). Department of Computer Science, 2006
  • Mäder, Andreas ; Staehle, Dirk ; Liu, Tony ; Barth, Hans: Feasible Load Regions for different RRM Strategies for the Enhanced Uplink in UMTS Networks. ( Nr. 387). Department of Computer Science, 2006
2005[ to top ]
  • Fiedler, M. ; Chevul, S. ; Radtke, O. ; Tutschku, Kurt ; Binzenhöfer, Andreas: The Network Utility Function: A Practicable Concept for Assessing Network Impact on Distributed Services. ( Nr. 355). Department of Computer Science, 2005
  • Meister, D.: The structure of separator graphs and efficient algorithms for minimal triangulations problems of permutation graphs. ( Nr. 361). Department of Computer Science, 2005
  • Martin, Rüdiger ; Menth, Michael ; Charzinski, Joachim: Comparison of Link-by-Link Admission Control and Capacity Overprovisioning. ( Nr. 360). Department of Computer Science, 2005
  • Böhler, Elmar ; Schnoor, H.: The Complexity of the Descriptiveness of Boolean Circuits Over Different Sets of Gates. ( Nr. 357). Department of Computer Science, 2005
  • Yanenko, E. ; Schuhmacher, E. ; Spörlein, U. ; Tutschku, Kurt: An O(n log n) Heuristic for the Euclidean Traveling Salesman Problem. ( Nr. 358). Department of Computer Science, 2005
  • Böhler, Elmar ; Reith, Steffen ; Schnoor, H. ; Vollmer, Heribert: Simple Bases for Boolean Co-Clones. ( Nr. 350). Department of Computer Science, 2005
  • Hoßfeld, Tobias ; Mäder, Andreas ; Tutschku, Kurt ; Tran-Gia, Phuoc ; Andersen, Frank-Uwe ; de Meer, Hermann ; Dedinski, I.: Comparison of Crawling Strategies for an Optimized Mobile P2P Architecture. ( Nr. 356). Department of Computer Science, 2005
  • Böhler, Elmar: On the Lattice of Clones Below the Polynomial Time Functions. ( Nr. 352). Department of Computer Science, 2005
  • Glaßer, Christian ; Travers, Stephen ; Wagner, Klaus W.: A Reducibility that Corresponds to Unbalanced Leaf-Language Classes. ( Nr. 354). Department of Computer Science, 2005
  • Bauland, M. ; Böhler, Elmar ; Creignou, N. ; Reith, Steffen ; Schnoor, H. ; Vollmer, Heribert: Quantified Constraints: The Complexity of Decision and Counting for Bounded Alternation. ( Nr. 353). Department of Computer Science, 2005
  • Binzenhöfer, Andreas ; Tutschku, Kurt ; auf dem Graben, Björn ; Fiedler, Markus ; Carlsson, Patrik: A P2P-based Framework for Distributed Network Management. ( Nr. 351). Department of Computer Science, 2005
  • Tran-Gia, Phuoc ; Binzenhöfer, Andreas: On the Stochastic Scalability of Information Sharing Platforms. ( Nr. 364). Department of Computer Science, 2005
  • Milbrandt, Jens ; Menth, Michael ; Kopf, Stefan: Adaptive Bandwidth Allocation: Concepts and Efficiency for Admission-Controlled Capacity Tunnels. ( Nr. 362). Department of Computer Science, 2005
  • Martin, Rüdiger ; Menth, Michael ; Charzinski, Joachim: Comparison of Border-to-Border Budget Based Network Admission Control and Capacity Overprovisioning. ( Nr. 359). Department of Computer Science, 2005
  • Milbrandt, Jens ; Menth, Michael ; Kopf, Stefan: Adaptive Bandwidth Allocation: Impact of Traffic Demand Models for Wide Area Networks. ( Nr. 363). Department of Computer Science, 2005
  • Wagner, Klaus W.: Leaf Language Classes. ( Nr. 372). Department of Computer Science, 2005
  • Mäder, Andreas ; Staehle, Dirk ; Schröder, Bernd: Dimensioning of Hardware Components in UMTS Networks with Sectorized NodeBs. ( Nr. 365). Department of Computer Science, 2005
  • Hoßfeld, Tobias ; Binzenhöfer, Andreas ; Fiedler, M. ; Tutschku, Kurt: Measurement and Analysis of Skype VoIP Traffic in 3G UMTS Systems. ( Nr. 377). Department of Computer Science, 2005
  • Hoßfeld, Tobias ; Mäder, Andreas ; Tutschku, Kurt ; Andersen, Frank-Uwe: Time-Discrete Analysis of the Crawling Strategy in an Optimized Mobile P2P Architecture. ( Nr. 374). Department of Computer Science, 2005
  • Binzenhöfer, Andreas ; Kunzmann, Gerald ; Henjes, Robert: A Scalable Algorithm to Monitor Chord-based P2P Systems at Runtime. ( Nr. 373). Department of Computer Science, 2005
  • Glaßer, Christian ; Travers, Stephen: Machines that can Output Empty Words. ( Nr. 376). Department of Computer Science, 2005
  • Fiedler, Markus ; Tutschku, Kurt ; Chevul, Stefan ; Isaksson, Lennart ; Binzenhöfer, Andreas: The Throughput Utility Function: Assessing Network Impact on Mobile Services. ( Nr. 375). Department of Computer Science, 2005
  • Hoßfeld, Tobias ; Binzenhöfer, Andreas ; Schlosser, Daniel ; Eger, Kolja ; Oberender, Jend ; Dedinski, Ivan ; Kunzmann, Gerald: Towards Efficient Simulation of Large Scale P2P Networks. ( Nr. 371). Department of Computer Science, 2005
  • Hoßfeld, Tobias ; Oechsner, Simon ; Tutschku, Kurt ; Andersen, Frank-Uwe: Evaluation of a Pastry-based P2P Overlay for Supporting Vertical Handover. ( Nr. 368). Department of Computer Science, 2005
  • Meister, D.: The complexity of problems concerning matrix powers and the numbers of paths in a graph. ( Nr. 369). Department of Computer Science, 2005
  • Oechsner, Simon ; Hoßfeld, Tobias ; Tutschku, Kurt ; Andersen, Frank-Uwe ; Caviglione, L.: Using Kademlia for the Configuration of B3G Radio Access Nodes. ( Nr. 370). Department of Computer Science, 2005
  • Hoßfeld, Tobias ; Oechsner, Simon ; Tutschku, Kurt ; Andersen, Frank-Uwe ; Caviglione, L.: Supporting Vertical Handover by Using a Pastry Peer-to-Peer Overlay Network. ( Nr. 367). Department of Computer Science, 2005
  • Hoßfeld, Tobias ; Leibnitz, Kenji ; Wakamiya, Naoki ; Murata, Masayuki: Impact of Interferers on the Epidemic Diffusion in Peer-to-Peer File-Sharing Networks. ( Nr. 366). Department of Computer Science, 2005
2004[ to top ]
  • Böhler, Elmar ; Glaßer, Christian ; Schwarz, Bernhard ; Wagner, Klaus W.: Generation Problems. ( Nr. 329). Department of Computer Science, 2004
  • Meister, D.: A complete characterisation of minimal triangulations of co-square-free graphs. ( Nr. 328). Department of Computer Science, 2004
  • Böhler, Elmar ; Creignou, N. ; Reith, Steffen ; Vollmer, Heribert: Playing with Boolean Blocks: Post’s Lattice with Applications to Complexity Theory. ( Nr. 317). Department of Computer Science, 2004
  • Menth, Michael ; Milbrandt, Jens ; Oechsner, Simon: Experience Based Admission Control (EBAC). ( Nr. 325). Department of Computer Science, 2004
  • Menth, Michael: A Framework for Modelling and Solving Discrete Finite Markov Chains. ( Nr. 326). Department of Computer Science, 2004
  • Menth, Michael ; Milbrandt, Jens ; Zeiger, Florian: Elastic Token Bucket - A Traffic Characterization for Time-Limited Bursty Traffic. ( Nr. 324). Department of Computer Science, 2004
  • Martin, Ruediger ; Menth, Michael ; Phan-Gia, V.: Performance of TCP/IP with MEDF Scheduling. ( Nr. 323). Department of Computer Science, 2004
  • Schwarz, Bernhard: The Complexity of Satisfiability Problems over Finite Lattices. ( Nr. 314). Department of Computer Science, 2004
  • Böhler, Elmar ; Creignou, N. ; Reith, Steffen ; Vollmer, Heribert: Playing with Boolean Blocks: Constraint Satisfaction Problems. ( Nr. 318). Department of Computer Science, 2004
  • Menth, Michael ; Milbrandt, Jens ; Kopf, St.: Capacity Assignment for NAC Budgets in Resilient Networks. ( Nr. 319). Department of Computer Science, 2004
  • Menth, Michael ; Reifert, Andreas ; Milbrandt, Jens: Optimization of End-to-End Protection Switching Mechanisms for MPLS Networks. ( Nr. 320). Department of Computer Science, 2004
  • Staehle, Dirk ; Mäder, Andreas: An Analytic Model for Deriving the Node-B Transmit Power in Heterogeneous UMTS Networks. ( Nr. 316). Department of Computer Science, 2004
  • Seipel, Dietmar ; Hanus, M. ; Geske, U. ; Bartenstein, O.: Proceedings of INAP / WLP 2004. ( Nr. 327). Department of Computer Science, 2004
  • Menth, Michael ; Milbrandt, Jens ; Reifert, Andreas: Sensitivity of Backup Capacity Requirements to Traffic Distribution and Resilience Constraints. ( Nr. 322). Department of Computer Science, 2004
  • Glaßer, Christian: Counting with Counterfree Automata. ( Nr. 315). Department of Computer Science, 2004
  • Binzenhöfer, Andreas ; Tran-Gia, Phuoc: Delay Analysis of a Chord-based Peer-to-Peer File-Sharing System. ( Nr. 332). Department of Computer Science, 2004
  • Mäder, Andreas ; Staehle, Dirk: Analytic Modelling of the WCDMA Downlink Capacity in Multi-Service Environments. ( Nr. 330). Department of Computer Science, 2004
  • Menth, Michael ; Reifert, Andreas ; Milbrandt, Jens: Self-Protecting Multipaths - A Simple and Resource-Efficient Protection Switching Mechanism for MPLS Networks. ( Nr. 321). Department of Computer Science, 2004
  • Martin, R. ; Menth, Michael: Improving the Timeliness of Rate Measurements. ( Nr. 331). Department of Computer Science, 2004
  • Staehle, Dirk: An Analytic Method for Coverage Prediction in the UMTS Radio Network Planning Process. ( Nr. 342). Department of Computer Science, 2004
  • Mäder, Andreas ; Staehle, Dirk: Uplink Blocking Probabilities in Heterogenous WCDMA Networks considering Other-Cell Interference. ( Nr. 333). Department of Computer Science, 2004
  • Binzenhöfer, Andreas ; Staehle, Dirk ; Henjes, Robert: Estimating the Size of a Chord Ring. ( Nr. 348). Department of Computer Science, 2004
  • Hoßfeld, Tobias ; Tutschku, Kurt ; Andersen, Frank-Uwe ; de Meer, Hermann ; Oberender, Jend: Simulative Performance Evaluation of a Mobile Peer-to-Peer File-Sharing System. ( Nr. 345). Department of Computer Science, 2004
  • Hoßfeld, Tobias ; Tutschku, Kurt ; Andersen, Frank-Uwe: Mapping of File-Sharing onto Mobile Environments: Enhancement by UMTS. ( Nr. 343). Department of Computer Science, 2004
  • Hoßfeld, Tobias ; Mäder, Andreas ; Tutschku, Kurt ; Andersen, Frank-Uwe ; Kappler, Cornelia ; de Meer, Hermann ; Dedinski, I. ; Oberender, Jend: An Architecture Concept for Mobile P2P File Sharing Services. ( Nr. 344). Department of Computer Science, 2004
  • Binzenhöfer, Andreas ; Staehle, Dirk ; Henjes, Robert: On the Stability of Chord-based P2P Systems. ( Nr. 347). Department of Computer Science, 2004
  • Pries, Rastin ; Heck, Klaus ; Wirth, Thomas ; Tran-Gia, Phuoc: Robustness Analysis of the Wireless LAN MAC Protocols with QoS Support. ( Nr. 346). Department of Computer Science, 2004
  • Selivanov, Victor L.: Some Hierarchies and Reducibilities on Regular Languages. ( Nr. 349). Department of Computer Science, 2004
  • Hoßfeld, Tobias ; Staehle, Dirk: A Semi-Analytic Model of the UMTS Downlink Capacity with WWW Traffic on Dedicated Channels. ( Nr. 340). Department of Computer Science, 2004
  • Hoßfeld, Tobias ; Leibnitz, Kenji ; Pries, Rastin ; Tutschku, Kurt ; Tran-Gia, Phuoc ; Pawlikowski, Krysztof: Information Diffusion in eDonkey Filesharing Networks. ( Nr. 341). Department of Computer Science, 2004
  • Pries, Rastin ; Heck, Klaus: Performance Comparison of Handover Mechanisms in Wireless LAN Networks. ( Nr. 339). Department of Computer Science, 2004
  • Hoßfeld, Tobias ; Tutschku, Kurt ; Andersen, Frank-Uwe: Mapping of File-Sharing onto Mobile Environments: Feasibility and Performance of eDonkey with GPRS. ( Nr. 338). Department of Computer Science, 2004
  • Wagner, Klaus W.: New BCSV Theorem. ( Nr. 337). Department of Computer Science, 2004
  • Meister, D.: Membership problems for recurrent systems over the power set of the natural numbers. ( Nr. 336). Department of Computer Science, 2004
  • Travers, Stephen: The Complexity of Membership Problems for Circuits over Sets of Integers. ( Nr. 334). Department of Computer Science, 2004
  • Menth, Michael ; Martin, Ruediger: Network Resilience through Multi-Topology Routing. ( Nr. 335). Department of Computer Science, 2004
2003[ to top ]
  • Menth, Michael ; Kopf, Stefan ; Charzinski, Joachim: Impact of Network Topology on the Performance of Network Admission Control Methods. ( Nr. 308). Department of Computer Science, 2003
  • Menth, Michael ; Kopf, Stefan ; Charzinski, Joachim: Impact of Resilience Requirements on the Performance of Network Admission Control Methods. ( Nr. 309). Department of Computer Science, 2003
  • Köhler, Stefan ; Binzenhöfer, Andreas: MPLS Traffic Engineering in OSPF Networks - A combined Approach. ( Nr. 304). Department of Computer Science, 2003
  • Menth, Michael ; Kopf, Stefan ; Milbrandt, Jens: Impact of Traffic Matrix and Routing on the Performance of Network Admission Control Methods. ( Nr. 307). Department of Computer Science, 2003
  • Menth, Michael ; Gehrsitz, S. ; Milbrandt, Jens: Fair Assignment of Efficient Network Admission Control Budgets. ( Nr. 306). Department of Computer Science, 2003
  • Menth, Michael ; Kopf, St. ; Milbrandt, J.: A Performance Evaluation Framework for Network Admission Control Methods. ( Nr. 305). Department of Computer Science, 2003
  • Staehle, Dirk ; Mäder, Andreas: An Analytic Approximation of the Uplink Capacity in a UMTS Network with Heterogeneous Traffic. ( Nr. 310). Department of Computer Science, 2003
  • Böhler, Elmar ; Wagner, Klaus W.: Polynomial Time Generation Problems. ( Nr. 312). Department of Computer Science, 2003
  • Böhler, Elmar ; Glaßer, Christian ; Meister, D.: Small Bounded-Error Computations and Completeness. ( Nr. 311). Department of Computer Science, 2003
  • Selivanov, Victor L. ; Wagner, Klaus W.: A Reducibility for the Dot-Depth Hierarchy. ( Nr. 313). Department of Computer Science, 2003
2002[ to top ]
  • Staehle, Dirk ; Leibnitz, Kenji ; Heck, Klaus ; Schröder, Bernd ; Weller, Albert ; Tran-Gia, Phuoc: An Approximation of Othercell Interference Distributions for UMTS Systems using Fixed-Point Equations. ( Nr. 292). Department of Computer Science, 2002
  • Menth, Michael ; Rose, Oliver: Performance Tradeoffs for Header Compression in MPLS Networks. ( Nr. 291). Department of Computer Science, 2002
  • Böhler, Elmar ; Vollmer, Heribert: Boolean Functions and Post’s Lattice with Applications to Complexity Theory. ( Nr. 290). Department of Computer Science, 2002
  • Milbrandt, Jens ; Köhler, Stefan ; Staehle, Dirk ; Berry, L.: Decomposition of Large IP Networks for Routing Optimization. ( Nr. 293). Department of Computer Science, 2002
  • Heck, Klaus ; Staehle, Dirk ; Leibnitz, Kenji: Diversity Effects on the Soft Handover Gain in UMTS networks. ( Nr. 295). Department of Computer Science, 2002
  • Ebner, Marc: A Parallel Algorithm for Color Constancy. ( Nr. 296). Department of Computer Science, 2002
  • Menth, Michael ; Schmid, Matthias ; Heiß, Herbert ; Reim, Thomas: MEDF - A Simple Scheduling Algorithm for Two Real-Time Transport Service Classes with Application in the UTRAN. ( Nr. 294). Department of Computer Science, 2002
  • Menth, Michael ; Reifert, Andreas: CSPF Routed and Traffic-Driven Construction of LSP Hierarchies. ( Nr. 297). Department of Computer Science, 2002
  • Eichelberger, Holger: JTransform - A Java Source Code Transformation Framework. ( Nr. 303). Department of Computer Science, 2002
  • Meister, D.: Recognizing and computing minimal triangulations efficiently. ( Nr. 302). Department of Computer Science, 2002
  • Eichelberger, Holger: Evaluation-Report on the Layout Facilities of UML Tools. ( Nr. 298). Department of Computer Science, 2002
  • Obeth, Thomas ; Wolz, Frank ; Kolla, Reiner: Ein multiprozessorfähiger Prozessorcore auf FPGA-Basis. ( Nr. 301). Department of Computer Science, 2002
  • Becker, M. ; Heine, Chr. ; Herrler, R. ; Krempels, K.-H.: OntHoS - an Ontology for Hospital Scenarios. ( Nr. 300). Department of Computer Science, 2002
  • Böhler, Elmar ; Glaßer, Christian ; Meister, D.: Error-bounded probabilistic computations between MA and AM. ( Nr. 299). Department of Computer Science, 2002
2001[ to top ]
  • Leibnitz, Kenji ; Krauss, Armin: Performance Evaluation of Interference and Cell Loading in UMTS Networks. ( Nr. 268). Department of Computer Science, 2001
  • Menth, Michael: A Scalable Protocol Architecture for End-to-End Signaling and Resource Reservation in IP Networks. ( Nr. 278). Department of Computer Science, 2001
  • Galota, M. ; Vollmer, Heribert: A Generalization of the Büchi-Elgot-Trakhtenbrot Theorem. ( Nr. 271). Department of Computer Science, 2001
  • Reith, Steffen ; Vollmer, Heribert: Ist P=NP? Einführung in die Theorie der NP-Vollständigkeit. ( Nr. 269). Department of Computer Science, 2001
  • Lautemann, C. ; McKenzie, P. ; Schwentick, T. ; Vollmer, Heribert: The Descriptive Complexity Approach to LOGCFL. ( Nr. 273). Department of Computer Science, 2001
  • Eichelberger, Holger ; von Gudenberg, Jürgen Wolff: UMLscript Sprachspezifikation. ( Nr. 272). Department of Computer Science, 2001
  • Selivanov, Victor L.: Relating Automata-theoretic Hierarchies to Complexity-theoretic Hierarchies. ( Nr. 275). Department of Computer Science, 2001
  • Selivanov, Victor L.: Boolean Hierarchy of Partitions over Reducible Bases. ( Nr. 276). Department of Computer Science, 2001
  • Schwentick, T. ; Therien, D. ; Vollmer, Heribert: Partially-ordered Two-way Automata: A New Characterization of DA. ( Nr. 274). Department of Computer Science, 2001
  • Eichelberger, Holger ; Tischler, German ; von Gudenberg, Jürgen Wolff: Comprehensive Graphical Description of the STL. ( Nr. 270). Department of Computer Science, 2001
  • Kosub, Sven ; Vollmer, Heribert: 44. Workshop über Komplexitätstheorie, Datenstrukturen und Effiziente Algorithmen. ( Nr. 277). Department of Computer Science, 2001
  • Grigore, Adrian ; Heffner, Alexander ; Ebner, Marc ; Albert, Jürgen: Evolution virtueller Pflanzen. ( Nr. 280). Department of Computer Science, 2001
  • Menth, Michael ; Martin, Rüdiger: Performance Evaluation of the Extensions for Control Message Retransmissions in RSVP. ( Nr. 288). Department of Computer Science, 2001
  • Lerch, Michael ; Tischler, German ; von Gudenberg, Jürgen Wolff: filib++ -Interval Library and Reference Manual. ( Nr. 279). Department of Computer Science, 2001
  • Menth, Michael ; Hauck, N.: A Graph Theoretical Concept for LSP Hierarchies. ( Nr. 287). Department of Computer Science, 2001
  • Böhler, Elmar: On the Relative Complexity of Post’s Classes. ( Nr. 286). Department of Computer Science, 2001
  • Wolz, Frank ; Kolla, Reiner: Zu Routingflexibilität und Optimierung konfigurierbarer Multiplexer-Netzwerke. ( Nr. 289). Department of Computer Science, 2001
  • Hieß, S. ; Schäfer, D.: Taskbasierte Positionsverfolgung und Zielsuche autonomer mobiler Roboter. ( Nr. 285). Department of Computer Science, 2001
  • Staehle, Dirk ; Leibnitz, Kenji ; Tsipotis, K.: QoS of Internet Access with GPRS. ( Nr. 283). Department of Computer Science, 2001
  • Staehle, Dirk ; Leibnitz, Kenji ; Heck, Klaus ; Schröder, Bernd ; Weller, Albert ; Tran-Gia, Phuoc: Analytical Characterization of the Soft Handover Gain in UMTS. ( Nr. 284). Department of Computer Science, 2001
  • Böhler, Elmar ; Hemaspaandra, E. ; Reith, Steffen ; Vollmer, Heribert: Equivalence Problems for Boolean Constraint Satisfaction. ( Nr. 282). Department of Computer Science, 2001
  • Galota, M. ; Kosub, Sven ; Vollmer, Heribert: Generic Separations and Leaf Languages. ( Nr. 281). Department of Computer Science, 2001
2000[ to top ]
  • Glaßer, Christian: Consequences of the Existence of Sparse Sets Hard for NP under a Subclass of Truth-Table Reductions. ( Nr. 245). Department of Computer Science, 2000
  • Menth, Michael: Carrying Wireless Traffic over IP Using RTP Multiplexing. ( Nr. 247). Department of Computer Science, 2000
  • Vicari, Norbert ; Köhler, Stefan ; Charzinski, J.: The Dependence of Internet User Characteristics on Access Speed. ( Nr. 246). Department of Computer Science, 2000
  • McKenzie, P. ; Schwentick, T. ; Therien, D. ; Vollmer, Heribert: The Many Faces of a Translation. ( Nr. 248). Department of Computer Science, 2000
  • Wolz, Frank ; Kolla, Reiner: Discrete Floorplanning by Multidimensional Pattern Matching. ( Nr. 249). Department of Computer Science, 2000
  • Glaßer, Christian ; Schmitz, Heinz: Concatenation Hierarchies and Forbidden Patterns. ( Nr. 256). Department of Computer Science, 2000
  • Reith, Steffen ; Wagner, Klaus W.: The Complexity of Problems Defined by Boolean Circuits. ( Nr. 255). Department of Computer Science, 2000
  • Glaßer, Christian ; Reith, Steffen ; Vollmer, Heribert: The Complexity of Base Station Positioning in Cellular Networks. ( Nr. 252). Department of Computer Science, 2000
  • Dümmler, Mathias ; Rose, Oliver: Analysis of the Short Term Impact of Changes in Product Mix. ( Nr. 254). Department of Computer Science, 2000
  • Klügl, Franziska ; Puppe, Frank ; und H. Szczerbicka, P. Schwarz: Multiagentsystems and Individual-Based Simulation. ( Nr. 253). Department of Computer Science, 2000
  • Rose, Oliver ; Dümmler, Mathias ; Schömig, Alexander: On the Validity of Approximation Formulae for Machine Downtimes. ( Nr. 250). Department of Computer Science, 2000
  • Reith, Steffen ; Vollmer, Heribert: Optimal Satisfiability for Propositional Calculi and Constraint Satisfaction Problems. ( Nr. 251). Department of Computer Science, 2000
  • Menth, Michael: The Performance of Multiplexing Voice and Circuit Switched Data in UMTS over IP-Networks. ( Nr. 263). Department of Computer Science, 2000
  • Kosub, Sven: Types of Separability. ( Nr. 267). Department of Computer Science, 2000
  • Kosub, Sven: Boolean Partitions and Projective Closure. ( Nr. 266). Department of Computer Science, 2000
  • von Gudenberg, Jürgen Wolff: Multimedia Architectures and Interval Arithmetic. ( Nr. 265). Department of Computer Science, 2000
  • Galota, M. ; Glaßer, Christian ; Reith, Steffen ; Vollmer, Heribert: A Polynomial-Time Approximation Scheme for Base Station Positioning in UMTS Networks. ( Nr. 264). Department of Computer Science, 2000
  • Kosub, Sven: On NP-Partitions over Posets with an Application to Reducing the Set of Solutions of NP Problems. ( Nr. 257). Department of Computer Science, 2000
  • Berry, L. ; Köhler, Stefan ; Staehle, Dirk ; Tran-Gia, Phuoc: Fast heuristics for optimal routing in large IP networks. ( Nr. 262). Department of Computer Science, 2000
  • Köhler, Stefan ; Menth, Michael ; Vicari, Norbert: Analytic Performance Evaluation of the RED Algorithm for QoS in TCP/IP Networks. ( Nr. 259). Department of Computer Science, 2000
  • Staehle, Dirk ; Köhler, Stefan ; Kohlhaas, U.: Towards an optimization of the routing parameters for IP networks. ( Nr. 258). Department of Computer Science, 2000
  • Klügl, Franziska: Visuelles Programmieren als Basis einer Modellierumgebung: Eigenschaften, Konzepte, Anforderungen. ( Nr. 260). Department of Computer Science, 2000
  • Staehle, Dirk ; Leibnitz, Kenji ; Tran-Gia, Phuoc: Source Traffic Modeling of Wireless Applications. ( Nr. 261). Department of Computer Science, 2000
1999[ to top ]
  • Peichl, T. ; Vollmer, Heribert: Finite Automata with Generalized Acceptance Criteria. ( Nr. 221). Department of Computer Science, 1999
  • Dümmler, Mathias: Using Simulation and Genetic Algorithms to Improve Cluster Tool Performance. ( Nr. 227). Department of Computer Science, 1999
  • Schmitz, Heinz: Generalized Deterministic Languages and their Automata: A Characterization of Restricted Temporal Logic. ( Nr. 226). Department of Computer Science, 1999
  • Ehrenberger, U. ; Leibnitz, Kenji: Impact of Clustered Traffic Distributions in CDMA Radio Network Planning. ( Nr. 223). Department of Computer Science, 1999
  • Vollmer, Heribert: Was leistet die Komplexitätstheorie für die Praxis? ( Nr. 224). Department of Computer Science, 1999
  • Schmitz, Heinz: Some Forbidden Patterns in Automata for Dot-Depth One Languages. ( Nr. 220). Department of Computer Science, 1999
  • Reith, Steffen ; Wagner, Klaus W.: The Complexity of Problems Defined by Subclasses of Boolean Functions. ( Nr. 218). Department of Computer Science, 1999
  • Vollmer, Heribert: Uniform Characterizations of Complexity Classes. ( Nr. 222). Department of Computer Science, 1999
  • Glaßer, Christian ; Wechsung, G.: Relativizing Function Classes. ( Nr. 219). Department of Computer Science, 1999
  • Kolla, Reiner ; Vodopivec, A. ; von Gudenberg, Jürgen Wolff: The IAX Architecture: Interval Arithmetic Extension. ( Nr. 225). Department of Computer Science, 1999
  • Harris, Richard ; Köhler, Stefan: Possibilities for QoS in Existing Internet Routing Protocols. ( Nr. 228). Department of Computer Science, 1999
  • Heister, Frank ; Müller, Rainer: An approach for the identification of nonlinear, dynamic processes with Kalman Filter-trained recurrent neural structures. ( Nr. 229). Department of Computer Science, 1999
  • Glaßer, Christian: The Boolean Hierarchy over Dot-Depth 1/2. ( Nr. 230). Department of Computer Science, 1999
  • Dümmler, Mathias ; Vicari, Norbert: A Numerical Analysis of the M/D^b/N Queueing System. ( Nr. 235). Department of Computer Science, 1999
  • Ebert, T. ; Vollmer, Heribert: On the Autoreducibility of Random Sequences. ( Nr. 239). Department of Computer Science, 1999
  • Kluge, B. ; Schäfer, D.: Featurebasierte Lokalisation eines autonomen mobilen Roboters - Experimentelle Fallstudie. ( Nr. 244). Department of Computer Science, 1999
  • Glaßer, Christian ; Schmitz, Heinz: Languages of Dot-Depth 3/2. ( Nr. 243). Department of Computer Science, 1999
  • Hertrampf, Ulrich ; Reith, Steffen ; Vollmer, Heribert: A note on closure properties of logspace MOD classes. ( Nr. 241). Department of Computer Science, 1999
  • Schmitz, Heinz: Boolean Hierarchies inside Dot-Depth One. ( Nr. 240). Department of Computer Science, 1999
  • Vicari, Norbert ; Köhler, Stefan: Measuring Internet User Traffic Behavior Dependent on Access Speed. ( Nr. 238). Department of Computer Science, 1999
  • McKenzie, P. ; Vollmer, Heribert ; Wagner, Klaus W.: Arithmetic Circuits and Polynomial Replacement Systems. ( Nr. 242). Department of Computer Science, 1999
  • Köhler, Stefan ; Schäfer, Uwe: Performance Comparison of different Class-and-Drop treatment of Data and Acknowledgements in DiffServ IP Networks. ( Nr. 237). Department of Computer Science, 1999
  • Dümmler, Mathias: Simulation und Leistungsbewertung von Cluster Tools in der Halbleiterfertigung. ( Nr. 231). Department of Computer Science, 1999
  • Kluge, B. ; Schäfer, D.: Featurebasierte Lokalisation eines autonomen mobilen Roboters. ( Nr. 234). Department of Computer Science, 1999
  • Kosub, Sven ; Wagner, Klaus W.: The Boolean Hierarchy of Partitions. ( Nr. 233). Department of Computer Science, 1999
  • Glaßer, Christian ; Reith, Steffen ; Vollmer, Heribert: Approximation Algorithms for Cellular Network Optimization. ( Nr. 232). Department of Computer Science, 1999
  • Buck, M. ; Noltemeier, Hartmut ; Schäfer, D.: Practical Strategies for Hypotheses Elimination on the Self-Localization Problem. ( Nr. 236). Department of Computer Science, 1999
1998[ to top ]
  • Glaßer, Christian: Klassifizierung der Nicht-Approximierbarkeit eines Basisstationsproblems mit Interferenzen. ( Nr. 197). Department of Computer Science, 1998
  • Schmitz, Heinz ; Wagner, Klaus W.: The Boolean Hierarchy over Level 1/2 of the Straubing-Therien Hierarchy. ( Nr. 201). Department of Computer Science, 1998
  • Gerlich, Notker ; Menth, Michael: The Performance of AAL-2 Carrying CDMA Voice Traffic. ( Nr. 199). Department of Computer Science, 1998
  • Vicari, Norbert: Models of WWW-Traffic: a Comparison of Pareto and Logarithmic Histogram Models. ( Nr. 198). Department of Computer Science, 1998
  • Reith, Steffen ; Vollmer, Heribert: The Complexity of Computing Optimal Assignments of Generalized Propositional Formulae. ( Nr. 196). Department of Computer Science, 1998
  • Bamberger, S.K. ; Schwingeler, S. ; Ziegler, S.: KBA-D3: Ein wissensbasiertes Diagnose- und Informationssystem für Druckmaschinen. ( Nr. 194). Department of Computer Science, 1998
  • Reith, Steffen ; Wagner, Klaus W.: On Boolean Lowness and Boolean Highness. ( Nr. 195). Department of Computer Science, 1998
  • Tran-Gia, Phuoc ; Jain, N. ; Leibnitz, Kenji: Code Division Multiple Access wireless network planning considering clustered spatial customer traffic. ( Nr. 192). Department of Computer Science, 1998
  • Leibnitz, Kenji ; Tran-Gia, Phuoc ; Miller, J.E.: Analysis of the Dynamics of CDMA Reverse Link Power Control. ( Nr. 193). Department of Computer Science, 1998
  • Reith, Steffen ; Wagner, Klaus W.: On High and Low Sets for the Boolean Hierarchy. ( Nr. 191). Department of Computer Science, 1998
  • Ritter, Michael: Discrete-Time Modeling of the Frame-Based Generic Cell Rate Algorithm. ( Nr. 190). Department of Computer Science, 1998
  • Nöth, Winfried ; Kolla, Reiner: Spanning Tree Based State Encoding for Low Power Dissipation. ( Nr. 200). Department of Computer Science, 1998
  • Rose, Oliver: WIP Evolution of a Semiconductor Factory After a Bottleneck Workcenter Breakdown. ( Nr. 203). Department of Computer Science, 1998
  • Kosub, Sven: Persistent Computations. ( Nr. 217). Department of Computer Science, 1998
  • Steffan, J. ; Wirth, H.-C.: ANDI - Approximation Algorithms for Network Design and Network Improvement. ( Nr. 202). Department of Computer Science, 1998
  • Remiche, M.-A. ; Leibnitz, Kenji: Adaptive Soft-Handoff Thresholds for CDMA Systems with Spatial Traffic. ( Nr. 212). Department of Computer Science, 1998
  • Rose, Oliver: Interdeparture Time Correlations of the Discrete-time GI/GI/1 Queue. ( Nr. 204). Department of Computer Science, 1998
  • Dümmler, Mathias ; Schömig, Alexander: Using Discrete-time Analysis in the Performance Evaluation of Manufacturing. ( Nr. 215). Department of Computer Science, 1998
  • Gerlich, Notker ; Menth, Michael: A Numerical Framework for Solving Discrete Markov Models Applied to the AAL-2 Protocol. ( Nr. 211). Department of Computer Science, 1998
  • Duckstein, Franz ; Kolla, Reiner: Ray Tracing Of Parametric Surfaces Based On Adaptive Simplicial Complexes. ( Nr. 213). Department of Computer Science, 1998
  • Vicari, Norbert: Effects of Variations in the Available Bandwidth on the Performance of the GFR Service. ( Nr. 214). Department of Computer Science, 1998
  • Glaßer, Christian: A Normalform for Classes of Concatenation Hierarchies. ( Nr. 216). Department of Computer Science, 1998
  • Dümmler, Mathias: Analysis of the departure process of a batch server queueing system. ( Nr. 210). Department of Computer Science, 1998
  • Glaßer, Christian: On the approximability of problems for cellular networks. ( Nr. 208). Department of Computer Science, 1998
  • Vicari, Norbert ; Schedel, R.: Performance of the GFR-Service with Constant Available Bandwidth. ( Nr. 207). Department of Computer Science, 1998
  • Jodl, W. ; Heuler, M. ; Rothaug, U. ; Leibnitz, Kenji: Einsatz von topologieerhaltenden neuronalen Netzen zur Interpretation von Leiterplattendaten. ( Nr. 206). Department of Computer Science, 1998
  • Galota, M.: Blattsprachen und endliche Automaten. ( Nr. 205). Department of Computer Science, 1998
  • Vollmer, Heribert: A Generalized Quantifier Concept in Computational Complexity Theory. ( Nr. 209). Department of Computer Science, 1998
1997[ to top ]
  • Nöth, Winfried ; Kolla, Reiner: Node Normalization and Decomposition in Low Power Technology Mapping. ( Nr. 166). Department of Computer Science, 1997
  • Ritter, Michael: A Decomposition Approach for User-Network Interface Modeling in ATM Networks. ( Nr. 169). Department of Computer Science, 1997
  • Vicari, Norbert: Resource-Based Charging of ATM Connections. ( Nr. 170). Department of Computer Science, 1997
  • Tutschku, Kurt ; Leskien, T. ; Tran-Gia, Phuoc: Traffic estimation and characterization for the design of mobile communication networks. ( Nr. 171). Department of Computer Science, 1997
  • Wastl, R.: Tableau Methods for Computing Stable Models and Query Answering in Disjunctive Deductive Databases. ( Nr. 167). Department of Computer Science, 1997
  • Bartelsen, S. ; Mittler, Manfred: A Bernoulli Feedback Queue with Batch Service. ( Nr. 168). Department of Computer Science, 1997
  • Dümmler, Mathias ; Schömig, Alexander: Discrete-time Analysis of Batch Servers with Bounded Idle Time and Two Job Classes. ( Nr. 162). Department of Computer Science, 1997
  • Hinsberger, Uwe ; Kolla, Reiner ; Wild, Markus: A parallel hybrid approach to hard optimization problems. ( Nr. 163). Department of Computer Science, 1997
  • Gerlich, Notker: On the Spatial Multiplexing Gain of SDMA for Wireless Local Loop Access. ( Nr. 161). Department of Computer Science, 1997
  • Wastl, R.: Unfolding in Disjunctive Deductive Databases with respect to 3-Valued Stable Models. ( Nr. 165). Department of Computer Science, 1997
  • Hafner, U. ; Frank, S.W.M. ; Unger, M. ; Albert, Jürgen: Hybrid Weighted Finite Automata for image and video compression. ( Nr. 160). Department of Computer Science, 1997
  • Ritter, Michael: Analysis of a Queueing Model with Delayed Feedback and its Application to the ABR Flow Control. ( Nr. 164). Department of Computer Science, 1997
  • Bartelsen, S. ; Mittler, Manfred ; Rose, Oliver: Approximate Flow Time Distribution of a Queue with Batch Service. ( Nr. 174). Department of Computer Science, 1997
  • Kosub, Sven: On Cluster Machines and Function Classes. ( Nr. 172). Department of Computer Science, 1997
  • Hinsberger, Uwe ; Kolla, Reiner: TEMPLATE: a generic TEchnology Mapping PLATform. ( Nr. 186). Department of Computer Science, 1997
  • Wagner, Klaus W.: A Note on Parallel Queries and the Difference Hierarchy. ( Nr. 173). Department of Computer Science, 1997
  • Kunjan, T. ; Hinsberger, Uwe ; Kolla, Reiner: Approximative Representation of boolean Functions by size controllable ROBDD’s. ( Nr. 182). Department of Computer Science, 1997
  • Gerlich, Notker ; Ritter, Michael: Carrying CDMA Traffic over ATM Using AAL-2: A Performance Study. ( Nr. 188). Department of Computer Science, 1997
  • Duckstein, Franz ; Kolla, Reiner: Gültigkeitsmetriken für animierte gerenderte Szenen in der Echtzeitcomputergraphik. ( Nr. 175). Department of Computer Science, 1997
  • Gerlich, Notker: The Performance of Base Station Interconnection Alternatives in CDMA Networks. ( Nr. 189). Department of Computer Science, 1997
  • Seemann, Jochen ; von Gudenberg, Jürgen Wolff: OMT-Script - eine Programmiersprache für objektorientierten Entwurf. ( Nr. 187). Department of Computer Science, 1997
  • Vicari, Norbert: Measurement and Modeling of WWW-Sessions. ( Nr. 184). Department of Computer Science, 1997
  • Hinsberger, Uwe ; Kolla, Reiner: Matching a Boolean Function against a Set of Functions. ( Nr. 185). Department of Computer Science, 1997
  • von Gudenberg, Jürgen Wolff: Objektorientierte Programmierung im wissenschaftlichen Rechnen. ( Nr. 181). Department of Computer Science, 1997
  • Wahler, S. ; Schoemig, Alexander ; Rose, Oliver: Implementierung und Test neuartiger Zufallszahlengeneratoren. ( Nr. 180). Department of Computer Science, 1997
  • Baier, Herbert ; Wagner, Klaus W.: Bounding Queries in the Analytic Polynomial-Time Hierarchy. ( Nr. 178). Department of Computer Science, 1997
  • Vollmer, Heribert: Relating Polynomial Time to Constant Depth. ( Nr. 179). Department of Computer Science, 1997
  • Tutschku, Kurt: Demand-based Radio Network Planning of Cellular Mobile Communication Systems. ( Nr. 177). Department of Computer Science, 1997
  • Rose, Oliver: A Memory Markov Chain Model For VBR Traffic With Strong Positive Correlations. ( Nr. 176). Department of Computer Science, 1997
  • Kosub, Sven ; Schmitz, Heinz ; Vollmer, Heribert: Uniformly Defining Complexity Classes of Functions. ( Nr. 183). Department of Computer Science, 1997
1996[ to top ]
  • Vollmer, Heribert: A Note on the Power of Quasipolynomial Size Circuits. ( Nr. 140). Department of Computer Science, 1996
  • Mandjes, M. ; Tutschku, Kurt: Efficient call handling procedures in cellular mobile networks. ( Nr. 144). Department of Computer Science, 1996
  • Gerlich, Notker ; Tran-Gia, Phuoc ; Elsayed, K.: Performance Analysis of Link Carrying Capacity in CDMA Systems. ( Nr. 145). Department of Computer Science, 1996
  • Leibnitz, Kenji ; Tutschku, Kurt ; Rothaug, U.: Künstliche Neuronale Netze für die Wegoptimierung in ATG Leiterplattentestern. ( Nr. 146). Department of Computer Science, 1996
  • Karch, O.: A Sharper Complexity Bound for the Robot Localization Problem. ( Nr. 139). Department of Computer Science, 1996
  • Ritter, Michael: Analysis of a Rate-Based Control Policy with Delayed Feedback and Variable Bandwidth Availability. ( Nr. 133). Department of Computer Science, 1996
  • Luo, Y.: Distributed Implementation of PROLOG on Workstation Clusters. ( Nr. 136). Department of Computer Science, 1996
  • Rose, Oliver: Estimation of the Hurst Parameter of Long-Range Dependent Time Series. ( Nr. 137). Department of Computer Science, 1996
  • Albert, Jürgen ; Räther, F. ; Patzner, K. ; Schoof, Jochen ; Zimmer, J.: Concepts For Optimizing Sinter Processes Using Evolutionary Algorithms. ( Nr. 138). Department of Computer Science, 1996
  • Verbarg, K. ; Hensel, A.: Hierarchical Motion Planning Using a Spatial Index. ( Nr. 135). Department of Computer Science, 1996
  • Tutschku, Kurt ; Leibnitz, Kenji: Fast Ray-Tracing for Field Strength Prediction in Cellular Mobile Network Planning. ( Nr. 134). Department of Computer Science, 1996
  • Tran-Gia, Phuoc ; Gerlich, Notker: Impact of Customer Clustering on Mobile Network Performance. ( Nr. 143). Department of Computer Science, 1996
  • Tran-Gia, Phuoc ; Mandjes, M.: Modeling of customer retrial phenomenon in cellular mobile networks. ( Nr. 142). Department of Computer Science, 1996
  • Mittler, Manfred: Two-Moment Analysis of Alternative Tool Models with Random Breakdowns. ( Nr. 141). Department of Computer Science, 1996
  • Niemann, G.: On Weakly Growing Grammars. ( Nr. 155). Department of Computer Science, 1996
  • Ritter, Michael: Congestion Detection Methods and their Impact on the Performance of the ABR Flow Control Mechanism. ( Nr. 147). Department of Computer Science, 1996
  • Baier, Herbert: On the Approximability of the Selection Problem. ( Nr. 159). Department of Computer Science, 1996
  • Wastl, R.: Lifting the Well-Founded Semantics to Disjunctive, Normal Databases. ( Nr. 157). Department of Computer Science, 1996
  • Vollmer, Heribert: Succinct Inputs, Lindström Quantifiers, and a General Complexity Theoretic Operator Concept. ( Nr. 158). Department of Computer Science, 1996
  • Wastl, R.: A Unified Semantical Framework for Deductive Databases. ( Nr. 153). Department of Computer Science, 1996
  • Nöth, Winfried ; Hinsberger, Uwe ; Kolla, Reiner: TROY - A Tree Oriented Approach to Logic Synthesis and Technology Mapping. ( Nr. 156). Department of Computer Science, 1996
  • Noltemeier, Hartmut ; Krumke, S.O.: 30. Workshop Komplexitätstheorie, Datenstrukturen und effiziente Algorithmen. ( Nr. 152). Department of Computer Science, 1996
  • Wastl, R.: A Vectorial Well-Founded Semantics for Disjunctive, Deductive Databases. ( Nr. 154). Department of Computer Science, 1996
  • Rose, Oliver: Discrete-time Analysis of a Finite Buffer with VBR MPEG Video Traffic Input. ( Nr. 150). Department of Computer Science, 1996
  • Vollmer, Heribert ; Wagner, Klaus W.: Measure One Results in Computational Complexity Theory. ( Nr. 149). Department of Computer Science, 1996
  • Vicari, Norbert ; Tran-Gia, Phuoc: A Numerical Analysis of the Geo/D/N Queueing System. ( Nr. 151). Department of Computer Science, 1996
  • Baier, Herbert ; Wagner, Klaus W.: The Analytic Polynomial Time Hierarchy. ( Nr. 148). Department of Computer Science, 1996
1995[ to top ]
  • Schömig, Alexander ; Kahnt, M.: Vergleich zweier Analysemethoden zur Leistungsbewertung von Kanban Systemen. ( Nr. 105). Department of Computer Science, 1995
  • Mittler, Manfred ; Gerlich, Notker ; Schömig, Alexander: Reducing the Variance of Cycle Times in Semiconductor Manufacturing Systems. ( Nr. 109). Department of Computer Science, 1995
  • Puppe, Frank ; Daniel, M. ; Seidel, G.: Qualifizierende Arbeitsgestaltung mit tutoriellen Expertensystemen für technische Diagnoseaufgaben. ( Nr. 111). Department of Computer Science, 1995
  • Schömig, Alexander ; Kahnt, M.: A note on the Application of Marie’s Method for Queueing Networks with Batch Servers. ( Nr. 110). Department of Computer Science, 1995
  • Schömig, Alexander ; Kahnt, M.: Performance Modelling of Pull Manufacturing Systems with Batch Servers and Assembly-like Structure. ( Nr. 108). Department of Computer Science, 1995
  • Mittler, Manfred ; Purm, M. ; Gihr, O.: Set Management: Synchronization of Prefabricated Parts before Assembly. ( Nr. 106). Department of Computer Science, 1995
  • Schömig, Alexander ; Mittler, Manfred: Autocorrelation of Cycle Times in Semiconductor Manufacturing Systems. ( Nr. 107). Department of Computer Science, 1995
  • Rose, Oliver ; Ritter, Michael: A New Approach for the Dimensioning of Policing Functions for MPEG-Video Sources in ATM-Systems. ( Nr. 97). Department of Computer Science, 1995
  • Gerlich, Notker ; Tangemann, Michael: Towards a Channel Allocation Scheme for SDMA-based Mobile Communication Systems. ( Nr. 104). Department of Computer Science, 1995
  • Rooß, D. ; Wagner, Klaus W.: On the Power of Bio-Computers. ( Nr. 103). Department of Computer Science, 1995
  • Mittler, Manfred ; Müller, R.: Moment Approximation in Product Form Queueing Networks. ( Nr. 102). Department of Computer Science, 1995
  • Dabs, T. ; Schoof, Jochen: A Graphical User Interface For Genetic Algorithms. ( Nr. 98). Department of Computer Science, 1995
  • Buntrock, Gerhard ; Niemann, G.: Weak Growing Context-Sensitive Grammars. ( Nr. 112). Department of Computer Science, 1995
  • Rose, Oliver: Statistical Properties of MPEG Video Traffic and their Impact on Traffic Modeling in ATM Systems. ( Nr. 101). Department of Computer Science, 1995
  • Frater, M.R. ; Rose, Oliver: Cell Loss Analysis of Broadband Switching Systems Carrying VBR Video. ( Nr. 99). Department of Computer Science, 1995
  • Hertrampf, Ulrich ; Vollmer, Heribert ; Wagner, Klaus W.: On the Power of Number-Theoretic Operations with Respect to Counting. ( Nr. 100). Department of Computer Science, 1995
  • Verbarg, K.: Approximate Center Points in Dense Point Sets. ( Nr. 117). Department of Computer Science, 1995
  • Krumke, S.O. ; Valenta, J.: Finding Tree-2-Spanners. ( Nr. 131). Department of Computer Science, 1995
  • Garcia, J. ; Ritter, Michael: Determination of Traffic Parameters for VPs Carrying Delay-Sensitive Traffic. ( Nr. 113). Department of Computer Science, 1995
  • Mittler, Manfred ; Gerlich, Notker ; Schömig, Alexander: On Cycle Times and Interdeparture Times in Semiconductor Manufacturing. ( Nr. 124). Department of Computer Science, 1995
  • Ritter, Michael: Steady-State Analysis of the Rate-Based Congestion Control Mechanism for ABR Services in ATM Networks. ( Nr. 114). Department of Computer Science, 1995
  • Wolfrath, M.: Results on Fat Objects with a Low Intersection Proportion. ( Nr. 130). Department of Computer Science, 1995
  • Gerlich, Notker: A Toolkit of Octave Functions for Discrete-Time Analysis of Queuing Systems. ( Nr. 128). Department of Computer Science, 1995
  • Ritter, Michael: Network Buffer Requirements of the Rate-Based Control Mechanism for ABR Services. ( Nr. 129). Department of Computer Science, 1995
  • Mittler, Manfred ; Ono-Tesfaye, T. ; Schömig, Alexander: On the Approximation of Higher Moments in Open and Closed Fork/Join Primitives with Limited Buffers. ( Nr. 126). Department of Computer Science, 1995
  • Mittler, Manfred ; Kern, Christoph: Discrete-Time Approximation of the Machine Repairman Model with Generally Distributed Failure, Repair, and Walking Times. ( Nr. 127). Department of Computer Science, 1995
  • von Gudenberg, Jürgen Wolff: Hardware Support for Interval Arithmetic - Extended Version. ( Nr. 125). Department of Computer Science, 1995
  • Hafner, U.: Asymmetric Coding in (m)-WFA Image Compression. ( Nr. 132). Department of Computer Science, 1995
  • Book, R.V. ; Vollmer, Heribert ; Wagner, Klaus W.: On Type-2 Probabilistic Quantifiers. ( Nr. 123). Department of Computer Science, 1995
  • Rhein-Desel, U.: Eine ¨Übersicht¨ über medizinische Informationssysteme: Krankenhausinformationssysteme, Patientenaktensysteme und Kritiksysteme. ( Nr. 119). Department of Computer Science, 1995
  • Schömig, Alexander: On Transfer Blocking and Minimal Blocking in Serial Manufacturing Systems - The Impact of Buffer Allocation. ( Nr. 121). Department of Computer Science, 1995
  • Rose, Oliver: Simple and Efficient Models for Variable Bit Rate MPEG Video Traffic. ( Nr. 120). Department of Computer Science, 1995
  • Tutschku, Kurt: Recurrent Multilayer Perceptrons for Identification and Control: The Road to Applications. ( Nr. 118). Department of Computer Science, 1995
  • Graefe, Holger: Konzepte für ein zuverlässiges Message-Passing-System auf der Basis von UDP. ( Nr. 115). Department of Computer Science, 1995
  • Schömig, Alexander ; Rau, H.: A Petri Net Approach for the Performance Analysis of Business Processes. ( Nr. 116). Department of Computer Science, 1995
  • Fritsch, Thomas ; Tutschku, Kurt ; Leibnitz, Kenji: Field Strength Prediction by Ray-Tracing for Adaptive Base Station Positioning in Mobile Communication Networks. ( Nr. 122). Department of Computer Science, 1995
1994[ to top ]
  • Rose, Oliver: Approximate Analysis of an ATM Multiplexer with MPEG Video Input. ( Nr. 79). Department of Computer Science, 1994
  • Hertrampf, Ulrich ; Vollmer, Heribert ; Wagner, Klaus W.: On Balanced vs. Unbalanced Computation Trees. ( Nr. 82). Department of Computer Science, 1994
  • Ritter, Michael ; Kornprobst, S. ; Hübner, Frank: Performance Analysis of Source Policing Architectures in ATM Systems. ( Nr. 81). Department of Computer Science, 1994
  • Schömig, Alexander: Using Kanban in a Semiconductor Fabrication Environment - a Simulation Study. ( Nr. 80). Department of Computer Science, 1994
  • Cronauer, K.: A Criterion to Separate Complexity Classes by Oracles. ( Nr. 76). Department of Computer Science, 1994
  • Poeck, K. ; Fensel, D. ; Landes, D. ; Angele, J.: Combining KARL and Configurable Role Limiting Methods for Configuring Elevator Systems. ( Nr. 78). Department of Computer Science, 1994
  • Ritter, Michael: Analysis of the Generic Cell Rate Algorithm Monitoring ON/OFF-Traffic. ( Nr. 77). Department of Computer Science, 1994
  • Hübner, Frank: Output Process Analysis of the Peak Cell Rate Monitor Algorithm. ( Nr. 75). Department of Computer Science, 1994
  • Hertrampf, Ulrich: Complexity Classes Defined via k-valued Functions. ( Nr. 84). Department of Computer Science, 1994
  • Mittler, Manfred ; Schömig, Alexander: Entwicklung von ¨Due-Date¨-Warteschlangendisziplinen zur Optimierung von Produktionssystemen. ( Nr. 83). Department of Computer Science, 1994
  • Hertrampf, Ulrich: On Simple Closure Properties of #P. ( Nr. 90). Department of Computer Science, 1994
  • Hertrampf, Ulrich: Locally Definable Acceptance: Closure Properties, Associativity, Finiteness. ( Nr. 85). Department of Computer Science, 1994
  • Mittler, Manfred ; Müller, R.: Sojourn Time Distribution of the Asymmetric M/M/1//N - System with LCFS-PR Service. ( Nr. 94). Department of Computer Science, 1994
  • Beaudry, M.: Recognition of Nonregular Languages by Finite Groupoids. ( Nr. 96). Department of Computer Science, 1994
  • Rose, Oliver ; Frater, M.R.: Delivery of MPEG Video Services over ATM . ( Nr. 86). Department of Computer Science, 1994
  • Ritter, Michael: Performance Analysis of the Dual Cell Spacer in ATM Systems. ( Nr. 95). Department of Computer Science, 1994
  • Vollmer, Heribert ; Wagner, Klaus W.: Recursion Theoretic Characterizations of Complexity Classes of Counting Functions. ( Nr. 91). Department of Computer Science, 1994
  • Nöth, Winfried ; Kolla, Reiner: Optimal Synthesis of Fanoutfree Functions. ( Nr. 93). Department of Computer Science, 1994
  • Hinsberger, Uwe ; Kolla, Reiner: Optimal Technology Mapping for Single Output Cells. ( Nr. 92). Department of Computer Science, 1994
  • Hertrampf, Ulrich: Finite Acceptance Type Classes. ( Nr. 89). Department of Computer Science, 1994
  • Rothaug, U. ; Yanenko, E. ; Leibnitz, Kenji: Artificial Neural Networks Used for Way Optimization in Multi-Head Systems in Application to Electrical Flying Probe Testers. ( Nr. 88). Department of Computer Science, 1994
  • Reinhardt, B.: Kritik von Symptomerkennung in einem Hypertext-Dokument. ( Nr. 87). Department of Computer Science, 1994
1993[ to top ]
  • Öhring, S. ; Das, S.K.: Mapping Dynamic Data and Algorithm Structures on Product Networks. ( Nr. 65). Department of Computer Science, 1993
  • Vollmer, Heribert ; Wagner, Klaus W.: The complexity of finding middle elements. ( Nr. 53). Department of Computer Science, 1993
  • Gihr, O. ; Gold, Hermann ; Heilmann, S.: Analysis of machine breakdown models. ( Nr. 54). Department of Computer Science, 1993
  • Öhring, S.: Optimal dynamic embeddings of arbitrary trees in de Bruijn networks. ( Nr. 55). Department of Computer Science, 1993
  • Hübner, Frank: Dimensioning of a peak cell rate monitor algorithm using discrete-time analysis. ( Nr. 59). Department of Computer Science, 1993
  • Albert, Jürgen ; Duckstein, Franz ; Lautner, M. ; Menzel, Bernd: Message-passing auf transputer-systemen. ( Nr. 57). Department of Computer Science, 1993
  • Stock, Thomas ; Tran-Gia, Phuoc: Basic concepts and performance of high-speed protocols. ( Nr. 58). Department of Computer Science, 1993
  • Gold, Hermann ; Frötschl, Bernhard: Performance analysis of a batch service system working with a combined push/pull control. ( Nr. 61). Department of Computer Science, 1993
  • Vollmer, Heribert: On different reducibility notions for function classes. ( Nr. 62). Department of Computer Science, 1993
  • Buntrock, Gerhard ; Lorys, K.: The variable membership problem: Succinctness versus complexity. ( Nr. 60). Department of Computer Science, 1993
  • Mittler, Manfred: Analysis of two finite queues coupled by a triggering scheduler. ( Nr. 56). Department of Computer Science, 1993
  • Öhring, S. ; Das, S.K.: Incomplete Hypercubes: Embeddings of Tree-Related Networks. ( Nr. 64). Department of Computer Science, 1993
  • Rose, Oliver ; Frater, M.R.: A Comparison of Models for VBR Video Traffic Sources in B-ISDN. ( Nr. 72). Department of Computer Science, 1993
  • Tran-Gia, Phuoc: Discrete-Time Analysis Technique and Application to Usage Parameter Control Modelling in ATM Systems. ( Nr. 74). Department of Computer Science, 1993
  • Mittler, Manfred ; Gerlich, Notker: Reducing the Variance of Sojourn Times in Queueing Networks with Overtaking. ( Nr. 73). Department of Computer Science, 1993
  • Öhring, S. ; Das, S.K.: Optimal Communication Primitives on the Folded Petersen Networks. ( Nr. 71). Department of Computer Science, 1993
  • Öhring, S. ; Das, S.K.: Folded Petersen Cube Networks: New Competitors for the Hyepercubes. ( Nr. 63). Department of Computer Science, 1993
  • Öhring, S. ; Das, S.K.: Embeddings of Tree-Related Topologies in Hyper Petersen Networks. ( Nr. 70). Department of Computer Science, 1993
  • Buntrock, Gerhard: Growing Context-Sensitive Languages and Automata. ( Nr. 69). Department of Computer Science, 1993
  • Frisch, M. ; Jucht, K.: Pascalli-P. ( Nr. 68). Department of Computer Science, 1993
  • Dittmann, Rainer ; Hübner, Frank: Discrete-Time Analysis of a Cyclic Service System with Gated Limited Service. ( Nr. 67). Department of Computer Science, 1993
  • Hübner, Frank ; Tran-Gia, Phuoc: A Discrete-Time Analysis of Cell Spacing in ATM Systems. ( Nr. 66). Department of Computer Science, 1993
1992[ to top ]
  • Buntrock, Gerhard ; Lorys, K.: On growing context-sensitive languages. ( Nr. 38). Department of Computer Science, 1992
  • Wagner, Klaus W.: Alternating machines using partially defined ``AND’’ and ``OR’’ . ( Nr. 39). Department of Computer Science, 1992
  • Hübner, Frank ; Tran-Gia, Phuoc: An analysis of multi-service systems with trunk reservation mechanisms. ( Nr. 40). Department of Computer Science, 1992
  • Huckenbeck, Ulrich: Cost-bounded paths in networks of pipes with valves. ( Nr. 42). Department of Computer Science, 1992
  • Huckenbeck, Ulrich: On a generalization of the bellman-ford-algorithm for acyclic graphs. ( Nr. 41). Department of Computer Science, 1992
  • Hübner, Frank: Autocorrelation and power density spectrum of ATM multiplexer output processes. ( Nr. 43). Department of Computer Science, 1992
  • Hübner, Frank ; Ritter, Michael: Multi-service broadband systems with CBR and VBR input traffic. ( Nr. 44). Department of Computer Science, 1992
  • Mittler, Manfred ; Tran-Gia, Phuoc: Performance of a neural net scheduler used in packet switching interconnection networks. ( Nr. 45). Department of Computer Science, 1992
  • Kowaluk, M. ; Wagner, Klaus W.: Vector language: Simple description of hard instances. ( Nr. 46). Department of Computer Science, 1992
  • Öhring, S.: On dynamic and modular embeddings into hyper de Bruijn networks. ( Nr. 49). Department of Computer Science, 1992
  • Menzel, Bernd ; von Gudenberg, Jürgen Wolff: Kommentierte Syntaxdiagramme für C++. ( Nr. 47). Department of Computer Science, 1992
  • Emme, D.: A kernel for function definable classes and its relations to lowness. ( Nr. 48). Department of Computer Science, 1992
  • Poeck, K. ; Tins, M.: An intelligent tutoring system for classification problem solving. ( Nr. 50). Department of Computer Science, 1992
  • Fritsch, Thomas ; Mittler, Manfred ; Tran-Gia, Phuoc: Artificial neural net applications in telecommunication systems. ( Nr. 52). Department of Computer Science, 1992
  • Poeck, K. ; Puppe, Frank: COKE: Efficient solving of complex assignment problems with the propose-and-exchange method. ( Nr. 51). Department of Computer Science, 1992
1991[ to top ]
  • Fritsch, Thomas ; Mandel, Wolfgang: Communication network routing using neural nets - numerical aspects and alternative approaches. ( Nr. 30). Department of Computer Science, 1991
  • Wrathall, C.: Confluence of one-rule Thue systems. ( Nr. 24). Department of Computer Science, 1991
  • Gihr, O. ; Tran-Gia, Phuoc: A layered description of ATM cell traffic streams and correlation analysis. ( Nr. 25). Department of Computer Science, 1991
  • Gold, Hermann ; Hübner, Frank: Multi server batch service systems in push and pull operating mode - a performance comparison. ( Nr. 26). Department of Computer Science, 1991
  • Gold, Hermann ; Grob, Heidrun: Performance analysis of a batch service system operating in pull mode. ( Nr. 27). Department of Computer Science, 1991
  • Hertrampf, Ulrich: Locally definable acceptance types-the three valued case. ( Nr. 28). Department of Computer Science, 1991
  • Vollmer, Heribert ; Wagner, Klaus W.: Classes of counting functions and complexity theoretic operators. ( Nr. 31). Department of Computer Science, 1991
  • Hertrampf, Ulrich: Locally definable acceptance types for polynomial time machines. ( Nr. 29). Department of Computer Science, 1991
  • Hübner, Frank: Queueing analysis of resource dispatching and scheduling in multi-media systems. ( Nr. 33). Department of Computer Science, 1991
  • Gold, Hermann ; Bleckert, Gabriele: Analysis of a batch service system with two heterogeneous servers. ( Nr. 34). Department of Computer Science, 1991
  • Vollmer, Heribert ; Wagner, Klaus W.: Complexity of functions versus complexity of sets. ( Nr. 35). Department of Computer Science, 1991
  • Tran-Gia, Phuoc ; Gropp, O.: Structure and performance of neural nets in broadband system admission control. ( Nr. 37). Department of Computer Science, 1991
  • Hübner, Frank: Discrete-time analysis of the output process of an ATM multiplexer with periodic input. ( Nr. 36). Department of Computer Science, 1991
  • Book, R.V. ; Lutz, J.H. ; Wagner, Klaus W.: On complexity classes and algorithmically random languages. ( Nr. 32). Department of Computer Science, 1991
1990[ to top ]
  • Hübner, Frank: Analysis of a finite capacity a synchronous multiplexer with periodic sources. ( Nr. 14). Department of Computer Science, 1990
  • Gutbrod, Roger: A transformation system for chain code picture languages: Properties and algorithms. ( Nr. 10). Department of Computer Science, 1990
  • Stock, Thomas ; Tran-Gia, Phuoc: A discrete-time analysis of the DQDB access protocol with general input traffic. ( Nr. 11). Department of Computer Science, 1990
  • Allender, E.W. ; Hertrampf, Ulrich: On the power of uniform families of constant depth threshold circuits. ( Nr. 12). Department of Computer Science, 1990
  • Buntrock, Gerhard ; Hemachandra, L.A. ; Siefkes, D.: Using inductive counting to simulate nondeterministic computation. ( Nr. 13). Department of Computer Science, 1990
  • Gold, Hermann ; Tran-Gia, Phuoc: Performance analysis of a batch service queue arising out of manufacturing systems modeling. ( Nr. 16). Department of Computer Science, 1990
  • Hübner, Frank ; Tran-Gia, Phuoc: Quasi-stationary analysis of a finite capacity asynchronous multiplexer with modulated deterministic input. ( Nr. 17). Department of Computer Science, 1990
  • Buntrock, Gerhard ; Damm, C. ; Hertrampf, Ulrich ; Meinel, C.: Structure and importance of logspace- MOD -classes. ( Nr. 15). Department of Computer Science, 1990
  • Tran-Gia, Phuoc: Analysis of polling systems with general input process and finite capacity. ( Nr. 19). Department of Computer Science, 1990
  • Huckenbeck, Ulrich: Complexity and approximation theoretical properties of rational functions which map two intervals into two other ones. ( Nr. 18). Department of Computer Science, 1990
  • Friedewald, Conny ; Hieronymus, Andreas ; Menzel, Bernd: WUMPS Würzburger message passing system. ( Nr. 20). Department of Computer Science, 1990
  • Stock, Thomas: Influences of multiple priorities on DQDB protocol performance. ( Nr. 22). Department of Computer Science, 1990
  • Book, R.V.: On random oracle separations. ( Nr. 21). Department of Computer Science, 1990
  • Tran-Gia, Phuoc ; Dittmann, Rainer: Performance analysis of the CRMA-protocol in high-speed networks. ( Nr. 23). Department of Computer Science, 1990
1989[ to top ]
  • Wagner, Klaus W.: 9. Workshop über Komplexitätstheorie, effiziente Algorithmen und Datenstrukturen. ( Nr. 9). Department of Computer Science, 1989
  • Kowaluk, M. ; Wagner, Klaus W.: Die Vektor-Sprache: Einfachste Mittel zur kompakten Beschreibung endlicher Objekte. ( Nr. 7). Department of Computer Science, 1989
  • Kowaluk, M. ; Wagner, Klaus W.: Vektor-Reduzierbarkeit. ( Nr. 8). Department of Computer Science, 1989
  • Tran-Gia, Phuoc ; Stock, Thomas: Approximate performance analysis of the DQDB access protocol. ( Nr. 6). Department of Computer Science, 1989
  • Allender, E.W.: A note on the power of threshold circuits. ( Nr. 5). Department of Computer Science, 1989
  • Wagner, Klaus W.: Bounded query classes. ( Nr. 1). Department of Computer Science, 1989
  • Wagner, Klaus W.: Number-of-query hierarchies. ( Nr. 4). Department of Computer Science, 1989
  • Tran-Gia, Phuoc: Application of the discrete transforms in performance modeling and analysis. ( Nr. 2). Department of Computer Science, 1989
  • Hertrampf, Ulrich: Relations among mod-classes. ( Nr. 3). Department of Computer Science, 1989