The Circuits and Biology Lab at UMN - Recent changes [en]

File:Qian Wang Li Lilja Bazargan Riedel An Efficient Implementation of Numerical Integration Using Logical Computation on Stochastic Bit Streams.pptx

Delete page script — Thu, 22 Oct 2026 20:25:08 GMT

Delete page script deleted page File:Qian Wang Li Lilja Bazargan Riedel An Efficient Implementation of Numerical Integration Using Logical Computation on Stochastic Bit Streams.pptx File is missing on disk; the paper is linked from the web instead

File:Qian Wang Li Lilja Bazargan Riedel An Efficient Implementation of Numerical Integration Using Logical Computation on Stochastic Bit Streams.pdf

Delete page script — Thu, 22 Oct 2026 20:25:08 GMT

Delete page script deleted page File:Qian Wang Li Lilja Bazargan Riedel An Efficient Implementation of Numerical Integration Using Logical Computation on Stochastic Bit Streams.pdf File is missing on disk; the paper is linked from the web instead

People

Maintenance script — Thu, 22 Oct 2026 20:25:08 GMT

Center the faculty photo

← Older revision		Revision as of 20:25, 22 October 2026
Line 1:		Line 1:

	== <span style="color: brown">Faculty </span>==		== <span style="color: brown">Faculty </span>==
	{\| ~~border~~="~~0&gt~~;"		{\| style="width:100%;"
	\|-		\|-
	\| ~~width="960"~~ align="center" \|[[Image:Marc_Riedel.jpg\|230px\| link=http://cctbio.ece.umn.edu/wiki/index.php/Marc_Riedel]]		\| align="center" \|[[Image:Marc_Riedel.jpg\|230px\| link=http://cctbio.ece.umn.edu/wiki/index.php/Marc_Riedel]]

	\|-		\|-

Aleksandra Kharam

Maintenance script — Thu, 22 Oct 2026 20:25:07 GMT

Fix broken file links

← Older revision		Revision as of 20:25, 22 October 2026
Line 28:		Line 28:
	[http://cadbio.com/wiki/images/a/a7/Kharam_Jiang_Riedel_Parhi_Binary_Counting_with_Chemical_Reactions.pdf http://cctbio.ece.umn.edu/wiki/images/0/04/Pdf.jpg]</span>		[http://cadbio.com/wiki/images/a/a7/Kharam_Jiang_Riedel_Parhi_Binary_Counting_with_Chemical_Reactions.pdf http://cctbio.ece.umn.edu/wiki/images/0/04/Pdf.jpg]</span>
	<br> [http://cadbio.com/wiki/images/a/a7/Kharam_Jiang_Riedel_Parhi_Binary_Counting_with_Chemical_Reactions.pdf Paper]		<br> [http://cadbio.com/wiki/images/a/a7/Kharam_Jiang_Riedel_Parhi_Binary_Counting_with_Chemical_Reactions.pdf Paper]
	\| align="center" width="70" \|
	<span class="plainlinks">[http://cadbio.com/wiki/images/d/d0/Binary_Counting_with_Chemical_Reactions.ppt http://cctbio.ece.umn.edu/wiki/images/3/36/Ppt.jpg]</span>
	<br> [http://cadbio.com/wiki/images/d/d0/Binary_Counting_with_Chemical_Reactions.ppt Slides]
	\|}		\|}
	{\|		{\|

Hua Jiang

Maintenance script — Thu, 22 Oct 2026 20:25:07 GMT

Fix broken file links

← Older revision		Revision as of 20:25, 22 October 2026
Line 62:		Line 62:
	[http://cctbio.ece.umn.edu/wiki/images/0/07/Jiang_Riedel_Parhi_Synchronous_Sequential_Computation_with_Molecular_Reactions.pdf http://cctbio.ece.umn.edu/wiki/images/0/04/Pdf.jpg]</span>		[http://cctbio.ece.umn.edu/wiki/images/0/07/Jiang_Riedel_Parhi_Synchronous_Sequential_Computation_with_Molecular_Reactions.pdf http://cctbio.ece.umn.edu/wiki/images/0/04/Pdf.jpg]</span>
	<br> [http://cctbio.ece.umn.edu/wiki/images/0/07/Jiang_Riedel_Parhi_Synchronous_Sequential_Computation_with_Molecular_Reactions.pdf Paper]		<br> [http://cctbio.ece.umn.edu/wiki/images/0/07/Jiang_Riedel_Parhi_Synchronous_Sequential_Computation_with_Molecular_Reactions.pdf Paper]
	\| align="center" width="70" \|
	<span class="plainlinks">[http://cadbio.com/wiki/images/4/43/DAC2011-45-4.pptx http://cctbio.ece.umn.edu/wiki/images/3/36/Ppt.jpg]</span>
	<br> [http://cadbio.com/wiki/images/4/43/DAC2011-45-4.pptx Slides]
	\|}		\|}

Line 84:		Line 81:
	[http://cadbio.com/wiki/images/a/a7/Kharam_Jiang_Riedel_Parhi_Binary_Counting_with_Chemical_Reactions.pdf http://cctbio.ece.umn.edu/wiki/images/0/04/Pdf.jpg]</span>		[http://cadbio.com/wiki/images/a/a7/Kharam_Jiang_Riedel_Parhi_Binary_Counting_with_Chemical_Reactions.pdf http://cctbio.ece.umn.edu/wiki/images/0/04/Pdf.jpg]</span>
	<br> [http://cadbio.com/wiki/images/a/a7/Kharam_Jiang_Riedel_Parhi_Binary_Counting_with_Chemical_Reactions.pdf Paper]		<br> [http://cadbio.com/wiki/images/a/a7/Kharam_Jiang_Riedel_Parhi_Binary_Counting_with_Chemical_Reactions.pdf Paper]
	\| align="center" width="70" \|
	<span class="plainlinks">[http://cadbio.com/wiki/images/d/d0/Binary_Counting_with_Chemical_Reactions.ppt http://cctbio.ece.umn.edu/wiki/images/3/36/Ppt.jpg]</span>
	<br> [http://cadbio.com/wiki/images/d/d0/Binary_Counting_with_Chemical_Reactions.ppt Slides]
	\|}		\|}
	{\|		{\|
Line 105:		Line 99:
	[http://cctbio.ece.umn.edu/wiki/images/5/5e/Jiang_Kharam_Riedel_Parhi_A_Synthesis_Flow_for_Digital_Signal_Processing_with_Biomolecular_Reactions.pdf http://cctbio.ece.umn.edu/wiki/images/0/04/Pdf.jpg]</span>		[http://cctbio.ece.umn.edu/wiki/images/5/5e/Jiang_Kharam_Riedel_Parhi_A_Synthesis_Flow_for_Digital_Signal_Processing_with_Biomolecular_Reactions.pdf http://cctbio.ece.umn.edu/wiki/images/0/04/Pdf.jpg]</span>
	<br> [http://cctbio.ece.umn.edu/wiki/images/5/5e/Jiang_Kharam_Riedel_Parhi_A_Synthesis_Flow_for_Digital_Signal_Processing_with_Biomolecular_Reactions.pdf Paper]		<br> [http://cctbio.ece.umn.edu/wiki/images/5/5e/Jiang_Kharam_Riedel_Parhi_A_Synthesis_Flow_for_Digital_Signal_Processing_with_Biomolecular_Reactions.pdf Paper]
	\| align="center" width="70" \|
	<span class="plainlinks">
	[http://cctbio.ece.umn.edu/wiki/images/a/aa/A_Synthesis_Flow_for_Digital_Signal_Processing_with_Biomolecular_Reactions.pptx http://cctbio.ece.umn.edu/wiki/images/3/36/Ppt.jpg]</span>
	<br> [http://cctbio.ece.umn.edu/wiki/images/a/aa/A_Synthesis_Flow_for_Digital_Signal_Processing_with_Biomolecular_Reactions.pptx Slides]
	\|}		\|}

Weikang Qian

Maintenance script — Thu, 22 Oct 2026 20:25:07 GMT

Fix broken file links

← Older revision		Revision as of 20:25, 22 October 2026
Line 14:		Line 14:
	\|-valign="top"		\|-valign="top"
	\| • '''Address''':\|\|Room 119, University of Michigan-Shanghai Jiao Tong University Joint Institute<br>800 Dong Chuan Road, Shanghai, China 200240		\| • '''Address''':\|\|Room 119, University of Michigan-Shanghai Jiao Tong University Joint Institute<br>800 Dong Chuan Road, Shanghai, China 200240
	\|-
	\| • '''CV''':
	\|
	<span class="plainlinks">
	[http://cadbio.com/wiki/images/b/b0/Qian_CV.pdf http://cctbio.ece.umn.edu/wiki/images/0/04/Pdf.jpg]</span>
	<!--<br>
	[[Media:Qian_CV.pdf \| Pdf]]-->
	\|}		\|}

John Backes

Maintenance script — Thu, 22 Oct 2026 20:25:06 GMT

Fix broken file links

← Older revision		Revision as of 20:25, 22 October 2026
Line 130:		Line 130:
	<br>[[Media:Backes_Riedel_Resolution_Proofs_As_A_Data_Structure_For_Logic_Synthesis.pdf \| Paper]]		<br>[[Media:Backes_Riedel_Resolution_Proofs_As_A_Data_Structure_For_Logic_Synthesis.pdf \| Paper]]
	\| align=center width="70" \|		\| align=center width="70" \|
	<span class="plainlinks">[http://~~www.mriedel~~.ece.umn.edu/wiki/images/5/5e/~~Iwls2011final_final~~.ppt http://cctbio.ece.umn.edu/wiki/images/3/36/Ppt.jpg]</span>		<span class="plainlinks">[http://cctbio.ece.umn.edu/wiki/images/f/f1/Backes_Riedel_Resolution_Proofs_as_a_Data_Structure_for_Logic_Synthesis.ppt http://cctbio.ece.umn.edu/wiki/images/3/36/Ppt.jpg]</span>
	<br> [http://cctbio.ece.umn.edu/wiki/images/f/f1/Backes_Riedel_Resolution_Proofs_as_a_Data_Structure_for_Logic_Synthesis.ppt Slides]		<br> [http://cctbio.ece.umn.edu/wiki/images/f/f1/Backes_Riedel_Resolution_Proofs_as_a_Data_Structure_for_Logic_Synthesis.ppt Slides]

Research of Weikang Qian

Maintenance script — Thu, 22 Oct 2026 20:25:06 GMT

Fix broken file links

← Older revision		Revision as of 20:25, 22 October 2026
Line 181:		Line 181:
	<br>[[Media:Qian_Riedel_Two_Level_Logic_Synthesis_for_Probabilistic_Computation.pdf \| Paper]]		<br>[[Media:Qian_Riedel_Two_Level_Logic_Synthesis_for_Probabilistic_Computation.pdf \| Paper]]
	\| align="center" width="70" \|		\| align="center" width="70" \|
	<span class="plainlinks">[~~http~~://~~cctbio~~.~~com~~/wiki/images/4/42/Qian_Riedel_Two_Level_Logic_Synthesis_for_Probabilistic_Computation.ppt http://cctbio.ece.umn.edu/wiki/images/3/36/Ppt.jpg]</span>		<span class="plainlinks">[https://mriedel.ece.umn.edu/wiki/images/4/42/Qian_Riedel_Two_Level_Logic_Synthesis_for_Probabilistic_Computation.ppt http://cctbio.ece.umn.edu/wiki/images/3/36/Ppt.jpg]</span>
	<br> [~~http~~://~~cctbio~~.~~com~~/wiki/images/4/42/Qian_Riedel_Two_Level_Logic_Synthesis_for_Probabilistic_Computation.ppt Poster]		<br> [https://mriedel.ece.umn.edu/wiki/images/4/42/Qian_Riedel_Two_Level_Logic_Synthesis_for_Probabilistic_Computation.ppt Poster]
	\|}		\|}

Line 203:		Line 203:
	<br>[[Media:Qian_Riedel_Synthesizing_a_Set_of_Cubes_to_Satisfy_a_Given_Intersection_Pattern.pdf \| Paper]]		<br>[[Media:Qian_Riedel_Synthesizing_a_Set_of_Cubes_to_Satisfy_a_Given_Intersection_Pattern.pdf \| Paper]]
	\| align="center" width="70" \|		\| align="center" width="70" \|
	<span class="plainlinks">[~~http~~://~~cctbio~~.~~com~~/wiki/images/5/5b/Qian_Riedel_Synthesizing_Cubes_to_Satisfy_a_Given_Intersection_Pattern.ppt http://cctbio.ece.umn.edu/wiki/images/3/36/Ppt.jpg]</span>		<span class="plainlinks">[https://mriedel.ece.umn.edu/wiki/images/5/5b/Qian_Riedel_Synthesizing_Cubes_to_Satisfy_a_Given_Intersection_Pattern.ppt http://cctbio.ece.umn.edu/wiki/images/3/36/Ppt.jpg]</span>
	<br> [~~http~~://~~cctbio~~.~~com~~/wiki/images/5/5b/Qian_Riedel_Synthesizing_Cubes_to_Satisfy_a_Given_Intersection_Pattern.ppt Slides]		<br> [https://mriedel.ece.umn.edu/wiki/images/5/5b/Qian_Riedel_Synthesizing_Cubes_to_Satisfy_a_Given_Intersection_Pattern.ppt Slides]
	\|}		\|}
	<!--== The Synthesis of Stochastic Circuits for Nanoscale Computation ==		<!--== The Synthesis of Stochastic Circuits for Nanoscale Computation ==

Publications of Weikang Qian

Maintenance script — Thu, 22 Oct 2026 20:25:05 GMT

Fix broken file links

← Older revision		Revision as of 20:25, 22 October 2026
Line 173:		Line 173:
	<br>[[Media:Qian_Riedel_Two_Level_Logic_Synthesis_for_Probabilistic_Computation.pdf \| Paper]]		<br>[[Media:Qian_Riedel_Two_Level_Logic_Synthesis_for_Probabilistic_Computation.pdf \| Paper]]
	\| align=center width="70" \|		\| align=center width="70" \|
	<span class="plainlinks">[~~http~~://~~cctbio~~.~~com~~/wiki/images/4/42/Qian_Riedel_Two_Level_Logic_Synthesis_for_Probabilistic_Computation.ppt http://cctbio.ece.umn.edu/wiki/images/3/36/Ppt.jpg]</span>		<span class="plainlinks">[https://mriedel.ece.umn.edu/wiki/images/4/42/Qian_Riedel_Two_Level_Logic_Synthesis_for_Probabilistic_Computation.ppt http://cctbio.ece.umn.edu/wiki/images/3/36/Ppt.jpg]</span>
	<br> [~~http~~://~~cctbio~~.~~com~~/wiki/images/4/42/Qian_Riedel_Two_Level_Logic_Synthesis_for_Probabilistic_Computation.ppt Poster]		<br> [https://mriedel.ece.umn.edu/wiki/images/4/42/Qian_Riedel_Two_Level_Logic_Synthesis_for_Probabilistic_Computation.ppt Poster]
	\|}		\|}

Line 195:		Line 195:
	<br>[[Media:Qian_Riedel_Synthesizing_a_Set_of_Cubes_to_Satisfy_a_Given_Intersection_Pattern.pdf \| Paper]]		<br>[[Media:Qian_Riedel_Synthesizing_a_Set_of_Cubes_to_Satisfy_a_Given_Intersection_Pattern.pdf \| Paper]]
	\| align=center width="70" \|		\| align=center width="70" \|
	<span class="plainlinks">[~~http~~://~~cctbio~~.~~com~~/wiki/images/5/5b/Qian_Riedel_Synthesizing_Cubes_to_Satisfy_a_Given_Intersection_Pattern.ppt http://cctbio.ece.umn.edu/wiki/images/3/36/Ppt.jpg]</span>		<span class="plainlinks">[https://mriedel.ece.umn.edu/wiki/images/5/5b/Qian_Riedel_Synthesizing_Cubes_to_Satisfy_a_Given_Intersection_Pattern.ppt http://cctbio.ece.umn.edu/wiki/images/3/36/Ppt.jpg]</span>
	<br> [~~http~~://~~cctbio~~.~~com~~/wiki/images/5/5b/Qian_Riedel_Synthesizing_Cubes_to_Satisfy_a_Given_Intersection_Pattern.ppt Slides]		<br> [https://mriedel.ece.umn.edu/wiki/images/5/5b/Qian_Riedel_Synthesizing_Cubes_to_Satisfy_a_Given_Intersection_Pattern.ppt Slides]
	\|}		\|}

Research

Maintenance script — Thu, 22 Oct 2026 20:25:05 GMT

Fix broken file links

← Older revision		Revision as of 20:25, 22 October 2026
Line 465:		Line 465:
	\| align="center" width="70" \|		\| align="center" width="70" \|
	<span class="plainlinks">		<span class="plainlinks">
	[~~http~~://~~cadbio~~.~~com~~/wiki/images/3/3b/Altun_Riedel_Robust_Computation_through_Percolation_Synthesizing_Logic_with_Percolation_in_Nanoscale_Lattices.pdf http://mriedel.ece.umn.edu/wiki/images/0/04/Pdf.jpg]</span>		[https://mriedel.ece.umn.edu/wiki/images/2/2d/Altun_Riedel_Robust_Computation_through_Percolation_Synthesizing_Logic_with_Percolation_in_Nanoscale_Lattices.pdf http://mriedel.ece.umn.edu/wiki/images/0/04/Pdf.jpg]</span>
	<br>		<br>
	[[Media:Altun_Riedel_Synthesizing_Logic_with_Percolation_in_Nanoscale_Lattices.pdf \| Paper]]		[[Media:Altun_Riedel_Synthesizing_Logic_with_Percolation_in_Nanoscale_Lattices.pdf \| Paper]]

Main Page

Maintenance script — Thu, 22 Oct 2026 20:25:04 GMT

Fix broken file links

← Older revision		Revision as of 20:25, 22 October 2026
Line 46:		Line 46:
	* [[Weikang Qian \|Weikang]] has earned his Ph.D. He has accepted a tenure-track position at the [http://umji.sjtu.edu.cn University of Michigan–Shanghai Jiao Tong University Joint Institute].		* [[Weikang Qian \|Weikang]] has earned his Ph.D. He has accepted a tenure-track position at the [http://umji.sjtu.edu.cn University of Michigan–Shanghai Jiao Tong University Joint Institute].
	* [[Weikang Qian \|Weikang]] has received the [http://www.grad.umn.edu/fellowships/ddf/ Doctoral Dissertation Fellowship].		* [[Weikang Qian \|Weikang]] has received the [http://www.grad.umn.edu/fellowships/ddf/ Doctoral Dissertation Fellowship].
	* We have received a $100,000 grant for research on ~~[http://cctbio.ece.umn.edu/wiki/images/4/49/Kaznessis_Schmidt_Riedel_Computational_Methods_for_Forward_Biological_Engineering.pdf~~ synthetic biology] from the [https://cse.umn.edu/ Digital Technology Center] (joint with UMN colleagues [https://www.cems.umn.edu/people/faculty/yiannis-kaznessis Yiannis Kaznessis] and [http://cbs.umn.edu/schmidt-dannert-lab/home Claudia Schmidt-Dannert]).		* We have received a $100,000 grant for research on synthetic biology from the [https://cse.umn.edu/ Digital Technology Center] (joint with UMN colleagues [https://www.cems.umn.edu/people/faculty/yiannis-kaznessis Yiannis Kaznessis] and [http://cbs.umn.edu/schmidt-dannert-lab/home Claudia Schmidt-Dannert]).
	* We have received a $200,000 grant from the NSF for research on [http://mriedel.ece.umn.edu/wiki/images/7/7d/Parhi_Riedel_Synthesizing_Signal_Processing_Functions_with_Biochemical_Reactions.pdf signal processing with DNA] (joint with UMN colleague [http://www.ece.umn.edu/~parhi/ Keshab Parhi]).		* We have received a $200,000 grant from the NSF for research on [http://mriedel.ece.umn.edu/wiki/images/7/7d/Parhi_Riedel_Synthesizing_Signal_Processing_Functions_with_Biochemical_Reactions.pdf signal processing with DNA] (joint with UMN colleague [http://www.ece.umn.edu/~parhi/ Keshab Parhi]).
	* We have received a '''$500,000 NSF grant''' along with Marc's [http://www.nsf.gov/awardsearch/showAward.do?AwardNumber=0845650&WT.z_pims_id NSF CAREER Award].		* We have received a '''$500,000 NSF grant''' along with Marc's [http://www.nsf.gov/awardsearch/showAward.do?AwardNumber=0845650&WT.z_pims_id NSF CAREER Award].

Papers, Presentations, Theses, and Patents

Maintenance script — Thu, 22 Oct 2026 20:25:04 GMT

Fix broken file links

← Older revision		Revision as of 20:25, 22 October 2026
Line 631:		Line 631:
	Stochastic computing’s usual bargain is tiny hardware paid for with very long bit streams. Numerical integration quietly renegotiates the deal. A Riemann sum already gathers many function evaluations, so each evaluation need not speak with great precision: one noisy bit may be a terrible estimate of a single value, yet thousands of such bits poured into the same bucket give an accurate integral. The analysis shows that error depends chiefly on the total number of samples, LM—stream length times integration points—allowing many points to substitute for long streams and turning the sum itself into a noise filter. An architecture sweeps stochastically across the integration interval, evaluates a Bernstein-polynomial approximation to the integrand, and counts the resulting ones. Experiments confirm the mathematics and produce the unusual double victory of smaller area and shorter delay. Here the integral’s breadth, normally its computational burden, becomes its shelter from randomness: a broad basin can measure rainfall one drop at a time.		Stochastic computing’s usual bargain is tiny hardware paid for with very long bit streams. Numerical integration quietly renegotiates the deal. A Riemann sum already gathers many function evaluations, so each evaluation need not speak with great precision: one noisy bit may be a terrible estimate of a single value, yet thousands of such bits poured into the same bucket give an accurate integral. The analysis shows that error depends chiefly on the total number of samples, LM—stream length times integration points—allowing many points to substitute for long streams and turning the sum itself into a noise filter. An architecture sweeps stochastically across the integration interval, evaluates a Bernstein-polynomial approximation to the integrand, and counts the resulting ones. Experiments confirm the mathematics and produce the unusual double victory of smaller area and shorter delay. Here the integral’s breadth, normally its computational burden, becomes its shelter from randomness: a broad basin can measure rainfall one drop at a time.

	<small>'''[https://~~mriedel~~.~~ece~~.~~umn~~.~~edu~~/~~wiki~~/~~images/b/b7~~/Qian_Wang_Li_Lilja_Bazargan_Riedel_An_Efficient_Implementation_of_Numerical_Integration_Using_Logical_Computation_on_Stochastic_Bit_Streams.pdf PDF]'''  ·  '''[http://cadbio.com/wiki/images/6/67/Qian_Wang_Li_Lilja_Bazargan_Riedel_An_Efficient_Implementation_of_Numerical_Integration_Using_Logical_Computation_on_Stochastic_Bit_Streams.pptx Slides]'''</small>		<small>'''[https://gc.sjtu.edu.cn/~wkqian/papers/Qian_Wang_Li_Lilja_Bazargan_Riedel_An_Efficient_Implementation_of_Numerical_Integration_Using_Logical_Computation_on_Stochastic_Bit_Streams.pdf PDF]'''</small>
	\|}		\|}

Line 1,099:		Line 1,099:
	Imagine a computer as a city drawn on graph paper. Each four-terminal switch is an intersection controlled by a Boolean literal, and the answer is one precisely when an open route crosses the city from north to south. The challenge is that a grid contains exponentially many winding routes, including shortcuts the designer never intended. This dissertation uses Boolean duality as urban planning: products of the target function shape one direction, products of its dual shape the other, producing compact lattices without enumerating every possible path. At the nanoscale, broken intersections become statistics. Large regions of redundant switches undergo a percolation transition, changing global connectivity sharply even when individual devices fail; duality prevents stray diagonal paths from turning a zero into a one. The geometry also yields new results about self-dual Boolean functions. Regularity and defects, often treated as the indignities of self-assembly, become the fabric from which reliable logic is woven.		Imagine a computer as a city drawn on graph paper. Each four-terminal switch is an intersection controlled by a Boolean literal, and the answer is one precisely when an open route crosses the city from north to south. The challenge is that a grid contains exponentially many winding routes, including shortcuts the designer never intended. This dissertation uses Boolean duality as urban planning: products of the target function shape one direction, products of its dual shape the other, producing compact lattices without enumerating every possible path. At the nanoscale, broken intersections become statistics. Large regions of redundant switches undergo a percolation transition, changing global connectivity sharply even when individual devices fail; duality prevents stray diagonal paths from turning a zero into a one. The geometry also yields new results about self-dual Boolean functions. Regularity and defects, often treated as the indignities of self-assembly, become the fabric from which reliable logic is woven.

	<small>'''[https://mriedel.ece.umn.edu/wiki/images/9/92/Altun_Logic_Synthesis_for_Networks_of_Four_Terminal_Switches.pdf PDF~~]'''  ·  '''[https://mriedel.ece.umn.edu/wiki/images/9/97/Altun_Logic_Synthesis_for_Networks_of_Four_Terminal_Switches.ppt Slides~~]'''</small>		<small>'''[https://mriedel.ece.umn.edu/wiki/images/9/92/Altun_Logic_Synthesis_for_Networks_of_Four_Terminal_Switches.pdf PDF]'''</small>
	</td>		</td>
	</tr>		</tr>