Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAmin Farjudian
Person information
- affiliation (PhD 2004): University of Birmingham, School of Mathematics, Birmingham, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
[j12]Heshan Du
, Natasha Alechina, Amin Farjudian, Brian Logan, Can Zhou, Anthony G. Cohn:
A Logic of East and West. J. Artif. Intell. Res. 76: 527-565 (2023)- [j11]Can Zhou, Razin A. Shaikh, Yiran Li, Amin Farjudian:
A domain-theoretic framework for robustness analysis of neural networks. Math. Struct. Comput. Sci. 33(2): 68-105 (2023) - [j10]Amin Farjudian, Eugenio Moggi:
Robustness, Scott continuity, and computability. Math. Struct. Comput. Sci. 33(6): 536-572 (2023) - [j9]Abbas Edalat, Amin Farjudian, Yiran Li:
Recursive solution of initial value problems with temporal discretization. Theor. Comput. Sci. 980: 114221 (2023) - [j8]Amin Farjudian:
Bridging Mathematics and Computer Science Through Threshold Concepts. IEEE Trans. Educ. 66(2): 139-145 (2023) - 2018
- [j7]Behrouz Emamizadeh, Amin Farjudian, Yichen Liu:
Optimal harvesting strategy based on rearrangements of functions. Appl. Math. Comput. 320: 677-690 (2018) - [j6]Eugenio Moggi, Amin Farjudian, Adam Duracz, Walid Taha:
Safe & robust reachability analysis of hybrid systems. Theor. Comput. Sci. 747: 75-99 (2018) - 2017
- [j5]Behrouz Emamizadeh, Amin Farjudian, Hayk Mikayelyan:
An Elliptic Optimal Control Problem and its Two Relaxations. J. Optim. Theory Appl. 172(2): 455-465 (2017) - 2013
- [j4]Amin Farjudian:
On the Kolmogorov complexity of continuous real functions. Ann. Pure Appl. Log. 164(5): 566-576 (2013) - 2010
- [j3]Michal Konecný, Amin Farjudian:
Semantics of Query-Driven Communication of Exact Values. J. Univers. Comput. Sci. 16(18): 2597-2628 (2010) - [j2]Michal Konecný, Amin Farjudian:
Compositional Semantics of Dataflow Networks with Query-Driven Communication of Exact Values. J. Univers. Comput. Sci. 16(18): 2629-2656 (2010) - 2007
- [j1]Amin Farjudian:
Shrad: A Language for Sequential Real Number Computation. Theory Comput. Syst. 41(1): 49-105 (2007)
Conference and Workshop Papers
- 2023
- [c15]Yuhua Guo, Yiran Li, Amin Farjudian:
Validated Computation of Lipschitz Constant of Recurrent Neural Networks. ICMLSC 2023: 46-52 - [c14]Francesco Dagnino, Amin Farjudian, Eugenio Moggi:
Robustness in Metric Spaces over Continuous Quantales and the Hausdorff-Smyth Monad. ICTAC 2023: 313-331 - 2022
- [c13]Yanmin Qi, Heshan Du, Amin Farjudian, Yunqiang Zhu:
Representing Computational Relations in Knowledge Graphs Using Functional Languages (Short Paper). COSIT 2022: 29:1-29:7 - [c12]Giampaolo Buticchi, Amin Farjudian, Juyoung Oh, Luca Tarisciotti:
An ANN-Assisted Control for the Power Decoupling of a Multiple Active Bridge DC-DC Converter. IECON 2022: 1-6 - [c11]Zeyu Xiong, Pei-Chun Lin, Amin Farjudian:
Retaining Semantics in Image to Music Conversion. ISM 2022: 228-235 - 2020
- [c10]Abbas Edalat, Amin Farjudian, Mina Mohammadian, Dirk Pattinson:
Domain Theoretic Second-Order Euler's Method for Solving Initial Value Problems. MFPS 2020: 105-128 - 2019
- [c9]Eugenio Moggi, Amin Farjudian, Walid Taha:
System Analysis and Robustness. ICTCS 2019: 1-7 - [c8]Amin Farjudian:
Computable Analysis of Linear Rearrangement Optimization. TAMC 2019: 172-187 - 2018
- [c7]Eugenio Moggi, Amin Farjudian, Walid Taha:
System Analysis and Robustness. Models, Mindsets, Meta 2018: 36-44 - 2014
- [c6]Jan Duracz, Amin Farjudian, Michal Konecný, Walid Taha:
Function Interval Arithmetic. ICMS 2014: 677-684 - 2012
- [c5]Amin Farjudian:
Polynomial-Time Solution of Initial Value Problems Using Polynomial Enclosures. WoLLIC 2012: 232-245 - 2011
- [c4]Amin Farjudian:
On the Kolmogorov Complexity of Continuous Real Functions. CiE 2011: 81-91 - 2008
- [c3]Amin Farjudian, Michal Konecný:
Time Complexity and Convergence Analysis of Domain Theoretic Picard Method. WoLLIC 2008: 149-163 - 2005
- [c2]Amin Farjudian:
Shrad: A Language for Sequential Real Number Computation. CiE 2005: 128-128 - 2002
- [c1]Amin Farjudian:
Sequentiality and Piecewise-affinity in Segments of Real-PCF. Workshop on Domains 2002: 3-43
Informal and Other Publications
- 2023
- [i5]Abbas Edalat, Amin Farjudian, Yiran Li:
Recursive Solution of Initial Value Problems with Temporal Discretization. CoRR abs/2301.03920 (2023) - [i4]Francesco Dagnino, Amin Farjudian, Eugenio Moggi:
Robustness in Metric Spaces over Continuous Quantales and the Hausdorff-Smyth Monad. CoRR abs/2309.06968 (2023) - 2022
- [i3]Can Zhou, Razin A. Shaikh, Yiran Li, Amin Farjudian:
A Domain-Theoretic Framework for Robustness Analysis of Neural Networks. CoRR abs/2203.00295 (2022) - [i2]Amin Farjudian, Eugenio Moggi:
Robustness, Scott Continuity, and Computability. CoRR abs/2208.12347 (2022) - 2017
- [i1]Eugenio Moggi, Amin Farjudian, Adam Duracz, Walid Taha:
Safe & Robust Reachability Analysis of Hybrid Systems. CoRR abs/1709.05658 (2017)
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-05-03 00:10 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:
