Arge, L.
, Brodal, G. S., Truelsen, J. & Tsirogiannis, C. (2013).
An optimal and practical cache-oblivious algorithm for computing multiresolution rasters. I
Algorithms – ESA 2013: 21st Annual European Symposium, Sophia Antipolis, France, September 2-4, 2013. Proceedings (s. 61-72). Springer VS.
https://doi.org/10.1007/978-3-642-40450-4_6
Andersen, A. H., Clausen, K. K., Normand, S., Vikstrøm, T.
& Moeslund, J. E. (2023).
The influence of landscape characteristics on breeding bird dark diversity.
Oecologia,
201(4), 1039-1052.
https://doi.org/10.1007/s00442-023-05351-8
Alstrup, S.
, Brodal, G. S., Gørtz, I. L. & Rauhe, T. (2002).
Time and Space Efficient Multi-Method Dispatching. I M. Penttonen & E. M. Schmidt (red.),
Algorithm Theory — SWAT 2002: 8th Scandinavian Workshop on Algorithm Theory Turku, Finland, July 3–5, 2002 Proceedings (s. 20-29). Springer.
https://doi.org/10.1007/3-540-45471-3_3
Alstrup, S.
, Brodal, G. S. & Rauhe, T. (2000).
Pattern matching in dynamic texts. I D. Shmoys (red.),
Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms (s. 819-828). Society for Industrial and Applied Mathematics.
Alexander, C.
, Moeslund, J. E., Bøcher, P. K., Arge, L.
& Svenning, J.-C. (2013).
Airborne laser scanner (LiDAR) proxies for understory light conditions.
Remote Sensing of Environment,
134, 152-161.
https://doi.org/10.1016/j.rse.2013.02.028
Alamdari, S., Angelini, P., Chan, T. M., Di Battista, G., Frati, F., Lubiw, A., Patrignani, M., Roselli, V., Singla, S.
& Wilkinson, B. T. (2013).
Morphing Planar Graph Drawings with a Polynomial Number of Steps.
The Annual A C M - S I A M Symposium on Discrete Algorithms. Proceedings,
24, 1656-1667.
http://knowledgecenter.siam.org/0236-000137/0236-000137/1
Alamdari, S., Angelini, P., Barrera-Cruz, F., Chan, T. M., Da Lozzo, G., Di Battista, G., Frati, F., Haxell, P., Lubiw, A., Patrignani, M., Roselli, V., Singla, S.
& Wilkinson, B. T. (2017).
How to Morph Planar Graph Drawings.
S I A M Journal on Computing,
46(2), 824-852.
https://doi.org/10.1137/16M1069171
Afshani, P., Agarwal, P. K., Arge, L.
, Larsen, K. G. & Phillips, J. (2013).
(Approximate) Uncertain Skylines.
Theory of Computing Systems,
52(3), 342-366.
https://doi.org/10.1007/s00224-012-9382-7
Afshani, P., Afrawal, M., Benjamin, D.
, Larsen, K. G., Mehlhorn, K. & Winzen, C. (2012).
The Query Complexity of Finding a Hidden Permutation.
Electronic Colloquium on Computational Complexity, (TR12-087).
http://eccc.hpi-web.de/report/2012/087/
Afshani, P., Chan, T. M. & Tsakalidis, K. (2014).
Deterministic Rectangle Enclosure and Offline Dominance Reporting on the RAM. I J. Esparza , P. Fraigniaud, T. Husfeldt & E. Koutsoupias (red.),
Automata, Languages, and Programming: 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part I (s. 77-88 ). Springer VS.
https://doi.org/10.1007/978-3-662-43948-7_7
Afshani, P., Agrawal, M., Benjamin, D., Doerr, C.
, Larsen, K. G. & Mehlhorn, K. (2013).
The Query Complexity of Finding a Hidden Permutation. I A. Brodnik, A. López-Ortiz, V. Raman & A. Viola (red.),
Space-Efficient Data Structures, Streams, and Algorithms: Papers in Honor of J. Ian Munro on the Occasion of His 66th Birthday (s. 1-11). Springer VS.
https://doi.org/10.1007/978-3-642-40273-9_1
Afshani, P., De Berg, M., Casanova, H., Karsin, B., Lambrechts, C.
, Sitchinava, N. & Tsirogiannis, C. (2017).
An efficient algorithm for the 1D total visibility-index problem. I S. Fekete & V. Ramachandran (red.),
2017 Proceedings of the Ninteenth Workshop on Algorithm Engineering and Experiments (ALENEX) (Bind PRAL17, s. 218-231). Society for Industrial and Applied Mathematics.
https://doi.org/10.1137/1.9781611974768.18
Afshani, P., Bender, M. A., Farach-Colton, M., Fineman, J. T., Goswami, M. & Tsai, M. T. (2017).
Cross-Referenced dictionaries and the limits of write optimization. I P. N. Klein (red.),
28th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017 (s. 1523-1532). Association for Computing Machinery.
Afshani, P., De Berg, M., Casanova, H., Karsin, B., Lambrechts, C.
, Sitchinava, N. & Tsirogiannis, C. (2018).
An efficient algorithm for the 1D total visibility-index problem and its parallelization.
ACM Journal of Experimental Algorithmics,
23, Artikel 2.3.
https://doi.org/10.1145/3209685
Afshani, P., Agrawal, M., Doerr, B., Doerr, C.
, Larsen, K. G. & Mehlhorn, K. (2019).
The query complexity of a permutation-based variant of Mastermind.
Discrete Applied Mathematics,
260, 28-50.
https://doi.org/10.1016/j.dam.2019.01.007