Department of Computer Science

Aarhus University Seal / Aarhus Universitets segl
You are here: Department of Computer Science » Contact » Peyman Afshani » Research outputs

Contact

Peyman Afshani

1 - 24 out of 24Page size: 100
RSS feed of this list
  1. 2019
  2. Published

    Lower bounds for multiplication via network coding. / Afshani, Peyman; Freksen, Casper Benjamin; Kamma, Lior; Larsen, Kasper Green.

    In: Leibniz International Proceedings in Informatics, LIPIcs, 07.2019.

    Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaper › Conference article › Research

  3. Published

    A new lower bound for semigroup orthogonal range searching. / Afshani, Peyman.

    35th International Symposium on Computational Geometry, SoCG 2019. ed. / Gill Barequet; Yusu Wang. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2019. 3 (Leibniz International Proceedings in Informatics, LIPIcs, Vol. 129).

    Research output: Contribution to book/anthology/report/proceeding › Article in proceedings › Research › peer-review

  4. Published

    The query complexity of a permutation-based variant of Mastermind. / Afshani, Peyman; Agrawal, Manindra; Doerr, Benjamin; Doerr, Carola; Larsen, Kasper Green; Mehlhorn, Kurt.

    In: Discrete Applied Mathematics, Vol. 260, 05.2019, p. 28-50.

    Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaper › Journal article › Research › peer-review

  5. Published

    Independent range sampling, revisited again. / Afshani, Peyman; Phillips, Jeff M.

    35th International Symposium on Computational Geometry, SoCG 2019. ed. / Gill Barequet; Yusu Wang. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2019. 4 (Leibniz International Proceedings in Informatics, LIPIcs, Vol. 129).

    Research output: Contribution to book/anthology/report/proceeding › Article in proceedings › Research › peer-review

  6. 2018
  7. Published

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

    In: Algorithmica, Vol. 80, No. 11, 11.2018, p. 3192-3206.

    Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaper › Journal article › Research › peer-review

  8. Published

    An efficient algorithm for the 1D total visibility-index problem and its parallelization. / Afshani, Peyman; De Berg, Mark; Casanova, Henri; Karsin, Ben; Lambrechts, Colin; Sitchinava, Nodari; Tsirogiannis, Constantinos.

    In: ACM Journal of Experimental Algorithmics, Vol. 23, 2.3, 01.08.2018.

    Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaper › Journal article › Research › peer-review

  9. 2017
  10. Published

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

    25th European Symposium on Algorithms, ESA 2017. ed. / Kirk Pruhs; Christian Sohler. Vol. 87 Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, 2017. p. 2:1-2:13 2 (Leibniz International Proceedings in Informatics, Vol. 87).

    Research output: Contribution to book/anthology/report/proceeding › Article in proceedings › Research › peer-review

  11. Published

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

    In: Journal of the ACM, Vol. 64, No. 1, 3, 01.03.2017.

    Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaper › Journal article › Research › peer-review

  12. Published

    Cross-Referenced dictionaries and the limits of write optimization. / Afshani, Peyman; Bender, Michael A.; Farach-Colton, Martin; Fineman, Jeremy T.; Goswami, Mayank; Tsai, Meng Tsung.

    28th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017. ed. / P.N. Klein . Association for Computing Machinery, 2017. p. 1523-1532.

    Research output: Contribution to book/anthology/report/proceeding › Article in proceedings › Research › peer-review

  13. 2016
  14. Published

    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). ed. / Ioannis Chatzigiannakis; Michael Mitzenmacher; Yuval Rabani; Davide Sangiorgi. Vol. 55 Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, 2016. p. 93:1-93:15 (Leibniz International Proceedings in Informatics, Vol. 55).

    Research output: Contribution to book/anthology/report/proceeding › Article in proceedings › Research › peer-review

  15. 2015
  16. Published

    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. ed. / Nikhil Bansal ; Irene Finocchi . Springer VS, 2015. p. 13-24 (Lecture Notes in Computer Science, Vol. 9294).

    Research output: Contribution to book/anthology/report/proceeding › Article in proceedings › Research › peer-review

  17. Published

    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. ed. / Rahul Jain; Sanjay Jain; Frank Stephan. Springer VS, 2015. p. 189-199 (Lecture Notes in Computer Science LNCS, Vol. 9076).

    Research output: Contribution to book/anthology/report/proceeding › Article in proceedings › Research › peer-review

  18. 2014
  19. Published

    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. ed. / Chandra Chekuri . Association for Computing Machinery, 2014. p. 983-994.

    Research output: Contribution to book/anthology/report/proceeding › Article in proceedings › Research › peer-review

  20. Published

    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. ed. / Chandra Chekuri . Association for Computing Machinery, 2014. p. 1414-1423.

    Research output: Contribution to book/anthology/report/proceeding › Article in proceedings › Research › peer-review

  21. Published

    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. ed. / R. Ravi; Inge Li Gørtz. Springer VS, 2014. p. 1-12 (Lecture Notes in Computer Science, Vol. 8503).

    Research output: Contribution to book/anthology/report/proceeding › Article in proceedings › Research › peer-review

  22. Published

    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. ed. / Chandra Chekuri . Association for Computing Machinery, 2014. p. 1389-1398 .

    Research output: Contribution to book/anthology/report/proceeding › Article in proceedings › Research › peer-review

  23. Published

    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. ed. / Javier Esparza ; Pierre Fraigniaud; Thore Husfeldt; Elias Koutsoupias. Springer VS, 2014. p. 77-88 (Lecture Notes in Computer Science, Vol. 8572).

    Research output: Contribution to book/anthology/report/proceeding › Article in proceedings › Research › peer-review

  24. 2013
  25. Published

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

    In: Theory of Computing Systems, Vol. 52, No. 3, 2013, p. 342-366.

    Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaper › Journal article › Research › peer-review

  26. Published

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

    In: Electronic Colloquium on Computational Complexity, Vol. TR13-187, 2013.

    Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaper › Journal article › Research › peer-review

  27. Published

    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. ed. / Andrej Brodnik; Alejandro López-Ortiz; Venkatesh Raman; Alfredo Viola. Springer VS, 2013. p. 1-11 (Lecture Notes in Computer Science, Vol. 8066).

    Research output: Contribution to book/anthology/report/proceeding › Book chapter › Research › peer-review

  28. 2012
  29. Published

    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. p. 323-338.

    Research output: Contribution to book/anthology/report/proceeding › Article in proceedings › Research › peer-review

  30. Published

    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. p. 339-346 .

    Research output: Contribution to book/anthology/report/proceeding › Article in proceedings › Research › peer-review

  31. Published

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

    In: Lecture Notes in Computer Science, Vol. 7501, 2012, p. 48-59 .

    Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaper › Conference article › Research › peer-review

  32. Published

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

    In: Electronic Colloquium on Computational Complexity, No. TR12-087, 2012.

    Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaper › Journal article › Research › peer-review