Stop the war!
Остановите войну!
for scientists:
default search action
BibTeX records: Iraj Kalantari
@article{DBLP:journals/mlq/KalantariW13, author = {Iraj Kalantari and Larry Welch}, title = {When series of computable functions with varying domains are computable}, journal = {Math. Log. Q.}, volume = {59}, number = {6}, pages = {471--493}, year = {2013}, url = {https://doi.org/10.1002/malq.201200053}, doi = {10.1002/MALQ.201200053}, timestamp = {Wed, 17 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mlq/KalantariW13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcos/BerkowitzKKM13, author = {Ross Berkowitz and Bahman Kalantari and Iraj Kalantari and David Menendez}, title = {On Properties of Forbidden Zones of Polygons and Polytopes}, journal = {Trans. Comput. Sci.}, volume = {20}, pages = {112--137}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-41905-8\_8}, doi = {10.1007/978-3-642-41905-8\_8}, timestamp = {Fri, 06 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcos/BerkowitzKKM13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isvd/BerkowitzKMK12, author = {Ross Berkowitz and Bahman Kalantari and David Menendez and Iraj Kalantari}, title = {On Properties of Forbidden Zones of Polygons and Polytopes}, booktitle = {Ninth International Symposium on Voronoi Diagrams in Science and Engineering, {ISVD} 2012, New Brunswick, NJ, USA, June 27-29, 2012}, pages = {56--65}, publisher = {{IEEE} Computer Society}, year = {2012}, url = {https://doi.org/10.1109/ISVD.2012.12}, doi = {10.1109/ISVD.2012.12}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isvd/BerkowitzKMK12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isvd/AndreevK12, author = {Fedor Andreev and Iraj Kalantari}, title = {Collinearity of Iterations and Real Plane Algebraic Curves}, booktitle = {Ninth International Symposium on Voronoi Diagrams in Science and Engineering, {ISVD} 2012, New Brunswick, NJ, USA, June 27-29, 2012}, pages = {126--131}, publisher = {{IEEE} Computer Society}, year = {2012}, url = {https://doi.org/10.1109/ISVD.2012.23}, doi = {10.1109/ISVD.2012.23}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isvd/AndreevK12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcos/BiasiKK11, author = {Sergio Coutinho de Biasi and Bahman Kalantari and Iraj Kalantari}, title = {Mollified Zone Diagrams and Their Computation}, journal = {Trans. Comput. Sci.}, volume = {14}, pages = {31--59}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25249-5\_2}, doi = {10.1007/978-3-642-25249-5\_2}, timestamp = {Fri, 06 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcos/BiasiKK11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/apal/EnayatK10, author = {Ali Enayat and Iraj Kalantari}, title = {Preface}, journal = {Ann. Pure Appl. Log.}, volume = {161}, number = {6}, pages = {709--710}, year = {2010}, url = {https://doi.org/10.1016/j.apal.2009.06.003}, doi = {10.1016/J.APAL.2009.06.003}, timestamp = {Fri, 21 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/apal/EnayatK10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isvd/BiasiKK10, author = {Sergio Coutinho de Biasi and Bahman Kalantari and Iraj Kalantari}, editor = {Mir Abolfazl Mostafavi}, title = {Maximal Zone Diagrams and their Computation}, booktitle = {Seventh International Symposium on Voronoi Diagrams in Science and Engineering, {ISVD} 2010, Quebec, Canada, June 28-30, 2010}, pages = {171--180}, publisher = {{IEEE} Computer Society}, year = {2010}, url = {https://doi.org/10.1109/ISVD.2010.10}, doi = {10.1109/ISVD.2010.10}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isvd/BiasiKK10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/aml/KalantariW08, author = {Iraj Kalantari and Larry Welch}, title = {On degree-preserving homeomorphisms between trees in computable topology}, journal = {Arch. Math. Log.}, volume = {46}, number = {7-8}, pages = {679--693}, year = {2008}, url = {https://doi.org/10.1007/s00153-007-0056-0}, doi = {10.1007/S00153-007-0056-0}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/aml/KalantariW08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mlq/KalantariW08, author = {Iraj Kalantari and Larry Welch}, title = {On Turing degrees of points in computable topology}, journal = {Math. Log. Q.}, volume = {54}, number = {5}, pages = {470--482}, year = {2008}, url = {https://doi.org/10.1002/malq.200710062}, doi = {10.1002/MALQ.200710062}, timestamp = {Wed, 17 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mlq/KalantariW08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@incollection{DBLP:series/leus/Kalantari07, author = {Iraj Kalantari}, editor = {Mich{\`{e}}le Friend and Norma B. Goethe and Valentina S. Harizanov}, title = {Induction over the Continuum}, booktitle = {Induction, Algorithmic Learning Theory, and Philosophy}, series = {Logic, Epistemology, and the Unity of Science}, volume = {9}, pages = {145--154}, publisher = {Springer}, year = {2007}, url = {https://doi.org/10.1007/978-1-4020-6127-1\_5}, doi = {10.1007/978-1-4020-6127-1\_5}, timestamp = {Tue, 16 May 2017 14:24:24 +0200}, biburl = {https://dblp.org/rec/series/leus/Kalantari07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/aml/KalantariW04, author = {Iraj Kalantari and Larry Welch}, title = {A blend of methods of recursion theory and topology: {A} Pi\({}_{\mbox{1}}\)\({}^{\mbox{0}}\) tree of shadow points}, journal = {Arch. Math. Log.}, volume = {43}, number = {8}, pages = {991--1008}, year = {2004}, url = {https://doi.org/10.1007/s00153-004-0244-0}, doi = {10.1007/S00153-004-0244-0}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/aml/KalantariW04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mlq/KalantariW04, author = {Iraj Kalantari and Larry Welch}, title = {Density and Baire category in recursive topology}, journal = {Math. Log. Q.}, volume = {50}, number = {4-5}, pages = {381--391}, year = {2004}, url = {https://doi.org/10.1002/malq.200310106}, doi = {10.1002/MALQ.200310106}, timestamp = {Wed, 17 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mlq/KalantariW04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/siggraph/KalantariKA04, author = {Bahman Kalantari and Iraj Kalantari and Fedor Andreev}, editor = {Tony Longson}, title = {Animation of mathematical concepts using polynomiography}, booktitle = {International Conference on Computer Graphics and Interactive Techniques, {SIGGRAPH} 2004, Los Angeles, California, USA, August 8-12, 2004, Educators Program}, pages = {27}, publisher = {{ACM}}, year = {2004}, url = {https://doi.org/10.1145/1186107.1186138}, doi = {10.1145/1186107.1186138}, timestamp = {Fri, 12 Mar 2021 11:31:03 +0100}, biburl = {https://dblp.org/rec/conf/siggraph/KalantariKA04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/apal/KalantariW03, author = {Iraj Kalantari and Larry Welch}, title = {A blend of methods of recursion theory and topology}, journal = {Ann. Pure Appl. Log.}, volume = {124}, number = {1-3}, pages = {141--178}, year = {2003}, url = {https://doi.org/10.1016/S0168-0072(03)00054-X}, doi = {10.1016/S0168-0072(03)00054-X}, timestamp = {Fri, 21 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/apal/KalantariW03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:journals/entcs/KalantariW02, author = {Iraj Kalantari and Larry Welch}, editor = {Vasco Brattka and Matthias Schr{\"{o}}der and Klaus Weihrauch}, title = {Recursive Quantum Functions, Avoidable Points, {\&} Shadow Points in Recursive Analysis}, booktitle = {Computability and Complexity in Analysis, {CCA} 2002, {ICALP} 2002 Satellite Workshop, M{\'{a}}laga, Spain, July 12-13, 2002}, series = {Electronic Notes in Theoretical Computer Science}, volume = {66}, number = {1}, pages = {79--90}, publisher = {Elsevier}, year = {2002}, url = {https://doi.org/10.1016/S1571-0661(04)80380-3}, doi = {10.1016/S1571-0661(04)80380-3}, timestamp = {Tue, 06 Dec 2022 09:35:34 +0100}, biburl = {https://dblp.org/rec/journals/entcs/KalantariW02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/apal/KalantariW99, author = {Iraj Kalantari and Lawrence Welch}, title = {Recursive and Nonextendible Functions over the Reals; Filter Foundation for Recursive Analysis, {II}}, journal = {Ann. Pure Appl. Log.}, volume = {98}, number = {1-3}, pages = {87--110}, year = {1999}, url = {https://doi.org/10.1016/S0168-0072(98)00048-7}, doi = {10.1016/S0168-0072(98)00048-7}, timestamp = {Fri, 21 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/apal/KalantariW99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/apal/KalantariW98, author = {Iraj Kalantari and Lawrence Welch}, title = {Point-Free Topological Spaces, Functions and Recursive Points: Filter Foundation for Recursive Analysis {I}}, journal = {Ann. Pure Appl. Log.}, volume = {93}, number = {1-3}, pages = {125--151}, year = {1998}, url = {https://doi.org/10.1016/S0168-0072(97)00058-4}, doi = {10.1016/S0168-0072(97)00058-4}, timestamp = {Fri, 21 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/apal/KalantariW98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/apal/KalantariW87, author = {Iraj Kalantari and Galen Weitkamp}, title = {Effective topological spaces {III:} Forcing and definability}, journal = {Ann. Pure Appl. Log.}, volume = {36}, pages = {17--27}, year = {1987}, url = {https://doi.org/10.1016/0168-0072(87)90009-1}, doi = {10.1016/0168-0072(87)90009-1}, timestamp = {Fri, 21 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/apal/KalantariW87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/apal/KalantariW85, author = {Iraj Kalantari and Galen Weitkamp}, title = {Effective topological spaces {I:} a definability theory}, journal = {Ann. Pure Appl. Log.}, volume = {29}, number = {1}, pages = {1--27}, year = {1985}, url = {https://doi.org/10.1016/0168-0072(85)90033-8}, doi = {10.1016/0168-0072(85)90033-8}, timestamp = {Fri, 21 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/apal/KalantariW85.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/apal/KalantariW85a, author = {Iraj Kalantari and Galen Weitkamp}, title = {Effective topological spaces {II:} {A} hierarchy}, journal = {Ann. Pure Appl. Log.}, volume = {29}, number = {2}, pages = {207--224}, year = {1985}, url = {https://doi.org/10.1016/0168-0072(84)90025-3}, doi = {10.1016/0168-0072(84)90025-3}, timestamp = {Fri, 21 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/apal/KalantariW85a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mlq/DowneyK85, author = {Rodney G. Downey and Iraj Kalantari}, title = {Effective Extensions of Linear Forms on a Recursive Vector Space Over a Recursive Field}, journal = {Math. Log. Q.}, volume = {31}, number = {13}, pages = {193--200}, year = {1985}, url = {https://doi.org/10.1002/malq.19850311302}, doi = {10.1002/MALQ.19850311302}, timestamp = {Wed, 17 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mlq/DowneyK85.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jsyml/KalantariL83, author = {Iraj Kalantari and Anne Leggett}, title = {Maximality in Effective Topology}, journal = {J. Symb. Log.}, volume = {48}, number = {1}, pages = {100--112}, year = {1983}, url = {https://doi.org/10.2307/2273326}, doi = {10.2307/2273326}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jsyml/KalantariL83.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jsyml/KalantariR83, author = {Iraj Kalantari and Jeffrey B. Remmel}, title = {Degrees of Recursively Enumerable Topological Spaces}, journal = {J. Symb. Log.}, volume = {48}, number = {3}, pages = {610--622}, year = {1983}, url = {https://doi.org/10.2307/2273453}, doi = {10.2307/2273453}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jsyml/KalantariR83.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tse/KalantariM83, author = {Iraj Kalantari and Gerard McDonald}, title = {A Data Structure and an Algorithm for the Nearest Point Problem}, journal = {{IEEE} Trans. Software Eng.}, volume = {9}, number = {5}, pages = {631--634}, year = {1983}, url = {https://doi.org/10.1109/TSE.1983.235263}, doi = {10.1109/TSE.1983.235263}, timestamp = {Tue, 16 Aug 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tse/KalantariM83.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jsyml/KalantariL82, author = {Iraj Kalantari and Anne Leggett}, title = {Simplicity in Effective Topology}, journal = {J. Symb. Log.}, volume = {47}, number = {1}, pages = {169--183}, year = {1982}, url = {https://doi.org/10.2307/2273390}, doi = {10.2307/2273390}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jsyml/KalantariL82.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jsyml/KalantariR79, author = {Iraj Kalantari and Allen Retzlaff}, title = {Recursive Constructions in Topological Spaces}, journal = {J. Symb. Log.}, volume = {44}, number = {4}, pages = {609--625}, year = {1979}, url = {https://doi.org/10.2307/2273299}, doi = {10.2307/2273299}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jsyml/KalantariR79.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mlq/Kalantari79, author = {Iraj Kalantari}, title = {Automorphisms of the Lattice of Recursively Enumerable Vector Spaces}, journal = {Math. Log. Q.}, volume = {25}, number = {25-29}, pages = {385--401}, year = {1979}, url = {https://doi.org/10.1002/malq.19790252502}, doi = {10.1002/MALQ.19790252502}, timestamp = {Wed, 17 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mlq/Kalantari79.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jsyml/Kalantari78, author = {Iraj Kalantari}, title = {Major Subspaces of Recursively Enumerable Vector Spaces}, journal = {J. Symb. Log.}, volume = {43}, number = {2}, pages = {293--303}, year = {1978}, url = {https://doi.org/10.2307/2272828}, doi = {10.2307/2272828}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jsyml/Kalantari78.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jsyml/KalantariR77, author = {Iraj Kalantari and Allen Retzlaff}, title = {Maximal Vector Spaces Under Automorphisms of the Lattice of Recursively Enumerable Vector Spaces}, journal = {J. Symb. Log.}, volume = {42}, number = {4}, pages = {481--491}, year = {1977}, url = {https://doi.org/10.2307/2271869}, doi = {10.2307/2271869}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jsyml/KalantariR77.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
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.