AAAAAA
Results:
1-11
|
Results: 11
Authors:
Jain, J
Wegener, I
Fujita, M
Citation: J. Jain et al., A note on complexity of OBDD composition and efficiency of partitioned-OBDDs OBDDs, IEEE COMPUT, 50(11), 2001, pp. 1289-1290
Authors:
Sauerhoff, M
Wegener, I
Werchner, R
Citation: M. Sauerhoff et al., Optimal ordered binary decision diagrams for read-once formulas, DISCR APP M, 103(1-3), 2000, pp. 237-258
Authors:
Uehara, R
Tsuchida, K
Wegener, I
Citation: R. Uehara et al., Identification of partial disjunction, parity, and threshold functions, THEOR COMP, 230(1-2), 2000, pp. 131-147
Authors:
Bollig, B
Wegener, I
Citation: B. Bollig et I. Wegener, Asymptotically optimal bounds for OBDDs and the solution of some basic OBDD problems, J COMPUT SY, 61(3), 2000, pp. 558-579
Authors:
Wegener, I
Citation: I. Wegener, Worst case examples for operations on OBDDs, INF PROCESS, 74(3-4), 2000, pp. 91-96
Authors:
Wegener, I
Citation: I. Wegener, Communication complexity and BDD lower bound techniques, NUMBERS, INFORMATION AND COMPLEXITY, 2000, pp. 615-628
Authors:
Fischer, P
Klasner, N
Wegener, I
Citation: P. Fischer et al., On the cut-off point for combinatorial group testing, DISCR APP M, 91(1-3), 1999, pp. 83-92
Authors:
Bollig, B
Wegener, I
Citation: B. Bollig et I. Wegener, Complexity theoretical results on partitioned (nondeterministic) binary decision diagrams, THEOR C SYS, 32(4), 1999, pp. 487-503
Authors:
Jukna, S
Razborov, A
Savicky, P
Wegener, I
Citation: S. Jukna et al., On P versus NP boolean AND co-NP for decision trees and read-once branching programs, COMP COMPLE, 8(4), 1999, pp. 357-370
Authors:
Bollig, B
Lobbing, M
Sauerhoff, M
Wegener, I
Citation: B. Bollig et al., On the complexity of the hidden weighted bit function for various BDD models, RAIRO-INF, 33(2), 1999, pp. 103-115
Authors:
Klauer, KC
Wegener, I
Citation: Kc. Klauer et I. Wegener, Unraveling social categorization in the "Who said what?" paradigm, J PERS SOC, 75(5), 1998, pp. 1155-1178
Risultati:
1-11
|