default search action
Farrokh Vatan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [i3]Farrokh Vatan:
On Universality of the S Combinator. CoRR abs/2210.12893 (2022)
2010 – 2019
- 2012
- [c10]Edward Chow, Farrokh Vatan, George Paloulian, Steve Frisbie, Zuzana Srostlik, Vasilios Kalomiris, Daniel Apgar:
Dynamic communication resource negotiations. MILCOM 2012: 1-6 - 2010
- [j9]P. Oscar Boykin, Tal Mor, Vwani P. Roychowdhury, Farrokh Vatan:
Algorithms on ensemble quantum computers. Nat. Comput. 9(2): 329-345 (2010) - [c9]Edward Chow, Mark James, Hsin-Ping Chang, Farrokh Vatan, Gurusham Sudhir:
An Intelligent Network for Federated Testing of NetCentric Systems. POLICY 2010: 44-52
2000 – 2009
- 2006
- [c8]Yansheng Zhang, Jicheng Fu, I-Ling Yen, Farokh B. Bastani, Ann T. Tai, Savio N. Chau, Farrokh Vatan, Amir Fijany:
QoS Adaptive ISHM Systems. ICTAI 2006: 47-54 - 2005
- [c7]Amir Fijany, Farrokh Vatan, Mohammad M. Mojarradi, Nikzad Benny Toomarian, Benjamin J. Blalock, Kerem Akarvardar, Sorin Cristoloveanu, Pierre Gentil:
The G4-FET: a universal and programmable logic gate. ACM Great Lakes Symposium on VLSI 2005: 349-352 - 2004
- [c6]P. Oscar Boykin, Vwani P. Roychowdhury, Tal Mor, Farrokh Vatan:
Fault Tolerant Computation on Ensemble Quantum Computers. DSN 2004: 157-166 - 2002
- [j8]Somshubhro Bandyopadhyay, P. Oscar Boykin, Vwani P. Roychowdhury, Farrokh Vatan:
A New Proof for the Existence of Mutually Unbiased Bases. Algorithmica 34(4): 512-528 (2002) - [j7]P. Oscar Boykin, Tal Mor, Vwani P. Roychowdhury, Farrokh Vatan, Rutger Vrijen:
Algorithmic cooling and scalable NMR quantum computers. Proc. Natl. Acad. Sci. USA 99(6): 3388-3393 (2002) - 2001
- [j6]Vwani P. Roychowdhury, Farrokh Vatan:
Quantum Formulas: A Lower Bound and Simulation. SIAM J. Comput. 31(2): 460-476 (2001) - [j5]Vwani P. Roychowdhury, Farrokh Vatan:
Bounds for the weight distribution of weakly self-dual codes. IEEE Trans. Inf. Theory 47(1): 393-396 (2001) - [c5]Farrokh Vatan:
Distribution functions of probabilistic automata. STOC 2001: 684-693 - [i2]Vwani P. Roychowdhury, Farrokh Vatan:
Quantum Formulas: a Lower Bound and Simulation. CoRR quant-ph/0104053 (2001) - 2000
- [j4]P. Oscar Boykin, Tal Mor, Matthew Pulver, Vwani P. Roychowdhury, Farrokh Vatan:
A new universal and fault-tolerant quantum basis. Inf. Process. Lett. 75(3): 101-107 (2000)
1990 – 1999
- 1999
- [j3]Farrokh Vatan, Vwani P. Roychowdhury, M. P. Anantram:
Spatially correlated qubit errors and burst-correcting quantum codes. IEEE Trans. Inf. Theory 45(5): 1703-1708 (1999) - [c4]P. Oscar Boykin, Tal Mor, Matthew Pulver, Vwani P. Roychowdhury, Farrokh Vatan:
On Universal and Fault-Tolerant Quantum Computing: A Novel Basis and a New Constructive Proof of Universality for Shor's Basis. FOCS 1999: 486-494 - [i1]Vwani P. Roychowdhury, Farrokh Vatan:
An Almost-Quadratic Lower Bound for Quantum Formula Size. CoRR quant-ph/9903042 (1999) - 1998
- [c3]Vwani P. Roychowdhury, Farrokh Vatan:
On the Existence of Nonadditive Quantum Codes. QCQC 1998: 325-336 - 1997
- [j2]György Turán, Farrokh Vatan:
On the Computation of Boolean Functions by Analog Circuits of Bounded Fan-In. J. Comput. Syst. Sci. 54(1): 199-212 (1997) - 1996
- [j1]György Turán, Farrokh Vatan:
A Size-Depth Trade-Off for the Analog Computation of Boolean Functions. Inf. Process. Lett. 59(5): 251-254 (1996) - 1994
- [c2]György Turán, Farrokh Vatan:
On the Computation of Boolean Functions by Analog Circuits of Bounded Fan-in (Extended Abstract). FOCS 1994: 553-564 - 1992
- [c1]Farrokh Vatan:
Some Lower and Upper Bounds for Algebraic Decision Trees and the Separation Problem. SCT 1992: 295-304
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:47 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: