Rasmus Pagh

Publikation

Publikationer pr. år 2007 2009 2010 2013 2014 2015 2016 2017 2020 2022

• 57 Konferencebidrag i proceedings
• 23 Tidsskriftartikel
• 7 Konferenceartikel
• 3 Encyclopædiartikel
• 4 Mere
  • 1 Rapport
  • 1 Konferenceabstrakt til konference
  • 1 Bidrag til avis - Kronik
  • 1 Patent

Publikationer pr. år

Publikationer pr. år

Søgeresultater

• 2022

  DEANN: Speeding up Kernel-Density Estimation using Approximate Nearest Neighbor Search

  Aumüller, M., Karppa, M. & Pagh, R., 2022, AISTATS 2022: International Conference on Artificial Intelligence and Statistics. Bind 151. s. 3108-3137

  Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review

  Åben adgang
• 2021

  Differentially Private Sparse Vectors with Low Error, Optimal Space, and Fast Access

  Aumüller, M., Pagh, R. & Lebeda, C. J., 2021, Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security. Association for Computing Machinery, 14 s.

  Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review

  Åben adgang

  Fil

• Efficient Differentially Private F0 Linear Sketching

  Pagh, R. & Nielsen, N. M. S., 2021, 24th International Conference on Database Theory (ICDT 2021). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, (Leibniz International Proceedings in Informatics (LIPIcs)).

  Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review

  Åben adgang

  Fil
• 2020

  Composable Sketches for Functions of Frequencies: Beyond the Worst Case

  Cohen, E., Geri, O. & Pagh, R., 2020, Proceedings of the 37 th International Conference on Machine Learning. ML Research Press

  Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review

  Åben adgang

  Fil

  • Machine learning 100%
  • Data Analytics 49%
  • Polynomials 35%
  • Pipelines 34%
  • Statistics 34%

• Confirmation Sampling for Exact Nearest Neighbor Search

  Christiani, T. L., Pagh, R. & Thorup, M., 2020, SISAP 2020: Similarity Search and Applications. Springer, s. 97-110 (Lecture Notes in Computer Science, Bind 12440).

  Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review

  Åben adgang

  Fil

  • Nearest neighbor search 100%
  • Data structures 62%
  • Sampling 53%
  • Set theory 12%

• Fair Near Neighbor Search: Independent Range Sampling in High Dimensions. PODS

  Aumüller, M., Pagh, R. & Silvestri, F., 2020, PODS'20: Proceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems. Association for Computing Machinery, s. 191–204

  Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review

  Åben adgang

  Fil

  • Nearest neighbor search 100%
  • Data structures 62%
  • Sampling 53%
  • Computer science 19%

• Oblivious Sketching of High-Degree Polynomial Kernels

  Ahle, T. D., Kapralov, M., Knudsen, J. B. T., Pagh, R., Velingker, A., Woodruff, D. & Zandieh, A., 2020, SODA '20: Proceedings of the Thirty-First Annual ACM-SIAM Symposium on Discrete Algorithms. Association for Computing Machinery, 20 s.

  Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review

  Åben adgang

  Fil

  • Linear algebra 100%
  • Polynomials 61%
  • Scalability 31%
  • Machine learning 29%

• On the I/O Complexity of the k-Nearest Neighbors Problem

  Goswami, M., Jacob, R. & Pagh, R., jun. 2020, PODS'20: Proceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems. Association for Computing Machinery, s. 205-212 (ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems).

  Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review

  Åben adgang

  Fil

  • Polynomials 100%
  • Nearest neighbor search 85%
  • Approximation algorithms 70%
  • Data structures 53%
  • Data storage equipment 39%

• Private Aggregation from Fewer Anonymous Messages

  Ghazi, B., Manurangsi, P., Pagh, R. & Velingker, A., 2020, Advances in Cryptology – EUROCRYPT 2020. Springer, s. 798-827 (Lecture Notes in Computer Science, Bind 12106).

  Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review

  Åben adgang

  Fil

• Private Counting from Anonymous Messages: Near-Optimal Accuracy with Vanishing Communication Overhead

  Ghazi, B., Kumar, R., Manurangsi, P. & Pagh, R., 2020, Proceedings of the 37th International Conference on Machine Learning. ML Research Press

  Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review

  Åben adgang

  Fil

  • Communication 100%
  • Agglomeration 34%
  • Machine learning 29%

• Pure Differentially Private Summation from Anonymous Messages

  Ghazi, B., Golowich, N., Kumar, R., Manurangsi, P., Pagh, R. & Velingker, A., 2020, 1st Conference on Information-Theoretic Cryptography (ITC 2020). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, s. 15:1–15:23 (Leibniz International Proceedings in Informatics, Bind 163).

  Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review

  Åben adgang

  Fil

  • Summation 100%
  • Model 33%
  • Binary 25%
  • Communication 20%
  • Total Variation Distance 14%

• The space complexity of inner product filters

  Pagh, R. & Sivertsen, J. V. T., 2020, 23rd International Conference on Database Theory (ICDT 2020). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, s. 22:1–22:14 (Leibniz International Proceedings in Informatics (LIPIcs), Bind 155).

  Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review

  Åben adgang

  Fil

  • Dimensionality reduction 100%

• WOR and p’s: Sketches for Lp-sampling Without Replacement

  Cohen, E., Pagh, R. & Woodruff, D., 2020, 34th Conference on Neural Information Processing Systems (NeurIPS 2020). Neural Information Processing Systems

  Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review

  Åben adgang

  Fil
• 2019

  Hardness of Bichromatic Closest Pair with Jaccard Similarity

  Pagh, R., Nielsen, N. M. S. & Thorup, M., 2019, LIPIcs - Leibniz International Proceedings in Informatics - 27th Annual European Symposium on Algorithms (ESA 2019). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Bind 144. s. 80:1–80:13 13 s. 80. (Leibniz International Proceedings in Informatics).

  Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review

  Åben adgang

  Fil

  • Hardness 100%
  • Similarity 84%
  • Hashing 42%
  • Locality 39%
  • Similarity Measure 20%

• PUFFINN: Parameterless and Universally Fast FInding of Nearest Neighbors

  Christiani, T. L., Pagh, R., Aumüller, M. & Vesterli, M. E., 2019, 27th Annual European Symposium on Algorithms (ESA 2019). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, s. 1-16 16 s. 10

  Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review

  Åben adgang

  Fil

  • Nearest neighbor search 100%
  • Data storage equipment 23%
  • Experiments 13%

• Space-efficient Feature Maps for String Alignment Kernels

  Tabei, Y., Yamanishi, Y. & Pagh, R., 2019, IEEE International Conference on Data Mining (ICDM). IEEE Computer Society Press, (IEEE International Conference on Data Mining (ICDM)).

  Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review

  Åben adgang

  Fil

  • Scalability 100%
  • Data storage equipment 75%
• 2018

  Distance-Sensitive Hashing

  Aumüller, M., Christiani, T. L., Pagh, R. & Silvestri, F., 2018, Proceedings of the 37th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database System. New York, NY, USA: Association for Computing Machinery, s. 89-104 15 s.

  Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review

  Åben adgang

  Fil

  • Hash functions 100%
  • Cleaning 79%
  • Information management 78%

• Scalable and Robust Set Similarity Join

  Christiani, T. L., Pagh, R. & Sivertsen, J. V. T., 2018, Proceedings of IEEE 34th International Conference on Data Engineering (ICDE). IEEE, (Proceedings of the International Conference on Data Engineering).

  Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review

  Åben adgang

  Fil

  • Set theory 100%
  • Experiments 27%

• Set Similarity Search for Skewed Data

  McCauley, S., Mikkelsen, J. W. & Pagh, R., 2018, Proceedings of Principles of Database Systems (PODS). Association for Computing Machinery

  Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review

  Åben adgang

  Fil

  • Data structures 100%
  • Cleaning 37%
• 2017

  Distance Sensitive Bloom Filters Without False Negatives

  Goswami, M., Pagh, R., Silvestri, F. & Sivertsen, J., 2017, Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017, Barcelona, Spain, Hotel Porta Fira, January 16-19. Society for Industrial and Applied Mathematics, s. 257-269 13 s.

  Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review

  Åben adgang

  Fil

  • Data structures 100%
  • Hamming distance 76%

• Parameter-free Locality Sensitive Hashing for Spherical Range Reporting

  Ahle, T. D., Pagh, R. & Aumüller, M., 2017, Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, 18 s.

  Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review

  Åben adgang

  Fil

  • Data structures 100%

• Range-efficient consistent sampling and locality-sensitive hashing for polygons

  Gudmundsson, J. & Pagh, R., 2017, Proceedings of 28th International Symposium on Algorithms and Computation (ISAAC 2017). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, 15 s. (Leibniz International Proceedings in Informatics).

  Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review

  Åben adgang

  • Sampling 100%
  • Data structures 58%

• Set Similarity Search Beyond Minhash

  Christiani, T. L. & Pagh, R., 2017, Proceedings of 47th ACM Symposium on Theory of Computing (STOC). Association for Computing Machinery

  Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review

  Åben adgang
• 2016

  Locality-sensitive Hashing without False Negatives

  Pagh, R., 2016, Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, s. 1-9

  Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review

  • Hashing 100%
  • Locality 92%
  • False 76%
  • Collision 39%
  • Similarity Search 32%

• On the Complexity of Inner Product Similarity Join

  Ahle, T. D., Pagh, R., Razenshteyn, I. & Silvestri, F., 2016, PODS '16 Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems. Association for Computing Machinery, s. 151-164

  Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review

  Åben adgang

  • Hardness 100%
  • Recommender systems 63%
  • Information retrieval 61%

• Scalability and Total Recall with Fast CoveringLSH

  Pham, N. D. & Pagh, R., 2016, Proceedings of the 25th ACM International on Conference on Information and Knowledge Management: CIKM '16. Association for Computing Machinery, s. 1109-1118

  Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review

  Åben adgang

  Fil

  • Hash functions 100%
  • Scalability 68%
  • Experiments 30%
• 2015

  Approximate Furthest Neighbor in High Dimensions

  Pagh, R., Silvestri, F., Sivertsen, J. V. T. & Skala, M., 2015, Similarity Search and Applications: 8th International Conference, SISAP 2015, Glasgow, UK, October 12–14, 2015, Proceedings. Springer, s. 3-14 (Lecture Notes in Computer Science, Bind 9371).

  Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review

  Åben adgang

  Fil

  • Data structures 100%
  • Nearest neighbor search 79%
  • Recommender systems 60%

• Approximate Range Emptiness in Constant Time and Optimal Space

  Goswami, M., Jørgensen, A. G., Larsen, K. G. & Pagh, R., 2015, Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, s. 769-775

  Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review

• From Independence to Expansion and Back Again

  Christiani, T. L., Pagh, R. & Thorup, M., 2015, STOC '15 Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing. Association for Computing Machinery, s. 813-820

  Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review

  • Independence 100%
  • Hash Function 92%
  • Lower bound 74%
  • Expander Graphs 52%
  • Expander 47%

• I/O-Efficient Similarity Join

  Pagh, R., Pham, N. D., Silvestri, F. & Stöckel, M., 14 sep. 2015, Algorithms - ESA 2015: 23rd Annual European Symposium, Patras, Greece, September 14-16, 2015, Proceedings. Springer, s. 941-952 12 s. (Lecture Notes in Computer Science, Bind 9294).

  Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review

  Åben adgang

  Fil

  • Data storage equipment 100%

• Large-Scale Similarity Joins With Guarantees

  Pagh, R., 2015, 18th International Conference on Database Theory (ICDT 2015). Bind 31. s. 15-24 (Leibniz International Proceedings in Informatics).

  Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review

  Åben adgang

  Fil

  • Costs 100%

• The Input/Output Complexity of Sparse Matrix Multiplication

  Stöckel, M. & Pagh, R., 2015, Algorithms - ESA 2014: 22th Annual European Symposium, Wroclaw, Poland, September 8-10, 2014. Proceedings. Springer, Bind 8737. s. 750-761 (Lecture Notes in Computer Science).

  Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review

  Åben adgang

  Fil
• 2014

  Efficient estimation for high similarities using odd sketches

  Mitzenmacher, M., Pagh, R. & Pham, N. D., 2014, Proceedings of the 23rd international conference on World wide web: WWW '14. Association for Computing Machinery, s. 109-118 10 s.

  Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review

  • Association rules 100%
  • Computer applications 55%
  • Collaborative filtering 51%
  • Set theory 29%
  • Experiments 16%

• Generating k-independent variables in constant time

  Christiani, T. L. & Pagh, R., 2014, Foundations of Computer Science (FOCS), 2014 IEEE 55th Annual Symposium on. IEEE, s. 196-205

  Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review

  • Time Constant 100%
  • Galois field 71%
  • Algorithms and Data Structures 65%
  • Generator 63%
  • Space Complexity 54%

• Is Min-Wise Hashing Optimal for Summarizing Set Intersection?

  Pagh, R., Stöckel, M. & Woodruff, D., 2014, Proceedings of the 2014 ACM SIGMOD international conference on Management of data. Association for Computing Machinery, s. 109-120

  Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review

• Listing Triangles

  Björklund, A., Pagh, R., Vassilevska Williams, V. & Zwick, U., 2014, Automata, Languages, and Programming, 41st International Colloquium, ICALP 2014. Springer, s. 223-234

  Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review

  • computer science 100%
  • programming 89%

• MapReduce Triangle Enumeration With Guarantees

  Park, H-M., Silvestri, F., Kang, U. & Pagh, R., 2014, CIKM '14 Proceedings of the 23rd ACM International Conference on Conference on Information and Knowledge Management . Association for Computing Machinery, s. 1739-1748

  Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review

• The Input/Output Complexity of Triangle Enumeration

  Pagh, R. & Silvestri, F., 2014, PODS '14 Proceedings of the 33rd ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems . Association for Computing Machinery

  Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review

• Triangle counting in dynamic graph streams

  Kutzkov, K. & Pagh, R., 2014, Algorithm Theory – SWAT 2014. Springer

  Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review
• 2013

  Fast and Scalable Polynomial Kernels via Explicit Feature Maps

  Pham, N. D. & Pagh, R., 2013, KDD '13 Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining. Association for Computing Machinery, s. 239-249

  Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review

• On the streaming complexity of computing local clustering coefficients

  Kutzkov, K. & Pagh, R., 2013, WSDM '13 Proceedings of the sixth ACM international conference on Web search and data mining. Association for Computing Machinery, s. 677-686 9 s.

  Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review
• 2012

  A Near-linear Time Approximation Algorithm for Angle-based Outlier Detection in High-dimensional Data

  Pham, N. D. & Pagh, R., 12 aug. 2012, KDD '12 Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining . Association for Computing Machinery, s. 877-885 9 s.

  Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review

  Fil

  • Approximation algorithms 100%
  • Anomaly detection 96%
  • Data mining 38%
  • Experiments 16%

• Compressed Matrix Multiplication

  Pagh, R., 2012, ITCS 12. Proceedings of the Innovations in Theoretical Computer Science Conference, 3 . Association for Computing Machinery, s. 442-451

  Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review

• I/O-Efficient Data Structures for Colored Range and Prefix Reporting

  Larsen, K. G. & Pagh, R., 2012, SODA 12: Proceedings of 23rd ACM-SIAM Symposium on Discrete Algorithms (SODA). Association for Computing Machinery, s. 583-592

  Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review
• 2011

  Frequent Pairs in Data Streams: Exploiting Parallelism and Skew

  Campagna, A., Kutzkow, K. & Pagh, R., 2011, Proceedings of IEEE International Conference on Data Mining Workshops: ICDMW 2011. IEEE Computer Society Press, s. 145 - 150

  Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review

  • Data streams 100%
  • Engines 15%
• 2010

  Better Size Estimation for Sparse Matrix Products

  Amossen, R. R., Campagna, A. & Pagh, R., 1 sep. 2010, APPROX 2010 + RANDOM 2010 - Approximation, Randomization, and Combinatorial Oprimization: Proceedings of the 13th international workshop Approx 2010 and 14th International workshop Random 2010, Barcelona, Spain, September 2010. Springer, 14 s.

  Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review

  • Sampling 100%

• Cache-oblivious Hashing

  Pagh, R., Wei, Z. & Yi, K., 2010, Proceedings of Principles of Database Systems. Association for Computing Machinery

  Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review

• On finding frequent patterns in event sequences

  Campagna, A. & Pagh, R., 14 dec. 2010, ICDM 2010: Proceedings of the Tenth IEEE International Conference on Data Mining. IEEE Computer Society Press, 6 s.

  Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review

  • Airports 100%
  • Radio frequency identification (RFID) 94%
  • Labels 84%

• On finding similar items in a stream of transactions

  Campagna, A. & Pagh, R., 14 dec. 2010, KDCloud 2010: Proceedings of the International Workshop on Knowledge Discovery Using Cloud and Distributed Computing Platforms . IEEE Computer Society Press, 8 s.

  Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review

  • Data streams 100%
  • Data mining 40%

• Tight Thresholds for Cuckoo Hashing via XORSAT

  Dietzfelbinger, M., Goerdt, A., Mitzenmacher, M., Montanari, A., Pagh, R. & Rink, M., 2010, Proceedings of International Colloquium on Automata, Languages and Programming. LNCS: Springer

  Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review