BEST POSSIBLE ASYMPTOTIC BOUNDS ON THE DEPTH OF MONOTONE FUNCTIONS IN MULTIVALUED LOGICWEGENER I.1982; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1982; VOL. 15; NO 2; PP. 81-83; BIBL. 3 REF.Article

THE CONSTRUCTION OF AN OPTIMAL DISTRIBUTION OF SEARCH EFFORTWEGENER I.1981; NAV. RES. LOGIST. Q.; ISSN 0028-1441; USA; DA. 1981; VOL. 28; NO 4; PP. 533-543; BIBL. 9 REF.Article

A COUNTEREXAMPLE TO A CONJECTURE OF SCHNORR REFERRING TO MONOTONE NETWORKSWEGENER I.1979; THEOR. COMPUTER SCI.; NLD; DA. 1979; VOL. 9; NO 1; PP. 147-150; BIBL. 2 REF.Article

RELATING MONOTONE FORMULA SIZE AND MONOTONE DEPTH OF BOOLEAN FUNCTIONSWEGENER I.1983; INFORMATION PROCESSING LETTERS; ISSN 0020-0190; NLD; DA. 1983; VOL. 16; NO 1; PP. 41-42; BIBL. 3 REF.Article

AN IMPROVED COMPLEXITY HIERARCHY ON THE DEPTH OF BOOLEAN FUNCTIONSWEGENER I.1981; ACTA INF.; ISSN 0001-5903; DEU; DA. 1981; VOL. 15; NO 2; PP. 147-152; BIBL. 3 REF.Article

BOOLEAN FUNCTIONS WHOSE MONOTONE COMPLEXITY IS OF SIZE N²/LOG NWEGENER I.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; VOL. 104; PP. 22-31; BIBL. 11 REF.Conference Paper

THE DISCRETE SEQUENTIAL SEARCH PROBLEM WITH NONRANDOM COST AND OVERLOOK PROBABILITIESWEGENER I.1980; MATH. OPER. RES.; ISSN 0364-765X; USA; DA. 1980; VOL. 5; NO 3; PP. 373-380; BIBL. 6 REF.Article

SWITCHING FUNCTIONS WHOSE MONOTONE COMPLEXITY IS NEARLY QUADRATICWEGENER I.1979; THEOR. COMPUTER SCI.; NLD; DA. 1979; VOL. 9; NO 1; PP. 83-97; BIBL. 7 REF.Article

ON SEPARATING SYSTEMS WHOSE ELEMENTS ARE SETS OF AT MOST K ELEMENTSWEGENER I.1979; DISCRETE MATH.; NLD; DA. 1979; VOL. 28; NO 2; PP. 219-222; BIBL. 1 REF.Article

Optimal lower bounds on the depth of polynomial-size threshold circuits for some arithmetic functionsWEGENER, I.Information processing letters. 1993, Vol 46, Num 2, pp 85-87, issn 0020-0190Article

The worst case complexity of McDiarmid and Reed's variant of BOTTOM-UP HEAPSORT is less than n log n+1.1nWEGENER, I.Information and computation (Print). 1992, Vol 97, Num 1, pp 86-96, issn 0890-5401Article

A simple modification of Xunrang and Yuzhang's HEAPSORT variant improving its complexity significantlyWEGENER, I.Computer journal (Print). 1993, Vol 36, Num 3, pp 286-288, issn 0010-4620Article

The critical complexity of all (monotone) boolean functions and monotone graph propertiesWEGENER, I.Information and control. 1985, Vol 67, Num 1-3, pp 212-227, issn 0019-9958Article

Optimal decision trees and one-time-only branching programs for symmetric Boolean functionsWEGENER, I.Information and control. 1984, Vol 62, Num 2-3, pp 129-143, issn 0019-9958Article

On the complexity of branching programs and decision trees for clique functionsWEGENER, I.Journal of the Association for Computing Machinery. 1988, Vol 35, Num 2, pp 461-471, issn 0004-5411Article

The analysis of evolutionary algorithms: A proof that crossover really can helpJANSEN, T; WEGENER, I.Algorithmica. 2002, Vol 34, Num 1, pp 47-66, issn 0178-4617Article

Minimal polynomials for the conjunction of functions on disjoint variables can be very simpleVOIGT, B; WEGENER, I.Information and computation (Print). 1989, Vol 83, Num 1, pp 65-79, issn 0890-5401Article

Search problemsAHLSWEDE, R; WEGENER, I.The Journal of the Operational Research Society. 1988, Vol 39, Num 10, pp 977-978, issn 0160-5682Article

A very simple function that requires exponential size read-once branching prugramsBOLLIG, B; WEGENER, I.Information processing letters. 1998, Vol 66, Num 2, pp 53-57, issn 0020-0190Article

Unraveling social categorization in the Who said what? ParadigmKLAUER, K. C; WEGENER, I.Journal of personality and social psychology. 1998, Vol 75, Num 5, pp 1155-1178, issn 0022-3514Article

Graph driven BDDs : a new data structure for Boolean functionsSIELING, D; WEGENER, I.Theoretical computer science. 1995, Vol 141, Num 1-2, pp 283-310, issn 0304-3975Article

Reduction of OBDDs in linear timeSIELING, D; WEGENER, I.Information processing letters. 1993, Vol 48, Num 3, pp 139-144, issn 0020-0190Article

BOTTOM-UP-HEAPSORT, a new variant of HEAPSORT beating, on an average, QUICKSORT (if n is not very small)WEGENER, I.Theoretical computer science. 1993, Vol 118, Num 1, pp 81-98, issn 0304-3975Conference Paper

Nearly optimal hierarchies for network and formula sizePATERSON, M. S; WEGENER, I.Acta informatica. 1986, Vol 23, Num 2, pp 217-221, issn 0001-5903Article

SOMATOSTATIN-28 IS AN HORMONALLY ACTIVE PEPTIDE SECRETED INTO HYPOPHYSIAL PORTAL VESSEL BLOODMILLAR RP; SHEWARD WJ; WEGENER I et al.1983; BRAIN RESEARCH; ISSN 0006-8993; NLD; DA. 1983; VOL. 260; NO 2; PP. 334-337; BIBL. 15 REF.Article