Farrokh Vatan

According to our database, Farrokh Vatan authored at least 21 papers between 1992 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2022

On Universality of the S Combinator.

Farrokh Vatan

CoRR, 2022

2012

Dynamic communication resource negotiations.

Edward Chow, Farrokh Vatan, George Paloulian, Steve Frisbie, Zuzana Srostlik, Vasilios Kalomiris, Daniel Apgar

Proceedings of the 31st IEEE Military Communications Conference, 2012

2010

Algorithms on ensemble quantum computers.

P. Oscar Boykin, Tal Mor, Vwani P. Roychowdhury, Farrokh Vatan

Nat. Comput., 2010

An Intelligent Network for Federated Testing of NetCentric Systems.

Edward Chow, Mark James, Hsin-Ping Chang, Farrokh Vatan, Gurusham Sudhir

Proceedings of the POLICY 2010, 2010

2006

QoS Adaptive ISHM Systems.

Yansheng Zhang, Jicheng Fu, I-Ling Yen, Farokh B. Bastani, Ann T. Tai, Savio N. Chau, Farrokh Vatan, Amir Fijany

Proceedings of the 18th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2006), 2006

2005

The G⁴-FET: a universal and programmable logic gate.

Amir Fijany, Farrokh Vatan, Mohammad M. Mojarradi, Nikzad Benny Toomarian, Benjamin J. Blalock, Kerem Akarvardar, Sorin Cristoloveanu, Pierre Gentil

Proceedings of the 15th ACM Great Lakes Symposium on VLSI 2005, 2005

2004

Fault Tolerant Computation on Ensemble Quantum Computers.

P. Oscar Boykin, Vwani P. Roychowdhury, Tal Mor, Farrokh Vatan

Proceedings of the 2004 International Conference on Dependable Systems and Networks (DSN 2004), 28 June, 2004

2002

Algorithmic cooling and scalable NMR quantum computers.

P. Oscar Boykin, Tal Mor, Vwani P. Roychowdhury, Farrokh Vatan, Rutger Vrijen

Proc. Natl. Acad. Sci. USA, 2002

A New Proof for the Existence of Mutually Unbiased Bases.

Somshubhro Bandyopadhyay, P. Oscar Boykin, Vwani P. Roychowdhury, Farrokh Vatan

Algorithmica, 2002

2001

Bounds for the weight distribution of weakly self-dual codes.

Vwani P. Roychowdhury, Farrokh Vatan

IEEE Trans. Inf. Theory, 2001

Quantum Formulas: A Lower Bound and Simulation.

Vwani P. Roychowdhury, Farrokh Vatan

SIAM J. Comput., 2001

Distribution functions of probabilistic automata.

Farrokh Vatan

Proceedings of the Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 2001

2000

A new universal and fault-tolerant quantum basis.

P. Oscar Boykin, Tal Mor, Matthew Pulver, Vwani P. Roychowdhury, Farrokh Vatan

Inf. Process. Lett., 2000

1999

Spatially correlated qubit errors and burst-correcting quantum codes.

Farrokh Vatan, Vwani P. Roychowdhury, M. P. Anantram

IEEE Trans. Inf. Theory, 1999

An Almost-Quadratic Lower Bound for Quantum Formula Size

Vwani P. Roychowdhury, Farrokh Vatan

CoRR, 1999

On Universal and Fault-Tolerant Quantum Computing: A Novel Basis and a New Constructive Proof of Universality for Shor's Basis.

P. Oscar Boykin, Tal Mor, Matthew Pulver, Vwani P. Roychowdhury, Farrokh Vatan

Proceedings of the 40th Annual Symposium on Foundations of Computer Science, 1999

1998

On the Existence of Nonadditive Quantum Codes.

Vwani P. Roychowdhury, Farrokh Vatan

Proceedings of the Quantum Computing and Quantum Communications, 1998

1997

On the Computation of Boolean Functions by Analog Circuits of Bounded Fan-In.

György Turán, Farrokh Vatan

J. Comput. Syst. Sci., 1997

1996

A Size-Depth Trade-Off for the Analog Computation of Boolean Functions.

György Turán, Farrokh Vatan

Inf. Process. Lett., 1996

1994

On the Computation of Boolean Functions by Analog Circuits of Bounded Fan-in (Extended Abstract)

György Turán, Farrokh Vatan

Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 1994

1992

Some Lower and Upper Bounds for Algebraic Decision Trees and the Separation Problem.

Farrokh Vatan

Proceedings of the Seventh Annual Structure in Complexity Theory Conference, 1992