AAAAAA

   
Results: 1-7 |
Results: 7

Authors: SIELING D
Citation: D. Sieling, VARIABLE ORDERINGS AND THE SIZE OF OBDDS FOR RANDOM PARTIALLY SYMMETRICAL BOOLEAN FUNCTIONS, Random structures & algorithms, 13(1), 1998, pp. 49-70

Authors: BOLLIG B SAUERHOFF M SIELING D WEGENER I
Citation: B. Bollig et al., HIERARCHY THEOREMS FOR KOBDDS AND KIBDDS, Theoretical computer science, 205(1-2), 1998, pp. 45-60

Authors: DRECHSLER R SAUERHOFF M SIELING D
Citation: R. Drechsler et al., THE COMPLEXITY OF THE INCLUSION OPERATION ON OFDDS, IEEE transactions on computer-aided design of integrated circuits and systems, 17(5), 1998, pp. 457-459

Authors: LOBBING M SIELING D WEGENER I
Citation: M. Lobbing et al., PARITY OBDDS CANNOT BE HANDLED EFFICIENTLY ENOUGH, Information processing letters, 67(4), 1998, pp. 163-168

Authors: SIELING D
Citation: D. Sieling, NEW LOWER BOUNDS AND HIERARCHY RESULTS FOR RESTRICTED BRANCHING PROGRAMS, Journal of computer and system sciences, 53(1), 1996, pp. 79-87

Authors: SIELING D WEGENER I
Citation: D. Sieling et I. Wegener, GRAPH DRIVEN BDDS - A NEW DATA STRUCTURE FOR BOOLEAN FUNCTIONS, Theoretical computer science, 141(1-2), 1995, pp. 283-310

Authors: SIELING D WEGENER I
Citation: D. Sieling et I. Wegener, REDUCTION OF OBDDS IN LINEAR-TIME, Information processing letters, 48(3), 1993, pp. 139-144
Risultati: 1-7 |