Charles M. Newman

List of publications from the DBLP Bibliography Server - FAQ

1999

4 S. Nanda, Charles M. Newman: Random nearest neighbor and influence graphs on Z^d. Random Struct. Algorithms 15(3-4): 262-278 (1999)

3 Michael Aizenman, Almut Burchard, Charles M. Newman, David Bruce Wilson: Scaling limits for minimal and random spanning trees in two dimensions. Random Struct. Algorithms 15(3-4): 319-367 (1999)

1992

2 Charles M. Newman: Chain Lengths in Certain Random Directed Graphs. Random Struct. Algorithms 3(3): 243-254 (1992)

1988

1 EE Charles M. Newman: Memory capacity in neural network models: Rigorous lower bounds. Neural Networks 1(3): 223-238 (1988)

1999
4		S. Nanda, Charles M. Newman: Random nearest neighbor and influence graphs on Z^d. Random Struct. Algorithms 15(3-4): 262-278 (1999)
3		Michael Aizenman, Almut Burchard, Charles M. Newman, David Bruce Wilson: Scaling limits for minimal and random spanning trees in two dimensions. Random Struct. Algorithms 15(3-4): 319-367 (1999)
1992
2		Charles M. Newman: Chain Lengths in Certain Random Directed Graphs. Random Struct. Algorithms 3(3): 243-254 (1992)
1988
1	EE	Charles M. Newman: Memory capacity in neural network models: Rigorous lower bounds. Neural Networks 1(3): 223-238 (1988)

Coauthor Index