AAAAAA

   
Results: 1-21 |
Results: 21

Authors: BOLLIG B WEGENER I
Citation: B. Bollig et I. Wegener, COMPLETENESS AND NON-COMPLETENESS RESULTS WITH RESPECT TO READ-ONCE PROJECTIONS, Information and computation, 143(1), 1998, pp. 24-33

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: 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: BOLLIG B WEGENER I
Citation: B. Bollig et I. Wegener, A VERY SIMPLE FUNCTION THAT REQUIRES EXPONENTIAL SIZE READ-ONCE BRANCHING PROGRAMS, Information processing letters, 66(2), 1998, pp. 53-57

Authors: KYEK O PARBERRY I WEGENER I
Citation: O. Kyek et al., BOUNDS ON THE NUMBER OF KNIGHTS TOURS, Discrete applied mathematics, 74(2), 1997, pp. 171-181

Authors: WEGENER I
Citation: I. Wegener, INTERNET FOR PSYCHOLOGISTS - GERMAN - BAT INIC,B, Zeitschrift fur experimentelle Psychologie, 44(3), 1997, pp. 519-520

Authors: SAVICKY P WEGENER I
Citation: P. Savicky et I. Wegener, EFFICIENT ALGORITHMS FOR THE TRANSFORMATION BETWEEN DIFFERENT TYPES OF BINARY DECISION DIAGRAMS, Acta informatica, 34(4), 1997, pp. 245-256

Authors: SAUERHOFF M WEGENER I
Citation: M. Sauerhoff et I. Wegener, ON THE COMPLEXITY OF MINIMIZING THE OBDD SIZE FOR INCOMPLETELY SPECIFIED FUNCTIONS, IEEE transactions on computer-aided design of integrated circuits and systems, 15(11), 1996, pp. 1435-1437

Authors: WEGENER I
Citation: I. Wegener, ON THE COMPLEXITY OF ENCODING IN ANALOG CIRCUITS, Information processing letters, 60(1), 1996, pp. 49-52

Authors: BOLLIG B LOBBING M WEGENER I
Citation: B. Bollig et al., ON THE EFFECT OF LOCAL CHANGES IN THE VARIABLE ORDERING OF ORDERED DECISION DIAGRAMS, Information processing letters, 59(5), 1996, pp. 233-239

Authors: BOLLIG B WEGENER I
Citation: B. Bollig et I. Wegener, IMPROVING THE VARIABLE ORDERING OF OBDDS IS NP-COMPLETE, I.E.E.E. transactions on computers, 45(9), 1996, pp. 993-1002

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: CONRAD A HINDRICHS T MORSY H WEGENER I
Citation: A. Conrad et al., SOLUTION OF THE KNIGHTS HAMILTONIAN PATH PROBLEM ON CHESSBOARDS, Discrete applied mathematics, 50(2), 1994, pp. 125-134

Authors: HASTAD J WEGENER I WURM N YI SZ
Citation: J. Hastad et al., OPTIMAL DEPTH, VERY SMALL-SIZE CIRCUITS FOR SYMMETRICAL FUNCTIONS IN AC(0), Information and computation, 108(2), 1994, pp. 200-211

Authors: WEGENER I
Citation: I. Wegener, A CHARACTERIZATION OF BINARY DECISION DIAGRAMS - COMMENT, I.E.E.E. transactions on computers, 43(3), 1994, pp. 383-384

Authors: WEGENER I
Citation: I. Wegener, THE SIZE OF REDUCED OBDDS AND OPTIMAL READ-ONCE BRANCHING PROGRAMS FOR ALMOST-ALL BOOLEAN FUNCTIONS, I.E.E.E. transactions on computers, 43(11), 1994, pp. 1262-1269

Authors: GROSSMAN SL WEGENER I WANZL W DAVIDI S COHEN H
Citation: Sl. Grossman et al., MOLECULAR-HYDROGEN EVOLUTION AS A CONSEQUENCE OF ATMOSPHERIC OXIDATION OF COAL .3. THERMOGRAVIMETRIC FLOW REACTOR STUDIES, Fuel, 73(5), 1994, pp. 762-767

Authors: WEGENER I
Citation: I. Wegener, BOTTOM-UP-HEAPSORT, A NEW VARIANT OF HEAPSORT BEATING, ON AN AVERAGE,QUICKSORT - (IF N IS NOT VERY SMALL), Theoretical computer science, 118(1), 1993, pp. 81-98

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

Authors: WEGENER I
Citation: I. Wegener, OPTIMAL LOWER BOUNDS ON THE DEPTH OF POLYNOMIAL-SIZE THRESHOLD CIRCUITS FOR SOME ARITHMETIC FUNCTIONS, Information processing letters, 46(2), 1993, pp. 85-87

Authors: WEGENER I
Citation: I. Wegener, A SIMPLE MODIFICATION OF XUNRANG AND YUZHANG HEAPSORT VARIANT IMPROVING ITS COMPLEXITY SIGNIFICANTLY, Computer journal, 36(3), 1993, pp. 286-288
Risultati: 1-21 |