Peyman Afshani

  1. 2017
  2. Udgivet

    Optimal Deterministic Shallow Cuttings for 3-d Dominance Ranges. / Afshani, Peyman; Tsakalidis, Konstantinos.

    I: Algorithmica, 20.09.2017, s. 1-15.

    Publikation: Forskning - peer reviewTidsskriftartikel

  3. Udgivet

    Permuting and batched geometric lower bounds in the I/O model. / Afshani, Peyman; Van Duijn, Ingo.

    25th European Symposium on Algorithms, ESA 2017. red. / Kirk Pruhs; Christian Sohler. Bind 87 Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, 2017. s. 2:1-2:13 2.

    Publikation: Forskning - peer reviewKonferencebidrag i proceedings

  4. Udgivet

    Instance-optimal geometric algorithms. / Madalgo, Peyman Afshani; Barbay, Jérémy; Chan, Timothy M.

    I: Journal of the ACM, Bind 64, Nr. 1, 3, 01.03.2017.

    Publikation: Forskning - peer reviewTidsskriftartikel

  5. 2016
  6. Udgivet

    Data Structure Lower Bounds for Document Indexing Problems. / Afshani, Peyman; Nielsen, Jesper Asbjørn Sindahl.

    43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). red. / Ioannis Chatzigiannakis; Michael Mitzenmacher; Yuval Rabani; Davide Sangiorgi. Bind 55 Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, 2016. s. 93:1-93:15.

    Publikation: Forskning - peer reviewKonferencebidrag i proceedings

  7. 2015
  8. Udgivet

    Sorting and Permuting without Bank Conflicts on GPUs. / Afshani, Peyman; Sitchinava , Nodari .

    Algorithms – ESA 2015: 23rd Annual European Symposium, Patras, Greece, September 14–16, 2015, Proceedings. red. / Nikhil Bansal ; Irene Finocchi . Springer-VS, 2015. s. 13-24.

    Publikation: Forskning - peer reviewKonferencebidrag i proceedings

  9. Udgivet

    Streaming Algorithms for Smallest Intersecting Ball of Disjoint Balls. / Son, Wanbin; Afshani, Peyman.

    Theory and Applications of Models of Computation: 12th Annual Conference, TAMC 2015, Singapore, May 18-20, 2015, Proceedings. red. / Rahul Jain; Sanjay Jain; Frank Stephan. Springer-VS, 2015. s. 189-199 .

    Publikation: Forskning - peer reviewKonferencebidrag i proceedings

  10. 2014
  11. Udgivet

    Concurrent range reporting in two-dimensional space. / Afshani, Peyman; Sheng, Cheng; Tao, Yufei; Wilkinson, Bryan T.

    Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms: SODA 2014; Portland, OR; United States; 5 January 2014 through 7 January 2014. red. / Chandra Chekuri . Association for Computing Machinery, 2014. s. 983-994.

    Publikation: Forskning - peer reviewKonferencebidrag i proceedings

  12. Udgivet

    Fast Computation of Output-Sensitive Maxima in a Word RAM. / Afshani, Peyman.

    Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms: SODA 2014; Portland, OR; United States; 5 January 2014 through 7 January 2014. red. / Chandra Chekuri . Association for Computing Machinery, 2014. s. 1414-1423.

    Publikation: Forskning - peer reviewKonferencebidrag i proceedings

  13. Udgivet

    I/O-efficient range minima queries. / Afshani, Peyman; Sitchinava, Nodari.

    Algorithm Theory – SWAT 2014: 14th Scandinavian Symposium and Workshops, Copenhagen, Denmark, July 2-4, 2014. Proceedings. red. / R. Ravi; Inge Li Gørtz. Springer-VS, 2014. s. 1-12.

    Publikation: Forskning - peer reviewKonferencebidrag i proceedings

  14. Udgivet

    Optimal deterministic shallow cuttings for 3D dominance ranges. / Afshani, Peyman; Tsakalidis, Konstantinos.

    Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms: SODA 2014; Portland, OR; United States; 5 January 2014 through 7 January 2014. red. / Chandra Chekuri . Association for Computing Machinery, 2014. s. 1389-1398 .

    Publikation: Forskning - peer reviewKonferencebidrag i proceedings

  15. Udgivet

    Deterministic Rectangle Enclosure and Offline Dominance Reporting on the RAM. / Afshani, Peyman; Chan, Timothy M.; Tsakalidis, Konstantinos.

    Automata, Languages, and Programming: 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part I. red. / Javier Esparza ; Pierre Fraigniaud; Thore Husfeldt; Elias Koutsoupias. Springer-VS, 2014. s. 77-88 .

    Publikation: Forskning - peer reviewKonferencebidrag i proceedings

  16. 2013
  17. Udgivet

    (Approximate) Uncertain Skylines. / Afshani, Peyman; Agarwal, Pankaj K.; Arge, Lars; Larsen, Kasper Green; Phillips, Jeff.

    I: Theory of Computing Systems, Bind 52, Nr. 3, 2013, s. 342-366.

    Publikation: Forskning - peer reviewTidsskriftartikel

  18. Udgivet

    Property Testing on Linked Lists. / Afshani, Peyman; Matulef, Kevin; Wilkinson, Bryan Thomas.

    I: Electronic Colloquium on Computational Complexity, Bind TR13-187, 2013.

    Publikation: Forskning - peer reviewTidsskriftartikel

  19. Udgivet

    The Query Complexity of Finding a Hidden Permutation. / Afshani, Peyman; Agrawal, Manindra; Benjamin, Doerr; Doerr, Carola; Larsen, Kasper Green; Mehlhorn, Kurt.

    Space-Efficient Data Structures, Streams, and Algorithms: Papers in Honor of J. Ian Munro on the Occasion of His 66th Birthday. red. / Andrej Brodnik; Alejandro López-Ortiz; Venkatesh Raman; Alfredo Viola. Springer-VS, 2013. s. 1-11.

    Publikation: Forskning - peer reviewBidrag til bog/antologi

  20. 2012
  21. Udgivet

    Higher-dimensional Orthogonal Range Reporting and Rectangle Stabbing in the Pointer Machine Model. / Arge, Lars; Afshani, Peyman; Larsen, Kasper Green.

    Proceedings of the 2012 Symposuim on Computational Geometry. Association for Computing Machinery, 2012. s. 323-338.

    Publikation: Forskning - peer reviewKonferencebidrag i proceedings

  22. Udgivet

    Improved pointer machine and I/O lower bounds for simplex range reporting and related problems. / Afshani, Peyman.

    Proceedings of the 2012 Symposuim on Computational Geometry, SoCG. Association for Computing Machinery, 2012. s. 339-346 .

    Publikation: Forskning - peer reviewKonferencebidrag i proceedings

  23. Udgivet

    Lower Bounds for Sorted Geometric Queries in the I/O Model. / Afshani, Peyman; Zeh, Norbert.

    I: Lecture Notes in Computer Science, Bind 7501, 2012, s. 48-59 .

    Publikation: Forskning - peer reviewKonferenceartikel

  24. Udgivet

    The Query Complexity of Finding a Hidden Permutation. / Afshani, Peyman; Afrawal, Manindra; Benjamin, Doerr ; Larsen, Kasper Green; Mehlhorn, Kurt; Winzen, Carola.

    I: Electronic Colloquium on Computational Complexity, Nr. TR12-087, 2012.

    Publikation: Forskning - peer reviewTidsskriftartikel

1382 / i36