Difference between revisions of "Mustafa Altun"
Line 7: | Line 7: | ||
I am pursuing research in the area of [[Research#Computing with Nanoscale Lattices | logic synthesis for emerging technologies]]. I also have a particular interest in [http://en.wikipedia.org/wiki/Combinatorics combinatorics], more specifically [http://en.wikipedia.org/wiki/Hypergraph hypergraphs]. | I am pursuing research in the area of [[Research#Computing with Nanoscale Lattices | logic synthesis for emerging technologies]]. I also have a particular interest in [http://en.wikipedia.org/wiki/Combinatorics combinatorics], more specifically [http://en.wikipedia.org/wiki/Hypergraph hypergraphs]. | ||
=== Self-Duality === | |||
The problem of testing whether a monotone Boolean function in irredundant disjuntive normal form (IDNF) is self-dual is one of few problems in circuit complexity whose precise tractability status is unknown. We show that monotone self-dual Boolean functions in IDNF do not have more variables than disjuncts. We propose an algorithm to test whether a self-dual Boolean function in IDNF with ''n'' variables and ''n'' disjuncts is self-dual. The algorithm runs in <math>O(n4)</math> time. | |||
{| | |||
| | |||
{| style="background:#F0E68C" | |||
|- valign=top | |||
| width="100" |'''title''': | |||
| width="500"|[[Media:Altun_Riedel_A_Study_on_Monotone_Self_Dual_Boolean_Functions.pdf | A Study on Monotone Self-dual Boolean Functions]] | |||
|- valign="top" | |||
| '''authors''': | |||
| [[Mustafa Altun]] and [[Marc Riedel]] | |||
|- valign="top" | |||
| '''submitted to''': | |||
| [http://cs.nyu.edu/~stoc2012/ACM Symposium on Theory of Computing], 2012. | |||
|} | |||
| align=center width="70" | | |||
<span class="plainlinks"> | |||
[http://cadbio.com/wiki/images/5/53/Altun_Riedel_A_Study_on_Monotone_Self_Dual_Boolean_Functions.pdf | |||
http://cctbio.ece.umn.edu/wiki/images/0/04/Pdf.jpg]</span> | |||
<br> | |||
[[Media:Altun_Riedel_A_Study_on_Monotone_Self_Dual_Boolean_Functions.pdf | Paper]] | |||
|} | |||
=== Switching Lattices === | === Switching Lattices === |
Revision as of 10:16, 4 November 2011
I am a Ph.D. student in the Dept. of Electrical and Computer Engineering at the University of Minnesota, Twin Cities Campus.
Research
I am pursuing research in the area of logic synthesis for emerging technologies. I also have a particular interest in combinatorics, more specifically hypergraphs.
Self-Duality
The problem of testing whether a monotone Boolean function in irredundant disjuntive normal form (IDNF) is self-dual is one of few problems in circuit complexity whose precise tractability status is unknown. We show that monotone self-dual Boolean functions in IDNF do not have more variables than disjuncts. We propose an algorithm to test whether a self-dual Boolean function in IDNF with n variables and n disjuncts is self-dual. The algorithm runs in
time.Switching Lattices
In his seminal Master's Thesis, Claude Shannon made the connection between Boolean algebra and switching circuits. He considered two-terminal switches corresponding to electromagnetic relays. A Boolean function can be implemented in terms of connectivity across a network of switches, often arranged in a series/parallel configuration. We have developed a method for synthesizing Boolean functions with networks of four-terminal switches. Our model is applicable for variety of nanoscale technologies, such as nanowire crossbar arrays, as molecular switch-based structures.
|
|
Percolation for Robust Computation
We have devised a novel framework for digital computation with lattices of nanoscale switches with high defect rates, based on the mathematical phenomenon of percolation. With random connectivity, percolation gives rise to a sharp non-linearity in the probability of global connectivity as a function of the probability of local connectivity. This phenomenon is exploited to compute Boolean functions robustly, in the presence of defects.
|
|

Education
I received my B.S. and M.Sc. degrees in Electronics Engineering at Istanbul Technical University, Turkey.
Contact Information
- Email Address: altu0006@umn.edu
- Office Phone: 612-626-8676
- Cell Phone: 612-978-2955
- Address: 200 Union St. S.E., Room 4-136, Minneapolis, MN 55455