default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformatik, Festschrift zum 60. Geburtstag von Günter Hotz, 1992
- Johannes Buchmann, Harald Ganzinger, Wolfgang J. Paul:
Informatik, Festschrift zum 60. Geburtstag von Günter Hotz. Teubner-Texte zur Informatik 1, Teubner / Springer 1992, ISBN 978-3-8154-2033-1 - Ferri Abolhassan, Reinhard Drefenstedt, Jörg Keller, Wolfgang J. Paul, Dieter Scheerer:
On the Physical Design of PRAMs. 1-19 - Bernd Becker:
Synthesis for Testability: Binary Decision Diagrams. 21-39 - Eberhard Bertsch:
Ähnlichkeit von Grammatiken - Ansätze und Erfahrungen. 41-53 - Hans-Peter Blatt:
Verteilung der Nullstellen von Polynomen auf Jordanbögen. 55-67 - Johannes Buchmann, Stephan Düllmann:
Distributed Class Group Computation. 69-79 - Volker Claus:
Complexity Measures on Permutations. 81-94 - Martin Dietzfelbinger, Friedhelm Meyer auf der Heide:
Dynamic Hashing in Real Time. 95-119 - Christian Ferdinand, Helmut Seidl, Reinhard Wilhelm:
Baumautomaten zur Codeselektion. 121-144 - Michael J. Fischer, Sophia A. Paleologou:
Decision Making in the Presence of Noise. 145-168 - Bernd Halstenberg, Rüdiger Reischuk:
Über den Nutzen von Orakelfragen bei nichtdeterministischen Kommunikationsprotokollen. 169-183 - Uwe Hinsberger, Reiner Kolla:
Performance Optimization of Combinational Circuits. 185-208 - Thomas Kretschmer:
An Algebraic Characterization of Context-Free Languages. 209-213 - Juraj Hromkovic, Burkhard Monien:
The Bisection Problem for Graphs of Degree 4 (Configuring Transputer Systems). 215-233 - Dung T. Huynh:
Complexity of Closeness, Sparseness and Segment Equivalence for Context-Free and Regular Languages. 235-251 - Bala Kalyanasundaram, Georg Schnitger:
Communication Complexity and Lower Bounds for Sequential Computation. 253-268 - Rainer Kemp:
On the Stack Size of a Class of Backtrack Trees. 269-282 - Rolf Klein, Kurt Mehlhorn, Stefan Meiser:
Randomized Incremental Construction of Abstract Voronoi Diagrams. 283-308 - Friedemann Mattern:
Über die relativistische Struktur logischer Zeit in verteilten Systemen. 309-331 - Paul Molitor:
A Hierarchy Preserving Hierarchical Bottom-Up 2-layer Wiring Algorithm with Respect to Via Minimization. 333-348 - Hans-Georg Osthof:
Eine O(e log e) - Heuristik für ein Flußproblem. 349-358 - Claus-Peter Schnorr:
Computation of the Boolean Matrix-Vector, AND/OR-Produkt in Average Time O(m + nlnn). 359-362 - Jürgen Seilen:
Durch kinematische Szenen erzeugte topologische Räume. 363-380 - Hans Ulrich Simon:
Bemerkungen zum Schätzen von Bayesschen Diskriminantenfunktionen. 381-385 - Gert Smolka:
Residuation and Guarded Rules for Constraint Logic Programming. 387-400 - Otto Spaniol, Werner Kremer, Andreas Fasbender:
TPNA: Ein neues Analyseverfahren für Tandem-Prioritäten-Netze. 401-423 - Uwe Sparmann:
Derivation of High Quality Tests for Large Heterogeneous Circuits: Floating-Point Operations. 425-439 - Harald Ganzinger, Jürgen Stuber:
Inductive Theorem Proving by Consistency for First-Order Clauses. 441-461 - Wolffried Stucky, Andreas Oberweis:
Zur Beherrschbarkeit des Entwicklungsprozesses komplexer Software-Systeme. 463-480 - Wolfgang Wahlster:
An Intelligent Multimodal Interface. 481-494 - Otto Spaniol:
Laudatio zum 60. Geburtstag von Prof. Dr. Günter Hotz. 495-508
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-11-16 23:47 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
