S. Jukna\ et al., On P versus NP$\cap$co-NP for decision trees and read-once branching programs, in {\it Mathematical foundations of computer science 1997 (Bratislava)}, 319--326, Lecture Notes in Comput. Sci., 1295, Springer, Berlin, ; CNO CMP 1 640 233
B. Bollig and I. Wegener, Complexity theoretical results on partitioned (nondeterministic) binary decision diagrams, in {\it Mathematical foundations of computer science 1997 (Bratislava)}, 159--168, Lecture Notes in Comput. Sci., 1295, Springer, Berlin, ; CNO CMP 1 640 217
B. Bollig\ et al., Hierarchy theorems for $k$OBDDs and $k$IBDDs, Theoret. Comput. Sci. {\bf 205} (1998), no.~1-2, 45--60; CNO CMP 1 638 628
B. Bollig and I. Wegener, A very simple function that requires exponential size read-once branching programs, Inform. Process. Lett. {\bf 66} (1998), no.~2, 53--57; CNO CMP 1 627 294
B. Bollig and I. Wegener, Completeness and non-completeness results with respect to read-once projections, Inform. and Comput. {\bf 143} (1998), no.~1, 24--33; CNO CMP 1 622 234
R. Uehara, K. Tsuchida and I. Wegener, Optimal attribute-efficient learning of disjunction, parity, and threshold functions, in {\it Computational learning theory (Jerusalem, 1997)}, 171--184, Lecture Notes in Comput. Sci., 1208, Springer, Berlin, 1997; MR 98g:68150
P. Savick\'y and I. Wegener, Efficient algorithms for the transformation between different types of binary decision diagrams, Acta Inform. {\bf 34} (1997), no.~4, 245--256; MR 98f:68072
O. Kyek, I. Parberry and I. Wegener, Bounds on the number of knight's tours, Discrete Appl. Math. {\bf 74} (1997), no.~2, 171--181; MR 98d:05067
I. Wegener, {\it Kompendium Theoretische Informatik---eine Ideensammlung}, [Compendium on theoretical computer science---a collection of ideas] Teubner, Stuttgart, 1996 ISBN: 3-519-02145-5 ; MR 97j:68026
I. Wegener, On the complexity of encoding in analog circuits, Inform. Process. Lett. {\bf 60} (1996), no.~1, 49--52; MR 97f:68077
B. Bollig, M. L\"obbing and I. Wegener, On the effect of local changes in the variable ordering of ordered decision diagrams, Inform. Process. Lett. {\bf 59} (1996), no.~5, 233--239; MR 97e:68043
I. Wegener, Efficient data structures for Boolean functions, Discrete Math. {\bf 136} (1994), no.~1-3, 347--372; MR 96h:68058
D. Sieling and I. Wegener, Graph driven BDDs---a new data structure for Boolean functions, Theoret. Comput. Sci. {\bf 141} (1995), no.~1-2, 283--310; MR 96c:68044
P. Savick\'y and I. Wegener, Efficient algorithms for the transformation between different types of binary decision diagrams, in {\it Foundations of software technology and theoretical computer science (Madras, 1994)}, 390--401, Lecture Notes in Comput. Sci., 880, Springer, Berlin, 1994; MR 96a:68023
I. Wegener, The size of reduced OBDDs and optimal read-once branching programs for almost all Boolean functions, in {\it Graph-theoretic concepts in computer science (Utrecht, 1993)}, 252--263, Lecture Notes in Comput. Sci., 790, Springer, Berlin, 1994; MR 95g:68052
I. Wegener, Comments on: ``A characterization of binary decision diagrams'' [IEEE Trans.\ Comput.\ {\bf 42} (1993), no.\ 2, 129--137; MR 94c:68027] by S. Chakravarty, IEEE Trans. Comput. {\bf 43} (1994), no.~3, 383--384; MR 95b:68031
A. Conrad\ et al., Solution of the knight's Hamiltonian path problem on chessboards, Discrete Appl. Math. {\bf 50} (1994), no.~2, 125--134; MR 95b:05133
J. H\aa stad\ et al., Optimal depth, very small size circuits for symmetric functions in ${\rm AC}\sp 0$, Inform. and Comput. {\bf 108} (1994), no.~2, 200--211; MR 95a:94022
D. Sieling and I. Wegener, ${\rm NC}$-algorithms for operations on binary decision diagrams, Parallel Process. Lett. {\bf 3} (1993), no.~1, 3--12; MR 94k:68089
I. Wegener, Optimal lower bounds on the depth of polynomial-size threshold circuits for some arithmetic functions, Inform. Process. Lett. {\bf 46} (1993), no.~2, 85--87; MR 94b:68056
I. Wegener, N. Wurm and S.-Z. Yi, Symmetric functions in ${\rm AC}\sp 0$ can be computed in constant depth with very small size, in {\it Boolean function complexity (Durham, 1990)}, 129--139, Cambridge Univ. Press, Cambridge, 1992; MR 94a:68042
I. Wegener, The complexity of the parity function in unbounded fan-in, unbounded depth circuits, Theoret. Comput. Sci. {\bf 85} (1991), no.~1, Algorithms Automat. Complexity Games, 155--170; MR 92k:68042
K. Lenz and I. Wegener, The conjunctive complexity of quadratic Boolean functions, Theoret. Comput. Sci. {\bf 81} (1991), no.~2, Algorithms Automat. Complexity Games, 257--268; MR 92f:68042
I. Wegener, The worst case complexity of McDiarmid and Reed's variant of BOTTOM-UP-HEAP SORT is less than $n\log\,n+1.1n$, in {\it STACS 91 (Hamburg, 1991)}, 137--147, Lecture Notes in Comput. Sci., 480, Springer, Berlin, 1991; MR 92c:68027
I. Wegener, {\it Effiziente Algorithmen f\"ur grundlegende Funktionen}, [Efficient algorithms for fundamental functions] Teubner, Stuttgart, 1989 ISBN: 3-519-02276-1 ; MR 91i:68003
I. Wegener, Efficient simulation of circuits by EREW PRAMs, Inform. Process. Lett. {\bf 35} (1990), no.~2, 99--102; MR 91h:68051
B. Voigt and I. Wegener, A remark on minimal polynomials of Boolean functions, in {\it CSL '88 (Duisburg, 1988)}, 372--383, Lecture Notes in Comput. Sci., 385, Springer, Berlin, 1989; MR 91f:68068
B. Voigt and I. Wegener, Minimal polynomials for the conjunction of functions on disjoint variables can be very simple, Inform. and Comput. {\bf 83} (1989), no.~1, 65--79; MR 91d:68040
I. Wegener and L. Z\'adori, A note on the relations betwen critical and sensitive complexity, J. Inform. Process. Cybernet. {\bf 25} (1989), no.~8-9, 417--421; MR 91a:68106
I. Wegener, The range of new lower bound techniques for WRAMs and bounded depth circuits, J. Inform. Process. Cybernet. {\bf 23} (1987), no.~10-11, 537--543; MR 89i:68046
I. Wegener, On the complexity of branching programs and decision trees for clique functions, J. Assoc. Comput. Mach. {\bf 35} (1988), no.~2, 461--471; MR 89e:68057
R. Ahlswede and I. Wegener, {\it Search problems}, Translated from the German by Jean E. Wotschke, A Wiley-Interscience Publication. Wiley, Chichester, 1987 ISBN: 0-471-90825-8 ; MR 89c:68019
I. Wegener, {\it The complexity of Boolean functions}, Wiley, Chichester, 1987 ISBN: 0-471-91555-6 ; MR 89b:03066
I. Wegener, The complexity of symmetric Boolean functions, in {\it Computation theory and logic}, 433--442, Lecture Notes in Comput. Sci., 270, Springer, Berlin, 1987; MR 88j:68063
S. Bublitz, U. Sch\"urfeld and I. Wegener, Properties of complexity measures for PRAMs and WRAMs, Theoret. Comput. Sci. {\bf 48} (1986), no.~1, 53--73; MR 88i:68033
B. Brustmann and I. Wegener, The complexity of symmetric functions in bounded-depth circuits, Inform. Process. Lett. {\bf 25} (1987), no.~4, 217--219; MR 88h:68024
I. Wegener, On the complexity of branching programs and decision trees for clique functions, in {\it TAPSOFT '87, Vol.\ 1 (Pisa, 1987)}, 1--12, Lecture Notes in Comput. Sci., 249, Springer, Berlin, 1987; MR 88f:68041
I. Wegener, Time-space trade-offs for branching programs, J. Comput. System Sci. {\bf 32} (1986), no.~1, 91--96; MR 88f:68040
I. Wegener, More on the complexity of slice functions, Theoret. Comput. Sci. {\bf 43} (1986), no.~2-3, 201--211; MR 88e:68042
I. Wegener, The critical complexity of all (monotone) Boolean functions and monotone graph properties, Inform. and Control {\bf 67} (1985), no.~1-3, 212--222; MR 88b:68071
M. S. Paterson and I. Wegener, Nearly optimal hierarchies for network and formula size, Acta Inform. {\bf 23} (1986), no.~2, 217--221; MR 87k:68048
J. Jaschinski and I. Wegener, Optimal search for a definite of many objects, in {\it IX symposium on operations research. Part I. Sections 1--4 (Osnabr\"uck, 1984)}, 39--46, Athen\"aum/Hain/Hanstein, K\"onigstein/Ts., 1985; MR 87h:90118
I. Wegener, On the complexity of slice functions, Theoret. Comput. Sci. {\bf 38} (1985), no.~1, 55--68; MR 87e:68032
I. Wegener, Optimal search with positive switch cost is NP-hard, Inform. Process. Lett. {\bf 21} (1985), no.~1, 49--52; MR 87d:68019
I. Wegener, The critical complexity of all (monotone) Boolean functions and monotone graph properties, in {\it Fundamentals of computation theory (Cottbus, 1985)}, 494--502, Lecture Notes in Comput. Sci., 199, Springer, Berlin, 1985; MR 87c:68026
I. Wegener, Optimal decision trees and one-time-only branching programs for symmetric Boolean functions, Inform. and Control {\bf 62} (1984), no.~2-3, 129--143; MR 86k:68033
I. Wegener, Proving lower bounds on the monotone complexity of Boolean functions, in {\it Logic and machines: decision problems and complexity (M\"unster, 1983)}, 446--456, Lecture Notes in Comput. Sci., 171, Springer, Berlin, 1984; MR 86j:68047
I. Wegener, Optimal decision trees and one-time-only branching programs for symmetric Boolean functions, in {\it Ninth colloquium on trees in algebra and programming (Bordeaux, 1984)}, 313--326, Cambridge Univ. Press, Cambridge, 1984; MR 86j:68046
I. Wegener, Discrete sequential search with positive switch cost, in {\it VII. symposium on operations research, Sections 1--3 (St. Gallen, 1982)}, 391--401, Athen\"aum/Hain/Hanstein, K\"onigstein/Ts., 1983; MR 85i:90077
I. Wegener, Relating monotone formula size and monotone depth of Boolean functions, Inform. Process. Lett. {\bf 16} (1983), no.~1, 41--42; MR 84c:68035
I. Wegener, Best possible asymptotic bounds on the depth of monotone functions in multivalued logic, Inform. Process. Lett. {\bf 15} (1982), no.~2, 81--83; MR 84c:03049
I. Wegener, The discrete search problem and the construction of optimal allocations, Naval Res. Logist. Quart. {\bf 29} (1982), no.~2, 203--212; MR 83m:90052
I. Wegener, Boolean functions whose monotone complexity is of size $n\sp{2}/{\rm log}\,n$, Theoret. Comput. Sci. {\bf 21} (1982), no.~2, 213--224; MR 83k:68040
U. L\"ossner and I. Wegener, Discrete sequential search with positive switch cost, Math. Oper. Res. {\bf 7} (1982), no.~3, 426--440; MR 83i:90085
I. Wegener, The construction of an optimal distribution of search effort, Naval Res. Logist. Quart. {\bf 28} (1981), no.~4, 533--543; MR 83g:90069
I. Wegener, Some results on a discrete search problem, in {\it Proceedings of the Sixth Conference on Probability Theory (Bra\cedla sov, 1979)}, 473--487, Ed. Acad. R.S. Rom\^ania, Bucharest, 1981; MR 82m:90099
I. Wegener, Optimal sequential search with discounted income, J. Inform. Optim. Sci. {\bf 2} (1981), no.~1, 1--18; MR 82k:90069
I. Wegener, The discrete sequential search problem with nonrandom cost and overlook probabilities, Math. Oper. Res. {\bf 5} (1980), no.~3, 373--380; MR 82k:90068
I. Wegener, An improved complexity hierarchy on the depth of Boolean functions, Acta Inform. {\bf 15} (1981), no.~2, 147--152; MR 82i:94036
I. Wegener, Switching functions whose monotone complexity is nearly quadratic, Theoret. Comput. Sci. {\bf 9} (1979), no.~1, 83--97; MR 81i:94042
I. Wegener, A new lower bound on the monotone network complexity of Boolean sums, Acta Inform. {\bf 13} (1980), no.~2, 109--114; MR 81g:68075
R. Ahlswede and I. Wegener, {\it Suchprobleme}, [Search problems] Teubner Studienbucher. Teubner, Stuttgart, 1979 ISBN: 3-519-02058-0 ; MR 81d:94022
I. Wegener, Switching functions whose monotone complexity is nearly quadratic, in {\it Conference Record of the Tenth Annual ACM Symposium on Theory of Computing (San Diego, Calif., 1978)}, 143--149, ACM, New York, 1978; MR 81c:94057
I. Wegener, On separating systems whose elements are sets of at most $k$\ elements, Discrete Math. {\bf 28} (1979), no.~2, 219--222; MR 81b:05019
I. Wegener, A counterexample to a conjecture of Schnorr referring to monotone networks, Theoret. Comput. Sci. {\bf 9} (1979), no.~1, 147--150; MR 80k:94057
B. Bollig and I. Wegener, Read-once projections and formal circuit verification with binary decision diagrams, in {\it STACS 96 (Grenoble, 1996)}, 491--502, Lecture Notes in Comput. Sci., 1046, Springer, Berlin, ; CNO CMP 1 462 120
M. L\"obbing and I. Wegener, The number of knight's tours equals $33,439,123,484,294$---counting with binary decision diagrams, Electron. J. Combin. {\bf 3} (1996), no.~1, Research Paper 5, approx.\ 4 pp.\ (electronic); CNO CMP 1 368 332
I. Wegener, BOTTOM-UP-HEAPSORT, a new variant of HEAPSORT beating, on an average, QUICKSORT (if $n$ is not very small), Theoret. Comput. Sci. {\bf 118} (1993), no.~1, 81--98; CNO CMP 1 238 786
D. Sieling and I. Wegener, Reduction of OBDDs in linear time, Inform. Process. Lett. {\bf 48} (1993), no.~3, 139--144; CNO CMP 1 256 803
I. Wegener, The worst case complexity of McDiarmid and Reed's variant of BOTTOM-UP HEAPSORT is less than $n\log\,n+1.1n$, Inform. and Comput. {\bf 97} (1992), no.~1, 86--96; CNO CMP 1 154 207
I. Wegener, Bottom-up-heap sort, a new variant of heap sort beating on average quick sort (if $n$ is not very small), in {\it Mathematical foundations of computer science (Bansk\'a Bystrica, 1990)}, 516--522, Lecture Notes in Comput. Sci., 452, Springer, Berlin, ; CNO CMP 1 084 870
I. Wegener, N. Wurm and S.-Z. Yi, Symmetric functions in ${\rm AC}\sp 0$ can be computed in constant depth with very small size, in {\it Mathematical foundations of computer science (Bansk\'a Bystrica, 1990)}, 523--529, Lecture Notes in Comput. Sci., 452, Springer, Berlin, ; CNO CMP 1 084 871
S. Bublitz\ et al., Properties of complexity measures for PRAMs and WRAMs, in {\it Mathematical foundations of computer science, 1986 (Bratislava, 1986)}, 230--238, Lecture Notes in Comput. Sci., 233, Springer, Berlin, ; CNO CMP 874 599
I. Wegener, On the complexity of slice functions, in {\it Mathematical foundations of computer science, 1984 (Prague, 1984)}, 553--561, Lecture Notes in Comput. Sci., 176, Springer, Berlin, ; CNO CMP 783 487
Hauptseite
main site