Alfred Lichtenstein with his daughter Sylvia; Buenos Aires.

Digital Image

Alfred Lichtenstein with his first wife Gerda and their daughter Sylvia seated on a park bench; Buenos Aires.

Digital Image

Alfred Lichtenstein with his first wife Gerda; Parque Palermo, Buenos Aires.

Digital Image

Portrait of Alfred Lichtenstein's second wife Georgette Wegh; New York.

Digital Image

Portrait of Alfred Lichtenstein's second wife Georgette Wegh; Berlin.

Handwritten dedication signed by Georgette Wegh

Pianist Heida Hermanns née Goldschmidt seated at a piano; Berlin Portraits Women

Digital Image

Studio portrait of infant twins Beatrice and Fred Herz (l-r).

The Herz twins were born 4 February 1913

Studio portrait of Nanny Stern (Oberglen) at eighty-four years old; Frankfurt.

Grandmother of Fred Herz; Born 27 September 1845, died 9 May 1929

Alfred Lichtenstein with his first wife Gerda; Parque Palermo, Buenos Aires.

Digital Image

Studio portraits of Alfred Lichtenstein with his flute; New York.

Digital Image

Charlotte (Lotte) Engel Portraits Women

Digital Image

Studio portraits of Charlotte (Lotte) Engel as a young child Portraits Children

Digital Image

Optimal Interconnections in the Design of Microprocessors and Digital Systems

This paper recasts the multiple data path assignment problem solved by Torng and Wilhelm by the dynamic programming method [1] into a minimal covering problem following a switching theoretic approach. The concept of bus compatibility for the data transfers is used to obtain the various ways of interconnecting the circuit modules with the minimum number of buses that allow concurrent data transfers. These have been called the feasible solutions of the problem. The minimal cost solutions are obtained by assigning weights to the bus-compatible sets present in the feasible solutions. Minimization of the cost of the solution by increasing the number of buses is also discussed.

Optimal Interconnections in the Design of Microprocessors and Digital Systems

This paper recasts the multiple data path assignment problem solved by Torng and Wilhelm by the dynamic programming method [1] into a minimal covering problem following a switching theoretic approach. The concept of bus compatibility for the data transfers is used to obtain the various ways of interconnecting the circuit modules with the minimum number of buses that allow concurrent data transfers. These have been called the feasible solutions of the problem. The minimal cost solutions are obtained by assigning weights to the bus-compatible sets present in the feasible solutions. Minimization of the cost of the solution by increasing the number of buses is also discussed.

AHC interview with Gloria Gray Katz.

June 7, 2010