John Iacono

Citirano

	Sve	Od 2018.
Citati	2667	1186
H-indeks	26	16
i10-indeks	54	31

280

140

210

200220032004200520062007200820092010201120122013201420152016201720182019202020212022202335 19 46 38 44 62 91 70 88 105 161 170 129 104 138 130 157 213 184 278 254 98

Javni pristup

Prikaži sve

28 članaka

1 članak

dostupno

nije dostupno

Na temelju uvjeta financiranja

Suautori

Stefan LangermanDépartement d'Informatique, Université Libre de BruxellesPotvrđena adresa e-pošte na ulb.ac.be
Erik DemaineProfessor of Electrical Engineering and Computer Science, Massachusetts Institute of TechnologyPotvrđena adresa e-pošte na mit.edu
Pat MorinCarleton UniversityPotvrđena adresa e-pošte na scs.carleton.ca
Prosenjit BoseCarleton UniversityPotvrđena adresa e-pošte na scs.carleton.ca
Jean CardinalUniversité libre de Bruxelles (ULB)Potvrđena adresa e-pošte na ulb.be
David BremnerUniversity of New BrunswickPotvrđena adresa e-pošte na unb.ca
Jeff EricksonProfessor of Computer Science, University of Illinois, Urbana-ChampaignPotvrđena adresa e-pošte na illinois.edu
Vida DujmovicUniversity of OttawaPotvrđena adresa e-pošte na uottawa.ca
Martin DemaineMITPotvrđena adresa e-pošte na mit.edu
Boris AronovProfessor of Computer Science, Tandon School of Engineering, New York UniversityPotvrđena adresa e-pošte na nyu.edu
Perouz TaslakianElement AIPotvrđena adresa e-pošte na elementai.com
Ozgur OzkanNYUPotvrđena adresa e-pošte na nyu.edu
Michael A. BenderStony Brook UniversityPotvrđena adresa e-pošte na cs.stonybrook.edu
Mihai PatrascuAT&T LabsPotvrđena adresa e-pošte na alum.mit.edu
Rajeev RamanProfessor, Department of Informatics, University of LeicesterPotvrđena adresa e-pošte na leicester.ac.uk
Gerth Stølting BrodalAarhus UniversityPotvrđena adresa e-pošte na cs.au.dk
Srinivasa Rao SattiProfessor, NTNUPotvrđena adresa e-pošte na ntnu.no
Stefanie WuhrerINRIA Grenoble Rhone-AlpesPotvrđena adresa e-pošte na inria.fr
Vera SacristánUniversitat Politècnica de CatalunyaPotvrđena adresa e-pošte na upc.edu
Sarah R. AllenCarnegie Mellon UniversityPotvrđena adresa e-pošte na cs.cmu.edu

Prati

John Iacono

Université Libre de Bruxelles

Potvrđena adresa e-pošte na ulb.ac.be - Početna stranica

Algorithms Data Structures Computational Geometry


Naslov Poredaj po navodima Poredaj po godini Poredaj po naslovu	Citirano Citirano	Godina
Lecture notes in computer science (including subseries lecture notes in artificial intelligence and lecture notes in bioinformatics): Preface M Abe, K Aoki, G Ateniese, R Avanzi, Z Beerliová, O Billet, A Biryukov, ... Lecture Notes in Computer Science (including subseries Lecture Notes in …, 2006	413*	2006
Output-sensitive algorithms for computing nearest-neighbour decision boundaries D Bremner, E Demaine, J Erickson, J Iacono, S Langerman, P Morin, ... Discrete & Computational Geometry 33, 593-604, 2005	264	2005
Dynamic optimality—almost ED Demaine, D Harmon, J Iacono, M P a ˇ traşcu SIAM Journal on Computing 37 (1), 240-251, 2007	124	2007
Space-efficient planar convex hull algorithms H Brönnimann, J Iacono, J Katajainen, P Morin, J Morrison, G Toussaint Theoretical Computer Science 321 (1), 25-40, 2004	94*	2004
A locality-preserving cache-oblivious dynamic dictionary MA Bender, Z Duan, J Iacono, J Wu Journal of Algorithms 53 (2), 115-136, 2004	90	2004
Alternatives to splay trees with O(log n) worst-case access times J Iacono Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms …, 2001	90	2001
Improved upper bounds for pairing heaps J Iacono arXiv preprint arXiv:1110.4428, 2011	81*	2011
The geometry of binary search trees ED Demaine, D Harmon, J Iacono, D Kane, M Patraşcu Proceedings of the twentieth annual ACM-SIAM symposium on Discrete …, 2009	74	2009
Retroactive data structures ED Demaine, J Iacono, S Langerman ACM Transactions on Algorithms (TALG) 3 (2), 13-es, 2007	62	2007
Necklaces, Convolutions, and X + Y D Bremner, TM Chan, ED Demaine, J Erickson, F Hurtado, J Iacono, ... European Symposium on Algorithms, 160-171, 2006	61	2006
Necklaces, Convolutions, and X+Y D Bremner, TM Chan, ED Demaine, J Erickson, F Hurtado, J Iacono, ... Algorithmica 69 (2), 294-314, 2014	60	2014
The cost of cache-oblivious searching MA Bender, GS Brodal, R Fagerberg, D Ge, S He, H Hu, J Iacono, ... Algorithmica 61 (2), 463-505, 2011	51	2011
Expected asymptotically optimal planar point location J Iacono Computational Geometry 29 (1), 19-22, 2004	51*	2004
Output-sensitive algorithms for Tukey depth and related problems D Bremner, D Chen, J Iacono, S Langerman, P Morin Statistics and Computing 18 (3), 259-266, 2008	49	2008
A unified access bound on comparison-based dynamic dictionaries M Bădoiu, R Cole, ED Demaine, J Iacono Theoretical Computer Science 382 (2), 86-96, 2007	49	2007
Cache-oblivious dynamic dictionaries with update/query tradeoffs GS Brodal, ED Demaine, JT Fineman, J Iacono, S Langerman, JI Munro Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete …, 2010	45	2010
Proximity graphs: E, δ, Δ, χ and ω P Bose, V Dujmović, F Hurtado, J Iacono, S Langerman, H Meijer, ... International Journal of Computational Geometry & Applications 22 (05), 439-469, 2012	43	2012
Key-independent optimality J Iacono Algorithmica 42, 3-10, 2005	40	2005
Using hashing to solve the dictionary problem (in external memory) J Iacono, M Pătraşcu Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete …, 2012	39	2012
Geodesic ham-sandwich cuts P Bose, ED Demaine, F Hurtado, J Iacono, S Langerman, P Morin Proceedings of the twentieth annual symposium on Computational geometry, 1-9, 2004	37	2004

Sustav trenutno ne može provesti ovu radnju. Pokušajte ponovo kasnije.

Članci 1–20

Godišnji broj citata

Dvostruki navodi

Spojeni navodi

Dodavanje suautoraSuautori

Prati

Citirano

Suautori