Gabriel Istrate 个人学术档案

引用次数

	总计	2019 年至今
引用	698	175
h 指数	12	7
i10 指数	14	4

19941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320243 6 5 2 1 3 3 5 11 7 19 22 43 23 48 44 31 30 31 21 24 36 19 21 35 24 15 42 28 42 24

开放获取的出版物数量

查看全部

4 篇文章

0 篇文章

可查看的文章

无法查看的文章

根据资助方的强制性开放获取政策

合著作者

Cosmin BonchisInstitute e-Austria Timisoara, West University Timisoara在 e-uvt.ro 的电子邮件经过验证
Madhav MaratheDistinguished Professor, Biocomplexity-Institute, Dept. Computer Science, University of Virginia在 virginia.edu 的电子邮件经过验证
Cristopher MooreSanta Fe Institute在 santafe.edu 的电子邮件经过验证
Allon PercusProfessor of Mathematics, Claremont Graduate University在 cgu.edu 的电子邮件经过验证
Anil Vullikanti (V. S. Anil Kumar)University of Virginia在 virginia.edu 的电子邮件经过验证
Christopher L. BarrettBiocomplexity Institute and Initiative, Dept. of Computer Science, University of Virginia在 virginia.edu 的电子邮件经过验证
Sunil ThulasidasanAmazon在 amazon.com 的电子邮件经过验证
Anders HanssonLead ML Scientist @ Recorded Future在 recordedfuture.com 的电子邮件经过验证
Shripad ThiteUber在 uber.com 的电子邮件经过验证
Dimitris AchlioptasProfessor of Computer Science, University of Athens在 di.uoa.gr 的电子邮件经过验证
Stefan BoettcherPhysics Department, Emory University在 emory.edu 的电子邮件经过验证
Adrian CraciunAssociate Professor, West University Timisoara在 e-uvt.ro 的电子邮件经过验证
S. S. RaviResearch Professor, Biocomplexity Institute, University of Virginia在 virginia.edu 的电子邮件经过验证
Moshe Y. VardiRice University在 cs.rice.edu 的电子邮件经过验证
Cristian S. CaludeProfessor of Computer Science, The University of Auckland在 cs.auckland.ac.nz 的电子邮件经过验证
Leslie Ann GoldbergProfessor of Computer Science, University of Oxford在 cs.ox.ac.uk 的电子邮件经过验证
Catherine GreenhillSchool of Mathematics and Statistics, UNSW Sydney在 unsw.edu.au 的电子邮件经过验证
Martin DyerUniversity of Leeds在 leeds.ac.uk 的电子邮件经过验证
Bruno GonçalvesISI Foundation在 data4sci.com 的电子邮件经过验证
Robert Sumi在 phys.ubbcluj.ro 的电子邮件经过验证

关注

Gabriel Istrate

University of Bucharest

在 acm.org 的电子邮件经过验证 - 首页

Theoretical Comp. Science Artificial Intelligence Complex Systems Social Simulations


标题按引用次数排序按年份排序按标题排序	引用次数引用次数	年份
Strong Edge Coloring for Channel Assignment in Wireless Radio Networks. CL Barrett, G Istrate, VSA Kumar, MV Marathe, S Thite Proceedings of the 1st IEEE Workshop on Foundations of Wireless Networks …, 2006	116	2006
Computational complexity and statistical physics A Percus, G Istrate, C Moore Oxford University Press, 2006	101	2006
The phase transition in 1-in-k SAT and NAE 3-SAT D Achlioptas, A Chtcherba, G Istrate, C Moore Proceedings of SODA'2001, the ACM-SIAM Symposium on Discrete Algorithms 1, 2001	95	2001
Convergence of the iterated prisoner's dilemma game M Dyer, LA Goldberg, C Greenhill, G Istrate, M Jerrum Combinatorics, Probability and Computing, 2000	32	2000
Spines of random constraint satisfaction problems: definition and connection with computational complexity G Istrate, S Boettcher, AG Percus Annals of Mathematics and Artificial Intelligence 44, 353-372, 2005	25*	2005
A continuous–discontinuous second‐order transition in the satisfiability of random Horn‐SAT formulas C Moore, G Istrate, D Demopoulos, MY Vardi Random Structures & Algorithms 31 (2), 173-185, 2007	18	2007
Threshold properties of random boolean constraint satisfaction problems G Istrate Discrete applied mathematics 153 (1-3), 141-152, 2005	18*	2005
Adversarial scheduling in discrete models of social dynamics G Istrate, MV Marathe, SS Ravi Mathematical Structures in Computer Science 22 (5), 788-815, 2012	17*	2012
The peculiar phase structure of random graph bisection AG Percus, G Istrate, B Gonçalves, RZ Sumi, S Boettcher Journal of Mathematical Physics 49 (12), 2008	17	2008
The phase transition in random Horn satisfiability and its algorithmic implications G Istrate Random Structures and Algorithms 20 (4), 483-506, 2002	17*	2002
Looking for a version of Schaefer's dichotomy theorem when each variable occurs at most twice G Istrate Technical Report 652, University of Rochester. Department of Computer Science, 1997	15	1997
Computational complexity and phase transitions G Istrate Proceedings 15th Annual IEEE Conference on Computational Complexity, 104-115, 2000	14	2000
Short Proofs of the Kneser-Lovász Coloring Principle J Aisenberg, ML Bonet, S Buss, A Craciun, G Istrate Information and Computation (special issue for ICALP'2015), 2018	11	2018
Partition into heapable sequences, heap tableaux and a multiset extension of Hammersley's process G Istrate, C Bonchis Proceedings of CPM'2015, the 26th Annual Symposium on Combinatorial Pattern …, 2015	11	2015
Mechanism design with predictions for obnoxious facility location G Istrate, C Bonchis arXiv preprint arXiv:2212.09521, 2022	8	2022
Proof complexity and the Kneser-Lovász theorem G Istrate, A Craciun Proceedings of SAT'2014, 17th International Conference on Theory and …, 2014	8	2014
On the dynamics of social balance on general networks (with an application to XOR-SAT) G Istrate Fundamenta Informaticae 91 (2), 341-356, 2008	8	2008
Semantic compression of TCP traces G Istrate, A Hansson, S Thulasidasan, M Marathe, C Barrett Proceedings of IFIP NETWORKING 2006, Lecture Notes in Computer Science 3976 …, 2006	8	2006
The strong equivalence of ET0L grammars G Istrate Information Processing Letters 4 (62), 171-176, 1997	8*	1997
Recursive Baire classification and speedable functions C Calude, G Istrate, M Zimand Mathematical Logic Quarterly 38 (1), 169-178, 1992	8	1992

系统目前无法执行此操作，请稍后再试。

文章 1–20

每年引用数

重复的引用

合并的引用

添加合著者合著作者

上传 PDF

关注此作者

引用次数

合著作者

引用