Aarhus University Seal / Aarhus Universitets segl

Peyman Afshani

  1. 2020
  2. Udgivet

    A lower bound for jumbled indexing. / Afshani, Peyman; van Duijn, Ingo; Killmann, Rasmus; Nielsen, Jesper Sindahl.

    Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms. red. / Shuchi Chawla. Association for Computing Machinery, 2020. s. 592-606.

    Publikation: Bidrag til bog/antologi/rapport/proceedingKonferencebidrag i proceedingsForskningpeer review

  3. Udgivet

    Revisiting the theory and practice of database cracking. / Zardbani, Fatemeh; Afshani, Peyman; Karras, Panagiotis.

    Advances in Database Technology - EDBT 2020: 23rd International Conference on Extending Database Technology, Proceedings. red. / Angela Bonifati; Yongluan Zhou; Marcos Antonio Vaz Salles; Alexander Bohm; Dan Olteanu; George Fletcher; Arijit Khan; Bin Yang. openproceedings.org, 2020. s. 415-418 (Advances in Database Technology - EDBT, Bind 2020-March).

    Publikation: Bidrag til bog/antologi/rapport/proceedingKonferencebidrag i proceedingsForskningpeer review

  4. 2019
  5. Udgivet

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

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

    Publikation: Bidrag til bog/antologi/rapport/proceedingKonferencebidrag i proceedingsForskningpeer review

  6. Udgivet

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

    I: Discrete Applied Mathematics, Bind 260, 05.2019, s. 28-50.

    Publikation: Bidrag til tidsskrift/Konferencebidrag i tidsskrift /Bidrag til avisTidsskriftartikelForskningpeer review

  7. Udgivet

    Fragile complexity of comparison-based algorithms. / Afshani, Peyman; Fagerberg, Rolf; Hammer, David; Jacob, Riko; Kostitsyna, Irina; Meyer, Ulrich; Penschuck, Manuel; Sitchinava, Nodari.

    27th Annual European Symposium on Algorithms, ESA 2019. red. / Michael A. Bender; Ola Svensson; Grzegorz Herman. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2019. 2 (Leibniz International Proceedings in Informatics, LIPIcs, Bind 144).

    Publikation: Bidrag til bog/antologi/rapport/proceedingKonferencebidrag i proceedingsForskningpeer review

  8. Udgivet

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

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

    Publikation: Bidrag til bog/antologi/rapport/proceedingKonferencebidrag i proceedingsForskningpeer review

  9. Udgivet

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

    I: Leibniz International Proceedings in Informatics, LIPIcs, Bind 132, 10, 2019.

    Publikation: Bidrag til tidsskrift/Konferencebidrag i tidsskrift /Bidrag til avisKonferenceartikelForskning

  10. 2018
  11. Udgivet

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

    I: Algorithmica, Bind 80, Nr. 11, 11.2018, s. 3192-3206.

    Publikation: Bidrag til tidsskrift/Konferencebidrag i tidsskrift /Bidrag til avisTidsskriftartikelForskningpeer review

  12. Udgivet

    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.

    I: ACM Journal of Experimental Algorithmics, Bind 23, 2.3, 01.08.2018.

    Publikation: Bidrag til tidsskrift/Konferencebidrag i tidsskrift /Bidrag til avisTidsskriftartikelForskningpeer review

  13. 2017
  14. 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 (Leibniz International Proceedings in Informatics, Bind 87).

    Publikation: Bidrag til bog/antologi/rapport/proceedingKonferencebidrag i proceedingsForskningpeer review

  15. 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: Bidrag til tidsskrift/Konferencebidrag i tidsskrift /Bidrag til avisTidsskriftartikelForskningpeer review

  16. Udgivet

    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. red. / P.N. Klein . Association for Computing Machinery, 2017. s. 1523-1532.

    Publikation: Bidrag til bog/antologi/rapport/proceedingKonferencebidrag i proceedingsForskningpeer review

  17. 2016
  18. 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 (Leibniz International Proceedings in Informatics, Bind 55).

    Publikation: Bidrag til bog/antologi/rapport/proceedingKonferencebidrag i proceedingsForskningpeer review

  19. 2015
  20. 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 (Lecture Notes in Computer Science, Bind 9294).

    Publikation: Bidrag til bog/antologi/rapport/proceedingKonferencebidrag i proceedingsForskningpeer review

  21. 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 (Lecture Notes in Computer Science LNCS, Bind 9076).

    Publikation: Bidrag til bog/antologi/rapport/proceedingKonferencebidrag i proceedingsForskningpeer review

  22. 2014
  23. 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: Bidrag til bog/antologi/rapport/proceedingKonferencebidrag i proceedingsForskningpeer review

  24. 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: Bidrag til bog/antologi/rapport/proceedingKonferencebidrag i proceedingsForskningpeer review

  25. 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 (Lecture Notes in Computer Science, Bind 8503).

    Publikation: Bidrag til bog/antologi/rapport/proceedingKonferencebidrag i proceedingsForskningpeer review

  26. 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: Bidrag til bog/antologi/rapport/proceedingKonferencebidrag i proceedingsForskningpeer review

  27. 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 (Lecture Notes in Computer Science, Bind 8572).

    Publikation: Bidrag til bog/antologi/rapport/proceedingKonferencebidrag i proceedingsForskningpeer review

  28. 2013
  29. 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: Bidrag til tidsskrift/Konferencebidrag i tidsskrift /Bidrag til avisTidsskriftartikelForskningpeer review

  30. Udgivet

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

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

    Publikation: Bidrag til tidsskrift/Konferencebidrag i tidsskrift /Bidrag til avisTidsskriftartikelForskningpeer review

  31. 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 (Lecture Notes in Computer Science, Bind 8066).

    Publikation: Bidrag til bog/antologi/rapport/proceedingBidrag til bog/antologiForskningpeer review

  32. 2012
  33. 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: Bidrag til bog/antologi/rapport/proceedingKonferencebidrag i proceedingsForskningpeer review

  34. 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: Bidrag til bog/antologi/rapport/proceedingKonferencebidrag i proceedingsForskningpeer review

  35. 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: Bidrag til tidsskrift/Konferencebidrag i tidsskrift /Bidrag til avisKonferenceartikelForskningpeer review

  36. 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: Bidrag til tidsskrift/Konferencebidrag i tidsskrift /Bidrag til avisTidsskriftartikelForskningpeer review