Shen Lin - Revision history

Sligocki: Add MathSciNet profile link

2025-12-05T18:54:54Z

Add MathSciNet profile link

← Older revision		Revision as of 18:54, 5 December 2025
Line 42:		Line 42:
	* [https://www.latimes.com/archives/la-xpm-1985-06-17-me-12632-story.html Just Keep Going]. Los Angeles Times. 17 Jun 1985.		* [https://www.latimes.com/archives/la-xpm-1985-06-17-me-12632-story.html Just Keep Going]. Los Angeles Times. 17 Jun 1985.
	* Gina Kolata. [https://www.nytimes.com/1991/03/12/science/math-problem-long-baffling-slowly-yields.html?unlocked_article_code=1.6E8.AEwE.jaDb4TjR2e0j&smid=url-share Math Problem, Long Baffling, Slowly Yields]. The New York Times. 12 Mar 1991. Section C. Page 1.		* Gina Kolata. [https://www.nytimes.com/1991/03/12/science/math-problem-long-baffling-slowly-yields.html?unlocked_article_code=1.6E8.AEwE.jaDb4TjR2e0j&smid=url-share Math Problem, Long Baffling, Slowly Yields]. The New York Times. 12 Mar 1991. Section C. Page 1.
			* [https://mathscinet.ams.org/mathscinet/author?authorId=214504 Shen Lin] on [[Wikipedia:MathSciNet\|MathSciNet]]

	[[Category:People]]		[[Category:People]]

Sligocki: /* Bibliography */ Added articles from https://mathscinet.ams.org/mathscinet/author?authorId=214504

2025-12-05T18:49:47Z

Bibliography: Added articles from https://mathscinet.ams.org/mathscinet/author?authorId=214504

Sligocki: Add Erdos number / Graham factoid

2025-12-05T18:32:01Z

Add Erdos number / Graham factoid

← Older revision		Revision as of 18:32, 5 December 2025
Line 11:		Line 11:
	<blockquote>		<blockquote>
	Shen Lin thought of calling them PET problems, as he likes to work on them (e.g. the traveling salesman problem) in spite of their difficulty. He points out that PET stands for "probably exponential time". But if this gets proved, PET stands for "provably exponential time". And if the proof goes the other way, it stands for "previously exponential time".		Shen Lin thought of calling them PET problems, as he likes to work on them (e.g. the traveling salesman problem) in spite of their difficulty. He points out that PET stands for "probably exponential time". But if this gets proved, PET stands for "provably exponential time". And if the proof goes the other way, it stands for "previously exponential time".
	</blockquote>		</blockquote>Shen Lin published a paper with his father, Chio-Shih Lin, and [[Wikipedia:Ronald Graham\|Ronald Graham]],<ref>Ronald L. Graham, Shen Lin & Chio-Shih Lin (1978). Spectra of Numbers. Mathematics Magazine, 51(3), 174–176. {{doi\|10.1080/0025570X.1978.11976703}}</ref> giving them both an [[Wikipedia:Erdős number\|Erdős number]] of 2.

	== Personal Life ==		== Personal Life ==
Line 31:		Line 31:
	* Hwang, F.K., & Lin, S. (1976). Construction of 2-balanced (n,k,λ) arrays. Pacific Journal of Mathematics, 64, 437-453. {{doi\|10.2140/pjm.1976.64.437}}		* Hwang, F.K., & Lin, S. (1976). Construction of 2-balanced (n,k,λ) arrays. Pacific Journal of Mathematics, 64, 437-453. {{doi\|10.2140/pjm.1976.64.437}}
	* F.K Hwang, S Lin. Neighbor designs. Journal of Combinatorial Theory, Series A, Volume 23, Issue 3, 1977, Pages 302-313. {{doi\|10.1016/0097-3165(77)90021-8}}		* F.K Hwang, S Lin. Neighbor designs. Journal of Combinatorial Theory, Series A, Volume 23, Issue 3, 1977, Pages 302-313. {{doi\|10.1016/0097-3165(77)90021-8}}
	* Ronald L. Graham, Shen Lin & Chio-Shih Lin (1978). Spectra of Numbers. Mathematics Magazine, 51(3), 174–176. {{doi\|10.1080/0025570X.1978.11976703}}
	* F.K. Hwang, S. Lin. Distribution of integers into k-tuples with prescribed conditions. Journal of Combinatorial Theory, Series A, Volume 25, Issue 2, 1978, Pages 105-116. {{doi\|10.1016/0097-3165(78)90073-0}}		* F.K. Hwang, S. Lin. Distribution of integers into k-tuples with prescribed conditions. Journal of Combinatorial Theory, Series A, Volume 25, Issue 2, 1978, Pages 105-116. {{doi\|10.1016/0097-3165(78)90073-0}}
	* Hwang, F.K. and Lin, S. (1979), On the construction of balanced switching networks. Networks, 9: 283-307. {{doi\|10.1002/net.3230090402}}		* Hwang, F.K. and Lin, S. (1979), On the construction of balanced switching networks. Networks, 9: 283-307. {{doi\|10.1002/net.3230090402}}

Sligocki: /* Bibliography */ Add some more publications from https://www.semanticscholar.org/author/Shen-Lin/2108776742

2025-12-05T18:21:36Z

Bibliography: Add some more publications from https://www.semanticscholar.org/author/Shen-Lin/2108776742

Sligocki: /* Bibliography */ Add article with Ron Graham

2025-12-05T18:11:23Z

Bibliography: Add article with Ron Graham

← Older revision		Revision as of 18:11, 5 December 2025
Line 30:		Line 30:
	* F.K Hwang, S Lin. Neighbor designs. Journal of Combinatorial Theory, Series A, Volume 23, Issue 3, 1977, Pages 302-313. {{doi\|10.1016/0097-3165(77)90021-8}}		* F.K Hwang, S Lin. Neighbor designs. Journal of Combinatorial Theory, Series A, Volume 23, Issue 3, 1977, Pages 302-313. {{doi\|10.1016/0097-3165(77)90021-8}}
	* F.K. Hwang, S. Lin. Distribution of integers into k-tuples with prescribed conditions. Journal of Combinatorial Theory, Series A, Volume 25, Issue 2, 1978, Pages 105-116. {{doi\|10.1016/0097-3165(78)90073-0}}		* F.K. Hwang, S. Lin. Distribution of integers into k-tuples with prescribed conditions. Journal of Combinatorial Theory, Series A, Volume 25, Issue 2, 1978, Pages 105-116. {{doi\|10.1016/0097-3165(78)90073-0}}
			* Ronald L. Graham, Shen Lin & Chio-Shih Lin (1978). Spectra of Numbers. Mathematics Magazine, 51(3), 174–176. {{doi\|10.1080/0025570X.1978.11976703}}
	* Hwang, F.K. and Lin, S. (1979), On the construction of balanced switching networks. Networks, 9: 283-307. {{doi\|10.1002/net.3230090402}}		* Hwang, F.K. and Lin, S. (1979), On the construction of balanced switching networks. Networks, 9: 283-307. {{doi\|10.1002/net.3230090402}}
	* G.J. Chang, F.K. Hwang, S. Lin. Group testing with two defectives. Discrete Applied Mathematics, Volume 4, Issue 2, 1982, Pages 97-102. {{doi\|10.1016/0166-218X(82)90067-1}}		* G.J. Chang, F.K. Hwang, S. Lin. Group testing with two defectives. Discrete Applied Mathematics, Volume 4, Issue 2, 1982, Pages 97-102. {{doi\|10.1016/0166-218X(82)90067-1}}

Sligocki: /* References */ Add small LA Times article.

2025-12-04T21:19:50Z

References: Add small LA Times article.

← Older revision		Revision as of 21:19, 4 December 2025
Line 35:		Line 35:
	== References ==		== References ==
	<references />		<references />
			* [https://www.latimes.com/archives/la-xpm-1985-06-17-me-12632-story.html Just Keep Going]. Los Angeles Times. 17 Jun 1985.
	* Gina Kolata. [https://www.nytimes.com/1991/03/12/science/math-problem-long-baffling-slowly-yields.html?unlocked_article_code=1.6E8.AEwE.jaDb4TjR2e0j&smid=url-share Math Problem, Long Baffling, Slowly Yields]. The New York Times. 12 Mar 1991. Section C. Page 1.		* Gina Kolata. [https://www.nytimes.com/1991/03/12/science/math-problem-long-baffling-slowly-yields.html?unlocked_article_code=1.6E8.AEwE.jaDb4TjR2e0j&smid=url-share Math Problem, Long Baffling, Slowly Yields]. The New York Times. 12 Mar 1991. Section C. Page 1.

	[[Category:People]]		[[Category:People]]

Sligocki: Remove redundant mention of liking hard problems.

2025-12-04T21:08:06Z

Remove redundant mention of liking hard problems.

← Older revision		Revision as of 21:08, 4 December 2025
Line 7:		Line 7:
	</blockquote>		</blockquote>

	~~Lin appears to have been drawn specifically to work on known hard problems in general.~~ In a 1974 article discussing terminology for what would eventually become known as [[wikipedia:NP-hardness\|NP-hard]], [[wikipedia:Donald_Knuth\|Donald Knuth]] writes:<ref>D. E. Knuth. 1974. A terminological proposal. SIGACT News 6, 1 (January 1974), 12–18. {{doi\|10.1145/1811129.1811130}}</ref>		In a 1974 article discussing terminology for what would eventually become known as [[wikipedia:NP-hardness\|NP-hard]], [[wikipedia:Donald_Knuth\|Donald Knuth]] writes:<ref>D. E. Knuth. 1974. A terminological proposal. SIGACT News 6, 1 (January 1974), 12–18. {{doi\|10.1145/1811129.1811130}}</ref>

	<blockquote>		<blockquote>

Sligocki: Add quote from Kernighan

2025-12-04T21:07:28Z

Add quote from Kernighan

← Older revision		Revision as of 21:07, 4 December 2025
Line 1:		Line 1:
	'''Shen Lin''' was an early Busy Beaver researcher. He was a graduate student of [[Tibor Radó]] at [[wikipedia:Ohio_State_University\|Ohio State University]] and solved [[BB(3)]] in his PhD dissertation there.<ref name="phd_thesis">Shen Lin. 1963. Computer studies of Turing machine problems. PhD dissertation. Ohio State University. [http://rave.ohiolink.edu/etdc/view?acc_num=osu1486554418657614]</ref> He was the first to describe [[Translated Cyclers]] (which he called "partial recurrence") and to publish an algorithm to detect them.		'''Shen Lin''' was an early Busy Beaver researcher. He was a graduate student of [[Tibor Radó]] at [[wikipedia:Ohio_State_University\|Ohio State University]] and solved [[BB(3)]] in his PhD dissertation there.<ref name="phd_thesis">Shen Lin. 1963. Computer studies of Turing machine problems. PhD dissertation. Ohio State University. [http://rave.ohiolink.edu/etdc/view?acc_num=osu1486554418657614]</ref> He was the first to describe [[Translated Cyclers]] (which he called "partial recurrence") and to publish an algorithm to detect them.

	After graduating, he worked at [[wikipedia:Bell_Labs\|Bell Labs]] where he researched ~~heuristics for solving~~ hard problems. ~~Ex: the~~ [[wikipedia:~~Lin–Kernighan_heuristic~~\|~~Lin–Kernighan heuristic~~]] ~~for~~ the [[wikipedia:~~Travelling_salesman_problem~~\|~~traveling salesman problem~~]]<ref>~~Lin, Shen;~~ Kernighan, B. W. (~~1973~~). "An ~~Effective Heuristic Algorithm~~ for ~~the Traveling-Salesman Problem~~". ~~Operations Research~~. 21 (2): ~~498–516~~. {{doi\|10.~~1287~~/~~opre~~.21.2.~~498~~}}</ref> and the [[wikipedia:~~Kernighan–Lin_algorithm~~\|~~Kernighan–Lin algorithm~~]] for ~~graph partitioning.~~<ref>Kernighan, B. W.~~; Lin, Shen~~ (~~1970~~). "An ~~efficient heuristic procedure~~ for ~~partitioning graphs~~". ~~Bell System Technical Journal~~. 49 (2): ~~291–307~~. {{doi\|10.~~1002~~/j.~~1538-7305~~.~~1970~~.~~tb01770.x~~}}</ref> ~~Both were co-authored~~ with [~~[wikipedia~~:~~Brian_Kernighan\|~~Brian Kernighan]] of ~~K&R C fame~~.		After graduating, he worked at [[wikipedia:Bell_Labs\|Bell Labs]] where he researched heuristic solutions to hard problems. He collaborated with [[wikipedia:Brian_Kernighan\|Brian Kernighan]] on the [[wikipedia:Kernighan–Lin_algorithm\|Kernighan–Lin algorithm]] for graph partitioning.<ref>Kernighan, B. W.; Lin, Shen (1970). "An efficient heuristic procedure for partitioning graphs". Bell System Technical Journal. 49 (2): 291–307. {{doi\|10.1002/j.1538-7305.1970.tb01770.x}}</ref> and the [[wikipedia:Lin–Kernighan_heuristic\|Lin–Kernighan heuristic]] for the [[wikipedia:Travelling_salesman_problem\|traveling salesman problem]]<ref>Lin, Shen; Kernighan, B. W. (1973). "An Effective Heuristic Algorithm for the Traveling-Salesman Problem". Operations Research. 21 (2): 498–516. {{doi\|10.1287/opre.21.2.498}}</ref>. In a 2003 interview with Kernighan, he said:<ref>Aleksey Dolya. [https://www.linuxjournal.com/article/7035 Interview with Brian Kernighan]. Linux Journal. 29 Jul 2003.</ref>

			<blockquote>
			I went back to Bell Labs the summer after that. This time, I got lucky and worked with Shen Lin, a great mathematician and problem solver. Shen was interested in hard combinatorial optimization problems, such as the Traveling Salesman Problem. I had been working in a casual way on what came to be called the graph partitioning problem for my Princeton thesis. Shen had an idea of how to attack the general case, and I made the algorithm work in a Fortran program. It became the core of my thesis, along with some other special cases.
			</blockquote>

	Lin appears to have been drawn specifically to work on known hard problems in general. In a 1974 article discussing terminology for what would eventually become known as [[wikipedia:NP-hardness\|NP-hard]], [[wikipedia:Donald_Knuth\|Donald Knuth]] writes:<ref>D. E. Knuth. 1974. A terminological proposal. SIGACT News 6, 1 (January 1974), 12–18. {{doi\|10.1145/1811129.1811130}}</ref>		Lin appears to have been drawn specifically to work on known hard problems in general. In a 1974 article discussing terminology for what would eventually become known as [[wikipedia:NP-hardness\|NP-hard]], [[wikipedia:Donald_Knuth\|Donald Knuth]] writes:<ref>D. E. Knuth. 1974. A terminological proposal. SIGACT News 6, 1 (January 1974), 12–18. {{doi\|10.1145/1811129.1811130}}</ref>

RobinCodes: /* Personal Life */ Small grammar fix

2025-12-04T21:06:33Z

Personal Life: Small grammar fix

← Older revision		Revision as of 21:06, 4 December 2025
Line 10:		Line 10:

	== Personal Life ==		== Personal Life ==
	Shen Lin was born in Amoy ([[wikipedia:Xiamen\|Xiamen]]), China on 4 Feb 1931, the eldest son of Shui-Hsian Wang and Chio-Shih Lin.<ref name="autobio">Autobiography included in his PhD dissertation.</ref> He had a younger brother (born ~1932) and sister (born ~1939).<ref name="lantern" /> His family emigrated to the Philippines before World War II during the [[wikipedia:History_of_the_Philippines_(1898–1946)\|American colonial period]] where ~~the~~ lived in [[wikipedia:Quezon_City\|Quezon City]].<ref name="lantern">Mary Alice Richardson. "[https://osupublicationarchives.osu.edu/?a=d&d=LTN19540526-01.2.52 Father, Son Study Here]". [[wikipedia:The_Lantern\|The Lantern]]. 26 May 1954. Page 7.</ref> He studied at [[wikipedia:University_of_the_Philippines\|University of the Philippines]] where his father Chio-Shih Lin was an associate professor (since 1939)<ref name="lantern" /> and earned his BS in Math there in 1951.<ref name="autobio" /> He came to the United States in 1952 to study at Ohio State University where he took graduate courses alongside his father<ref name="lantern" /> and earned a PhD in Math in 1963 under Tibor Radó. He worked at at Bell Labs starting in Oct 1963.<ref name="autobio" />		Shen Lin was born in Amoy ([[wikipedia:Xiamen\|Xiamen]]), China on 4 Feb 1931, the eldest son of Shui-Hsian Wang and Chio-Shih Lin.<ref name="autobio">Autobiography included in his PhD dissertation.</ref> He had a younger brother (born ~1932) and sister (born ~1939).<ref name="lantern" /> His family emigrated to the Philippines before World War II during the [[wikipedia:History_of_the_Philippines_(1898–1946)\|American colonial period]] where they lived in [[wikipedia:Quezon_City\|Quezon City]].<ref name="lantern">Mary Alice Richardson. "[https://osupublicationarchives.osu.edu/?a=d&d=LTN19540526-01.2.52 Father, Son Study Here]". [[wikipedia:The_Lantern\|The Lantern]]. 26 May 1954. Page 7.</ref> He studied at [[wikipedia:University_of_the_Philippines\|University of the Philippines]] where his father Chio-Shih Lin was an associate professor (since 1939)<ref name="lantern" /> and earned his BS in Math there in 1951.<ref name="autobio" /> He came to the United States in 1952 to study at Ohio State University where he took graduate courses alongside his father<ref name="lantern" /> and earned a PhD in Math in 1963 under Tibor Radó. He worked at at Bell Labs starting in Oct 1963.<ref name="autobio" />

	In 1956 he married Mona L. Lo in Columbus, Ohio and (as of 1963) they had 3 children: John (born ~1957), David (born ~1959) and Robert (born ~1961). He became a naturalized US citizen in 1961.<ref name="autobio" />		In 1956 he married Mona L. Lo in Columbus, Ohio and (as of 1963) they had 3 children: John (born ~1957), David (born ~1959) and Robert (born ~1961). He became a naturalized US citizen in 1961.<ref name="autobio" />

Sligocki: /* Bibliography */ Add a couple more articles

2025-12-04T21:00:29Z

Bibliography: Add a couple more articles

← Older revision		Revision as of 21:00, 4 December 2025
Line 18:		Line 18:
	== Bibliography ==		== Bibliography ==
	* Shen Lin and Tibor Rado. 1965. Computer Studies of Turing Machine Problems. J. ACM 12, 2 (April 1965), 196–212. {{doi\|10.1145/321264.321270}}		* Shen Lin and Tibor Rado. 1965. Computer Studies of Turing Machine Problems. J. ACM 12, 2 (April 1965), 196–212. {{doi\|10.1145/321264.321270}}
			* S. Lin, "Computer solutions of the traveling salesman problem," in The Bell System Technical Journal, vol. 44, no. 10, pp. 2245-2269, Dec. 1965, {{doi\|10.1002/j.1538-7305.1965.tb04146.x}}
	* Hwang, F.K., Lin, S. Optimal merging of 2 elements with ''n'' elements. ''Acta Informatica'' 1, 145–158 (1971). {{doi\|10.1007/BF00289521}}		* Hwang, F.K., Lin, S. Optimal merging of 2 elements with ''n'' elements. ''Acta Informatica'' 1, 145–158 (1971). {{doi\|10.1007/BF00289521}}
	* F. K. Hwang and S. Lin. 1972. A Simple Algorithm for Merging Two Disjoint Linearly Ordered Sets. SIAM Journal on Computing. Pages 31-39. {{doi\|10.1137/0201004}}		* F. K. Hwang and S. Lin. 1972. A Simple Algorithm for Merging Two Disjoint Linearly Ordered Sets. SIAM Journal on Computing. Pages 31-39. {{doi\|10.1137/0201004}}
	* F. K. Hwang and S. Lin. 1973. Hypergeometric group testing algorithms. In Proceedings of the June 4-8, 1973, national computer conference and exposition (AFIPS '73). Association for Computing Machinery, New York, NY, USA, 452. {{doi\|10.1145/1499586.1499700}}		* F. K. Hwang and S. Lin. 1973. Hypergeometric group testing algorithms. In Proceedings of the June 4-8, 1973, national computer conference and exposition (AFIPS '73). Association for Computing Machinery, New York, NY, USA, 452. {{doi\|10.1145/1499586.1499700}}
	* F.K Hwang, S Lin. A direct method to construct triple systems. Journal of Combinatorial Theory, Series A. Volume 17, Issue 1, 1974, Pages 84-94. {{doi\|10.1016/0097-3165(74)90030-2}}		* F.K Hwang, S Lin. A direct method to construct triple systems. Journal of Combinatorial Theory, Series A. Volume 17, Issue 1, 1974, Pages 84-94. {{doi\|10.1016/0097-3165(74)90030-2}}
			* S. Lin. 1975. Heuristic Programming as an Aid to Network Design. Netw. 5, 1 (January 1975), 33–43. {{doi\|10.1002/net.1975.5.1.33}}
	* F.K Hwang, S Lin. Neighbor designs. Journal of Combinatorial Theory, Series A, Volume 23, Issue 3, 1977, Pages 302-313. {{doi\|10.1016/0097-3165(77)90021-8}}		* F.K Hwang, S Lin. Neighbor designs. Journal of Combinatorial Theory, Series A, Volume 23, Issue 3, 1977, Pages 302-313. {{doi\|10.1016/0097-3165(77)90021-8}}
	* F.K. Hwang, S. Lin. Distribution of integers into k-tuples with prescribed conditions. Journal of Combinatorial Theory, Series A, Volume 25, Issue 2, 1978, Pages 105-116. {{doi\|10.1016/0097-3165(78)90073-0}}		* F.K. Hwang, S. Lin. Distribution of integers into k-tuples with prescribed conditions. Journal of Combinatorial Theory, Series A, Volume 25, Issue 2, 1978, Pages 105-116. {{doi\|10.1016/0097-3165(78)90073-0}}

← Older revision		Revision as of 18:11, 5 December 2025
Line 30:		Line 30:
	* F.K Hwang, S Lin. Neighbor designs. Journal of Combinatorial Theory, Series A, Volume 23, Issue 3, 1977, Pages 302-313. {{doi\|10.1016/0097-3165(77)90021-8}}		* F.K Hwang, S Lin. Neighbor designs. Journal of Combinatorial Theory, Series A, Volume 23, Issue 3, 1977, Pages 302-313. {{doi\|10.1016/0097-3165(77)90021-8}}
	* F.K. Hwang, S. Lin. Distribution of integers into k-tuples with prescribed conditions. Journal of Combinatorial Theory, Series A, Volume 25, Issue 2, 1978, Pages 105-116. {{doi\|10.1016/0097-3165(78)90073-0}}		* F.K. Hwang, S. Lin. Distribution of integers into k-tuples with prescribed conditions. Journal of Combinatorial Theory, Series A, Volume 25, Issue 2, 1978, Pages 105-116. {{doi\|10.1016/0097-3165(78)90073-0}}
			* Ronald L. Graham, Shen Lin & Chio-Shih Lin (1978). Spectra of Numbers. Mathematics Magazine, 51(3), 174–176. {{doi\|10.1080/0025570X.1978.11976703}}
	* Hwang, F.K. and Lin, S. (1979), On the construction of balanced switching networks. Networks, 9: 283-307. {{doi\|10.1002/net.3230090402}}		* Hwang, F.K. and Lin, S. (1979), On the construction of balanced switching networks. Networks, 9: 283-307. {{doi\|10.1002/net.3230090402}}
	* G.J. Chang, F.K. Hwang, S. Lin. Group testing with two defectives. Discrete Applied Mathematics, Volume 4, Issue 2, 1982, Pages 97-102. {{doi\|10.1016/0166-218X(82)90067-1}}		* G.J. Chang, F.K. Hwang, S. Lin. Group testing with two defectives. Discrete Applied Mathematics, Volume 4, Issue 2, 1982, Pages 97-102. {{doi\|10.1016/0166-218X(82)90067-1}}

← Older revision		Revision as of 21:00, 4 December 2025
Line 18:		Line 18:
	== Bibliography ==		== Bibliography ==
	* Shen Lin and Tibor Rado. 1965. Computer Studies of Turing Machine Problems. J. ACM 12, 2 (April 1965), 196–212. {{doi\|10.1145/321264.321270}}		* Shen Lin and Tibor Rado. 1965. Computer Studies of Turing Machine Problems. J. ACM 12, 2 (April 1965), 196–212. {{doi\|10.1145/321264.321270}}
			* S. Lin, "Computer solutions of the traveling salesman problem," in The Bell System Technical Journal, vol. 44, no. 10, pp. 2245-2269, Dec. 1965, {{doi\|10.1002/j.1538-7305.1965.tb04146.x}}
	* Hwang, F.K., Lin, S. Optimal merging of 2 elements with ''n'' elements. ''Acta Informatica'' 1, 145–158 (1971). {{doi\|10.1007/BF00289521}}		* Hwang, F.K., Lin, S. Optimal merging of 2 elements with ''n'' elements. ''Acta Informatica'' 1, 145–158 (1971). {{doi\|10.1007/BF00289521}}
	* F. K. Hwang and S. Lin. 1972. A Simple Algorithm for Merging Two Disjoint Linearly Ordered Sets. SIAM Journal on Computing. Pages 31-39. {{doi\|10.1137/0201004}}		* F. K. Hwang and S. Lin. 1972. A Simple Algorithm for Merging Two Disjoint Linearly Ordered Sets. SIAM Journal on Computing. Pages 31-39. {{doi\|10.1137/0201004}}
	* F. K. Hwang and S. Lin. 1973. Hypergeometric group testing algorithms. In Proceedings of the June 4-8, 1973, national computer conference and exposition (AFIPS '73). Association for Computing Machinery, New York, NY, USA, 452. {{doi\|10.1145/1499586.1499700}}		* F. K. Hwang and S. Lin. 1973. Hypergeometric group testing algorithms. In Proceedings of the June 4-8, 1973, national computer conference and exposition (AFIPS '73). Association for Computing Machinery, New York, NY, USA, 452. {{doi\|10.1145/1499586.1499700}}
	* F.K Hwang, S Lin. A direct method to construct triple systems. Journal of Combinatorial Theory, Series A. Volume 17, Issue 1, 1974, Pages 84-94. {{doi\|10.1016/0097-3165(74)90030-2}}		* F.K Hwang, S Lin. A direct method to construct triple systems. Journal of Combinatorial Theory, Series A. Volume 17, Issue 1, 1974, Pages 84-94. {{doi\|10.1016/0097-3165(74)90030-2}}
			* S. Lin. 1975. Heuristic Programming as an Aid to Network Design. Netw. 5, 1 (January 1975), 33–43. {{doi\|10.1002/net.1975.5.1.33}}
	* F.K Hwang, S Lin. Neighbor designs. Journal of Combinatorial Theory, Series A, Volume 23, Issue 3, 1977, Pages 302-313. {{doi\|10.1016/0097-3165(77)90021-8}}		* F.K Hwang, S Lin. Neighbor designs. Journal of Combinatorial Theory, Series A, Volume 23, Issue 3, 1977, Pages 302-313. {{doi\|10.1016/0097-3165(77)90021-8}}
	* F.K. Hwang, S. Lin. Distribution of integers into k-tuples with prescribed conditions. Journal of Combinatorial Theory, Series A, Volume 25, Issue 2, 1978, Pages 105-116. {{doi\|10.1016/0097-3165(78)90073-0}}		* F.K. Hwang, S. Lin. Distribution of integers into k-tuples with prescribed conditions. Journal of Combinatorial Theory, Series A, Volume 25, Issue 2, 1978, Pages 105-116. {{doi\|10.1016/0097-3165(78)90073-0}}

← Older revision		Revision as of 18:49, 5 December 2025
Line 24:		Line 24:
	* S. Lin, "Computer solutions of the traveling salesman problem," in The Bell System Technical Journal, vol. 44, no. 10, pp. 2245-2269, Dec. 1965, {{doi\|10.1002/j.1538-7305.1965.tb04146.x}}		* S. Lin, "Computer solutions of the traveling salesman problem," in The Bell System Technical Journal, vol. 44, no. 10, pp. 2245-2269, Dec. 1965, {{doi\|10.1002/j.1538-7305.1965.tb04146.x}}
	* Hwang, F.K., Lin, S. Optimal merging of 2 elements with ''n'' elements. ''Acta Informatica'' 1, 145–158 (1971). {{doi\|10.1007/BF00289521}}		* Hwang, F.K., Lin, S. Optimal merging of 2 elements with ''n'' elements. ''Acta Informatica'' 1, 145–158 (1971). {{doi\|10.1007/BF00289521}}
			* S. Lin, Computer experiments on sequences which form integral bases, in Computational Problems in Abstract Algebra (Proc. Conf., Oxford, 1967), pp. 365--370, Pergamon, Oxford-New York-Toronto, Ont., ; MR0255507
			* F. K. Hwang and S. Lin, On generating a random sequence, J. Appl. Probability 8 (1971), 366-373; MR0290521
	* F. K. Hwang and S. Lin. 1972. A Simple Algorithm for Merging Two Disjoint Linearly Ordered Sets. SIAM Journal on Computing. Pages 31-39. {{doi\|10.1137/0201004}}		* F. K. Hwang and S. Lin. 1972. A Simple Algorithm for Merging Two Disjoint Linearly Ordered Sets. SIAM Journal on Computing. Pages 31-39. {{doi\|10.1137/0201004}}
	* Lin, S. (1972). On Ramsey numbers and Kr-coloring of graphs. Journal of Combinatorial Theory, Series B, 12, 82-92. {{doi\|10.1016/0095-8956(72)90034-2}}		* Lin, S. (1972). On Ramsey numbers and K<sub>r</sub>-coloring of graphs. Journal of Combinatorial Theory, Series B, 12, 82-92. {{doi\|10.1016/0095-8956(72)90034-2}}
	* F. K. Hwang and S. Lin. 1973. Hypergeometric group testing algorithms. In Proceedings of the June 4-8, 1973, national computer conference and exposition (AFIPS '73). Association for Computing Machinery, New York, NY, USA, 452. {{doi\|10.1145/1499586.1499700}}		* F. K. Hwang and S. Lin. 1973. Hypergeometric group testing algorithms. In Proceedings of the June 4-8, 1973, national computer conference and exposition (AFIPS '73). Association for Computing Machinery, New York, NY, USA, 452. {{doi\|10.1145/1499586.1499700}}
	* F.K Hwang, S Lin. A direct method to construct triple systems. Journal of Combinatorial Theory, Series A. Volume 17, Issue 1, 1974, Pages 84-94. {{doi\|10.1016/0097-3165(74)90030-2}}		* F.K Hwang, S Lin. A direct method to construct triple systems. Journal of Combinatorial Theory, Series A. Volume 17, Issue 1, 1974, Pages 84-94. {{doi\|10.1016/0097-3165(74)90030-2}}
Line 32:		Line 34:
	* F.K Hwang, S Lin. Neighbor designs. Journal of Combinatorial Theory, Series A, Volume 23, Issue 3, 1977, Pages 302-313. {{doi\|10.1016/0097-3165(77)90021-8}}		* F.K Hwang, S Lin. Neighbor designs. Journal of Combinatorial Theory, Series A, Volume 23, Issue 3, 1977, Pages 302-313. {{doi\|10.1016/0097-3165(77)90021-8}}
	* F.K. Hwang, S. Lin. Distribution of integers into k-tuples with prescribed conditions. Journal of Combinatorial Theory, Series A, Volume 25, Issue 2, 1978, Pages 105-116. {{doi\|10.1016/0097-3165(78)90073-0}}		* F.K. Hwang, S. Lin. Distribution of integers into k-tuples with prescribed conditions. Journal of Combinatorial Theory, Series A, Volume 25, Issue 2, 1978, Pages 105-116. {{doi\|10.1016/0097-3165(78)90073-0}}
			* F. K. Hwang, S. Lin and C. L. Mallows, Some realizability theorems in group testing, SIAM J. Appl. Math. 37 (1979), no. 2, 396-400; MR0543958
	* Hwang, F.K. and Lin, S. (1979), On the construction of balanced switching networks. Networks, 9: 283-307. {{doi\|10.1002/net.3230090402}}		* Hwang, F.K. and Lin, S. (1979), On the construction of balanced switching networks. Networks, 9: 283-307. {{doi\|10.1002/net.3230090402}}
	* G.J. Chang, F.K. Hwang, S. Lin. Group testing with two defectives. Discrete Applied Mathematics, Volume 4, Issue 2, 1982, Pages 97-102. {{doi\|10.1016/0166-218X(82)90067-1}}		* G.J. Chang, F.K. Hwang, S. Lin. Group testing with two defectives. Discrete Applied Mathematics, Volume 4, Issue 2, 1982, Pages 97-102. {{doi\|10.1016/0166-218X(82)90067-1}}

← Older revision		Revision as of 18:21, 5 December 2025
Line 25:		Line 25:
	* Hwang, F.K., Lin, S. Optimal merging of 2 elements with ''n'' elements. ''Acta Informatica'' 1, 145–158 (1971). {{doi\|10.1007/BF00289521}}		* Hwang, F.K., Lin, S. Optimal merging of 2 elements with ''n'' elements. ''Acta Informatica'' 1, 145–158 (1971). {{doi\|10.1007/BF00289521}}
	* F. K. Hwang and S. Lin. 1972. A Simple Algorithm for Merging Two Disjoint Linearly Ordered Sets. SIAM Journal on Computing. Pages 31-39. {{doi\|10.1137/0201004}}		* F. K. Hwang and S. Lin. 1972. A Simple Algorithm for Merging Two Disjoint Linearly Ordered Sets. SIAM Journal on Computing. Pages 31-39. {{doi\|10.1137/0201004}}
			* Lin, S. (1972). On Ramsey numbers and Kr-coloring of graphs. Journal of Combinatorial Theory, Series B, 12, 82-92. {{doi\|10.1016/0095-8956(72)90034-2}}
	* F. K. Hwang and S. Lin. 1973. Hypergeometric group testing algorithms. In Proceedings of the June 4-8, 1973, national computer conference and exposition (AFIPS '73). Association for Computing Machinery, New York, NY, USA, 452. {{doi\|10.1145/1499586.1499700}}		* F. K. Hwang and S. Lin. 1973. Hypergeometric group testing algorithms. In Proceedings of the June 4-8, 1973, national computer conference and exposition (AFIPS '73). Association for Computing Machinery, New York, NY, USA, 452. {{doi\|10.1145/1499586.1499700}}
	* F.K Hwang, S Lin. A direct method to construct triple systems. Journal of Combinatorial Theory, Series A. Volume 17, Issue 1, 1974, Pages 84-94. {{doi\|10.1016/0097-3165(74)90030-2}}		* F.K Hwang, S Lin. A direct method to construct triple systems. Journal of Combinatorial Theory, Series A. Volume 17, Issue 1, 1974, Pages 84-94. {{doi\|10.1016/0097-3165(74)90030-2}}
	* S. Lin. 1975. Heuristic Programming as an Aid to Network Design. Netw. 5, 1 (January 1975), 33–43. {{doi\|10.1002/net.1975.5.1.33}}		* S. Lin. 1975. Heuristic Programming as an Aid to Network Design. Netw. 5, 1 (January 1975), 33–43. {{doi\|10.1002/net.1975.5.1.33}}
			* Hwang, F.K., & Lin, S. (1976). Construction of 2-balanced (n,k,λ) arrays. Pacific Journal of Mathematics, 64, 437-453. {{doi\|10.2140/pjm.1976.64.437}}
	* F.K Hwang, S Lin. Neighbor designs. Journal of Combinatorial Theory, Series A, Volume 23, Issue 3, 1977, Pages 302-313. {{doi\|10.1016/0097-3165(77)90021-8}}		* F.K Hwang, S Lin. Neighbor designs. Journal of Combinatorial Theory, Series A, Volume 23, Issue 3, 1977, Pages 302-313. {{doi\|10.1016/0097-3165(77)90021-8}}
			* Ronald L. Graham, Shen Lin & Chio-Shih Lin (1978). Spectra of Numbers. Mathematics Magazine, 51(3), 174–176. {{doi\|10.1080/0025570X.1978.11976703}}
	* F.K. Hwang, S. Lin. Distribution of integers into k-tuples with prescribed conditions. Journal of Combinatorial Theory, Series A, Volume 25, Issue 2, 1978, Pages 105-116. {{doi\|10.1016/0097-3165(78)90073-0}}		* F.K. Hwang, S. Lin. Distribution of integers into k-tuples with prescribed conditions. Journal of Combinatorial Theory, Series A, Volume 25, Issue 2, 1978, Pages 105-116. {{doi\|10.1016/0097-3165(78)90073-0}}
	* Ronald L. Graham, Shen Lin & Chio-Shih Lin (1978). Spectra of Numbers. Mathematics Magazine, 51(3), 174–176. {{doi\|10.1080/0025570X.1978.11976703}}
	* Hwang, F.K. and Lin, S. (1979), On the construction of balanced switching networks. Networks, 9: 283-307. {{doi\|10.1002/net.3230090402}}		* Hwang, F.K. and Lin, S. (1979), On the construction of balanced switching networks. Networks, 9: 283-307. {{doi\|10.1002/net.3230090402}}
	* G.J. Chang, F.K. Hwang, S. Lin. Group testing with two defectives. Discrete Applied Mathematics, Volume 4, Issue 2, 1982, Pages 97-102. {{doi\|10.1016/0166-218X(82)90067-1}}		* G.J. Chang, F.K. Hwang, S. Lin. Group testing with two defectives. Discrete Applied Mathematics, Volume 4, Issue 2, 1982, Pages 97-102. {{doi\|10.1016/0166-218X(82)90067-1}}