Search the dblp DataBase
Dietmar Uhlig: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- Dietmar Uhlig
Reliable Networks from Unreliable Gates With Almost Minimal Complexity. [Citation Graph (0, 0)][DBLP]
FCT, 1987, pp:462-469 [Conf] - Dietmar Uhlig
Boolean Functions with a Large Number of Subfunctions and Small Complexity and Depth. [Citation Graph (0, 0)][DBLP]
FCT, 1991, pp:395-404 [Conf] - Dietmar Uhlig
On Reliable Networks from Unreliable Gates. [Citation Graph (0, 0)][DBLP]
Parallel Algorithms and Architectures, 1987, pp:155-162 [Conf] - Dietmar Uhlig
Reliable networks for Boolean functions with small complexity. [Citation Graph (0, 0)][DBLP]
Parcella, 1988, pp:366-371 [Conf] - Dietmar Uhlig
Über die Anzahl der Unterfunktionen einer Booleschen Funktion zur Charakterisierung der Kompliziertheit ihrer Realisierung. [Citation Graph (0, 0)][DBLP]
Elektronische Informationsverarbeitung und Kybernetik, 1972, v:8, n:5, pp:255-267 [Journal]
Search in 0.001secs, Finished in 0.001secs
| NOTICE1 |
|---|
| System may not be available sometimes or not working properly, since it is still in development with continuous upgrades |
| NOTICE2 |
|---|
| The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002