->[Gliederung]
Artikel in Zeitschriften und Tagungsbänden: 1989 A. Bach and A. S.: A characterization of the classical states of the quantum harmonic oscillator by means of de Finetti's theorem Comm. Math. Phys. 123, 1989, 453-462, \cite{BACH:89A} A. S.: Absolute continuity and Radon-Nikodym type theorems for weights and traces on von Neumann algebras Rendiconti del Circolo Matematico di Palermo, Serie II 37,1989, 257-270 \cite{SRIVASTAV:89A} 1990 A. S.: Commutativity criteria for real Banach algebras Arch. Math. 54, 1990, 65-72, \cite{SRIVASTAV:90A} 1991 A. S.: A generalization of the Gleason-Kahane-Zelazko theorem for real Banach algebras Indian Journal of Mathematics 32, 1991, 217-221, \cite{SRIVASTAV:91A} A. S.: Quaternion-valued representation and commutativity criteria for real Banach algebras Festschrift zum 60ten Geburtstag von Professor Dr. George Maltese Universität Münster, 1991 \cite{SRIVASTAV:91B} 1992 A. S.: Extreme points of positive functionals in real Banach* algebras Canad. J. Math. 44 No 4, 1992, 856-866, \cite{SRIVASTAV:92A} 1993 A. S. and P. Stangier: On quadratic lattice approximations Lecture Notes in Computer Science 762, 1993, 176 - 184 \cite{SRIVASTAV:93A} A. S. and P. Stangier: The relationship between fractional and integral graph partitioning In: C. Hoede, U. Faigle (eds.), Proccedings of the 2nd Twente workshop on combinatorial optimization, 1993, 181 - 185, \cite{SRIVASTAV:93B} A. S. and P. Stangier: Integer multicommodity flows with reduced demands Lecture Notes in Computer Science 726, Springer, 1993, 360 - 372, \cite{SRIVASTAV:93C} 1995 A. S.: Derandomized Algorithms in Combinatorial Optimization Habilitationsschrift, Freie Universität Berlin, 1995, \cite{SRIVASTAV:95A} A. S. and P. Stangier: Weighted fractional and integral k-matching in hypergraphs Disc. Appl. Math. 57, 1995, 225-269 \cite{SRIVASTAV:95B} 1996 A. S. and P. Stangier: Algorithmic Chernoff-Hoeffding inequalities in integer programming Random Structures & Algorithms Vol 8 No 1, 1996, 27 - 58, \cite{SRIVASTAV:96A} 1997 A. S. and P. Stangier: Tight aproximation for resource constrained scheduling and bin packing Discrete Appl. Math. 79, 1997, 223-245 \cite{SRIVASTAV:97A} A. S. and P. Stangier: A parallel approximation algorithm for resource constrained scheduling and bin packing Lecture Notes in Computer Science 1253, Springer Verlag, 1997, 147 - 159, \cite{SRIVASTAV:97B} 1998 H. Preuss and A. S.: Blockwise variable orderings for shared BDDs Lecture Notes in Computer Science 1450, Springer, 1998, 636 - 644, \cite{PREUSS:98A} A. S. and K. Wolf: Finding densest subgraphs with semidefinite programming Lecture Notes in Computer Science 1444, Springer, 1998, 181 - 193, \cite{SRIVASTAV:98A} C. Gröpl and H. J. Prömel and A. S.: Size and structure of random OBDDs LNCS 762, Springer, 1998, 176 - 184 \cite{GROEPEL:98A} M. Block and C. Gröpl and H. Preuss and H. J. Prömel and A. S.: Efficient ordering of state variables and transition relation partitions in symbolic model checking Preprint, 1998 \cite{BLOCK:98A} B. Doerr, A. S. and P. Wehr: Discrepancies of cartesian products of arithmetic progressions. Preprint 1998 \cite{DOERR:98B} 1999 B. Doerr and A. S.: Approximation of multicolor discrepancy Proceedings of the 2nd International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, Berkeley, Springer LNCS 1671, 39 - 50, 1999 \cite{DOERR:99B} 2000 A. S. and P. Stangier: Complexity, representation and approximation of integer multicommodity flows Discrete Applied Math. 99, 2000, 183 - 208 \cite{SRIVASTAV:00A} A. Baltz and T. Schoen and A. S.: Probabilistic construction of small strongly sum-free sets via large Sidon sets Colloq. Math. 86, No. 2, 171 - 176, 2000 \cite{BALTZ:00A} B. Doerr and A. S.: Multi-color discrepancy of higher-dimensional arithmetic progressions Preprint, 2000, zur Veröffentlichung eingereicht \cite{DOERR:00D> 2001 N. Ahuja and A. S.: Improved approximation algorithms for hypergraph coloring and resource constrained scheduling Preprint, 2001, zur Veröffentlichung eingereicht \cite{AHUJA:01A} B. Doerr and A. S.: Recursive randomized coloring beats fair dice random coloring Extended Abstract in: Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science (STACS01), Springer LNCS 2010, 183 - 194, 2001 \cite{DOERR:01B} B. Doerr and A. S. : Multi-color discrepancies Preprint, 2001, zur Publikation eingereicht. \cite{DOERR:01H} C. Gröpl and H. J. Prömel and A. S.: On the evolution of the worst-case OBDD size Information Processing Letters 77, 1 - 7, 2001 \cite{GROEPL:01A} A. Baltz and T. Schoen and A. S.: Probabilistic analysis of bipartite traveling salesman problems Extended Abstract in: Electronic Notes in Discrete Mathematics, Proceedings of the Brasilian Symp. on Graphs and Combinatorics, Fortaleza, 2001 \cite{BALTZ:01B} A. Baltz and T. Schoen and A. S.: On the b-partite random asymmetric traveling salesman problem and its assignment relaxation Preprint, 2001 \cite{BALTZ:01D} C. Michel and H. Schroeter and A. S.: Approximation algorithms for pick-and-place robots Preprint, 2001 \cite{MICHEL:01A} A. S.: Derandomization in Combinatorial Optimization Kapitel im Handbook of Randomization, eds.: Pardalos, Rajasekaran, Reif, Rolim Kluwer Verlag, 2001 \cite{SRIVASTAV:01A} ->[Gliederung] Mail an WebMaster [Thu Mai 10 13:07:28 MET 2001] Impressum