AAAAAA

   
Results: 1-17 |
Results: 17
FORCED CONVEX N-GONS IN THE PLANE
Authors: CHUNG FRK GRAHAM RL
Citation: Frk. Chung et Rl. Graham, FORCED CONVEX N-GONS IN THE PLANE, Discrete & computational geometry, 19(3), 1998, pp. 367-371
STRATIFIED RANDOM-WALKS ON THE N-CUBE
Authors: CHUNG FRK GRAHAM RL
Citation: Frk. Chung et Rl. Graham, STRATIFIED RANDOM-WALKS ON THE N-CUBE, Random structures & algorithms, 11(3), 1997, pp. 199-222
OPEN PROBLEMS OF ERDOS,PAUL IN GRAPH-THEORY
Authors: CHUNG FRK
Citation: Frk. Chung, OPEN PROBLEMS OF ERDOS,PAUL IN GRAPH-THEORY, Journal of graph theory, 25(1), 1997, pp. 3-36
ON OPTIMAL STRATEGIES FOR CYCLE-STEALING IN NETWORKS OF WORKSTATIONS
Authors: BHATT SN CHUNG FRK LEIGHTON FT ROSENBERG AL
Citation: Sn. Bhatt et al., ON OPTIMAL STRATEGIES FOR CYCLE-STEALING IN NETWORKS OF WORKSTATIONS, I.E.E.E. transactions on computers, 46(5), 1997, pp. 545-557
ON SAMPLING WITH MARKOV-CHAINS
Authors: CHUNG FRK GRAHAM RL YAU ST
Citation: Frk. Chung et al., ON SAMPLING WITH MARKOV-CHAINS, Random structures & algorithms, 9(1-2), 1996, pp. 55-77
OPTIMAL EMULATIONS BY BUTTERFLY-LIKE NETWORKS
Authors: BHATT SN CHUNG FRK HONG JW LEIGHTON FT OBRENIC B ROSENBERG AL SCHWABE EJ
Citation: Sn. Bhatt et al., OPTIMAL EMULATIONS BY BUTTERFLY-LIKE NETWORKS, Journal of the ACM, 43(2), 1996, pp. 293-330
SCHEDULING TREE-DAGS USING FIFO QUEUES - A CONTROL-MEMORY TRADE-OFF
Authors: BHATT SN CHUNG FRK LEIGHTON FT ROSENBERG AL
Citation: Sn. Bhatt et al., SCHEDULING TREE-DAGS USING FIFO QUEUES - A CONTROL-MEMORY TRADE-OFF, Journal of parallel and distributed computing, 33(1), 1996, pp. 55-68
OPTICAL WAVELENGTH ROUTING, TRANSLATION, AND PACKET CELL SWITCHED NETWORKS/
Authors: BALA K CHUNG FRK BRACKETT CA
Citation: K. Bala et al., OPTICAL WAVELENGTH ROUTING, TRANSLATION, AND PACKET CELL SWITCHED NETWORKS/, Journal of lightwave technology, 14(3), 1996, pp. 336-343
A COMBINATORIAL LAPLACIAN WITH VERTEX WEIGHTS
Authors: CHUNG FRK LANGLANDS RP
Citation: Frk. Chung et Rp. Langlands, A COMBINATORIAL LAPLACIAN WITH VERTEX WEIGHTS, J COMB TH A, 75(2), 1996, pp. 316-327
UPPER-BOUNDS FOR EIGENVALUES OF THE DISCRETE AND CONTINUOUS LAPLACE OPERATORS
Authors: CHUNG FRK GRIGORYAN A YAU ST
Citation: Frk. Chung et al., UPPER-BOUNDS FOR EIGENVALUES OF THE DISCRETE AND CONTINUOUS LAPLACE OPERATORS, Advances in mathematics, 117(2), 1996, pp. 165-178
SALVAGE-EMBEDDINGS OF COMPLETE TREES
Authors: BHATT SN CHUNG FRK LEIGHTON FT ROSENBERG AL
Citation: Sn. Bhatt et al., SALVAGE-EMBEDDINGS OF COMPLETE TREES, SIAM journal on discrete mathematics, 8(4), 1995, pp. 617-637
ON THE COVER POLYNOMIAL OF A DIGRAPH
Authors: CHUNG FRK GRAHAM RL
Citation: Frk. Chung et Rl. Graham, ON THE COVER POLYNOMIAL OF A DIGRAPH, J COMB TH B, 65(2), 1995, pp. 273-290
AN UPPER BOUND ON THE DIAMETER OF A GRAPH FROM EIGENVALUES ASSOCIATEDWITH ITS LAPLACIAN
Authors: CHUNG FRK FABER V MANTEUFFEL TA
Citation: Frk. Chung et al., AN UPPER BOUND ON THE DIAMETER OF A GRAPH FROM EIGENVALUES ASSOCIATEDWITH ITS LAPLACIAN, SIAM journal on discrete mathematics, 7(3), 1994, pp. 443-457
EVEN CYCLES IN DIRECTED-GRAPHS
Authors: CHUNG FRK GODDARD W KLEITMAN DJ
Citation: Frk. Chung et al., EVEN CYCLES IN DIRECTED-GRAPHS, SIAM journal on discrete mathematics, 7(3), 1994, pp. 474-483
ROUTING PERMUTATIONS ON GRAPHS VIA MATCHINGS
Authors: ALON N CHUNG FRK GRAHAM RL
Citation: N. Alon et al., ROUTING PERMUTATIONS ON GRAPHS VIA MATCHINGS, SIAM journal on discrete mathematics, 7(3), 1994, pp. 513-530
RELIABLE SOFTWARE AND COMMUNICATION .1. AN OVERVIEW
Authors: CHUNG FRK
Citation: Frk. Chung, RELIABLE SOFTWARE AND COMMUNICATION .1. AN OVERVIEW, IEEE journal on selected areas in communications, 12(1), 1994, pp. 23-32
CHORDAL COMPLETIONS OF PLANAR GRAPHS
Authors: CHUNG FRK MUMFORD D
Citation: Frk. Chung et D. Mumford, CHORDAL COMPLETIONS OF PLANAR GRAPHS, J COMB TH B, 62(1), 1994, pp. 96-106
Risultati: 1-17 |