Experience
Education
Bio
Rasmus Pagh I'm professor in the Algorithms Group, and head of the Theoretical Computer Science section at the IT University of Copenhagen, Denmark. I am part of the Copenhagen algorithms community. I received my PhD in 2002 from BRICS at the Department of Computer Science, Aarhus University, supervised by Peter Bro Miltersen. My scientific interests are within algorithms and data structures, with an emphasis on big data. I have worked extensively on basic questions in information retrieval and the role of randomness in computing, on problems with applications in databases and knowledge discovery, and on the exploitation of parallelism in modern computer architectures. I am currently running an ERC-funded project on Scalable Similarity Search. See my ORCID entry for more details. There is a short video in which I talk about my work. Outside of work, I have a wonderful family that I spend most of my time with (personal info). Research: Papers and talks Current PhD students: Johan Sivertsen, Tobias Lybecker Christiani, Thomas Dybdahl Ahle. Graduated PhD students: Christian Worm Mortensen (thesis 2006, now at Octoshape), Milan Ruzic (thesis 2009, now at Microsoft), Rasmus Resen Amossen (thesis 2011, now at Edlund), Andrea Campagna (thesis 2011), Konstantin Kutzkov (thesis 2013, now at NEC Research), Ninh Pham (thesis 2014, now post-doc at ITU), Morten Stöckel (thesis 2015, now at University of Copenhagen). Current project: Scalable Similarity Search. Previous projects: SQERD, 2006-2010 (short summary); MaDaMS, 2011-2014 (short summary). Program committees: ICALP 2002, SWAT 2006, ICALP 2006, SWAT 2008, ESA 2008, STOC 2009, IPDPS 2009, STACS 2010, ALENEX 2010, FUN 2010, SSTDM 2010, ESA 2011, PODS 2012, ICALP 2012, PDP 2012, FOCS 2012, MASSIVE 2012, WSDM 2013, PDP 2013, MFCS 2013, PKDD 2013, TIDM 2013, ITCS 2014, WSDM 2014, SDM 2015, ICALP 2016, SWAT 2016 (PC chair), FOCS 2016, KDD 2016. Invited talks: SEA 2014, ICDT 2015, CPM 2015, ESA 2015, SISAP 2015.
s: Sketches for $\\ell_p$-Sampling Without Replacement","urls":["https:\u002F\u002Farxiv.org\u002Fabs\u002F2007.06744"],"versions":[{"id":"5f0ecf6991e011ead96652b8","sid":"2007.06744","src":"arxiv","year":2020}],"year":2020},{"authors":[{"id":"53f324e9dabfae9a8446b76a","name":"Yasuo Tabei"},{"id":"53f4bb1edabfaeda9877b3ba","name":"Yoshihiro Yamanishi"},{"id":"5406ae8edabfae8faa61951f","name":"Rasmus Pagh"}],"doi":"10.1007\u002Fs41019-020-00120-6","id":"5eec900a9fced0a24b953c7c","num_citation":0,"order":2,"pages":{"end":"179","start":"168"},"title":"Space-Efficient Feature Maps for String Alignment Kernels.","urls":["db\u002Fjournals\u002Fdase\u002Fdase5.html#TabeiYP20","https:\u002F\u002Fdoi.org\u002F10.1007\u002Fs41019-020-00120-6","https:\u002F\u002Flink.springer.com\u002F10.1007\u002Fs41019-020-00120-6"],"venue":{"info":{"name":"Data Science and Engineering"},"issue":"2","volume":"5"},"versions":[{"id":"5eec900a9fced0a24b953c7c","sid":"journals\u002Fdase\u002FTabeiYP20","src":"dblp","vsid":"journals\u002Fdase","year":2020},{"id":"5f4569849fced0a24bd7fc23","sid":"10.1007\u002Fs41019-020-00120-6","src":"springer","vsid":"41019","year":2020}],"year":2020},{"authors":[{"id":"53f4328bdabfaedce55071c6","name":"Badih Ghazi"},{"name":"Ravi Kumar"},{"name":"Pasin Manurangsi"},{"id":"5406ae8edabfae8faa61951f","name":"Rasmus Pagh"}],"id":"5ede0553e06a4c1b26a83f7a","num_citation":0,"order":3,"pdf":"https:\u002F\u002Fstatic.aminer.cn\u002Fstorage\u002Fpdf\u002Ficml\u002F20\u002F2341-Paper.pdf","title":"Private Counting from Anonymous Messages: Near-Optimal Accuracy with Vanishing Communication Overhead","urls":["https:\u002F\u002Ficml.cc\u002FConferences\u002F2020\u002FAcceptedPapersInitial"],"venue":{"info":{"name":"ICML 2020"}},"versions":[{"id":"5ede0553e06a4c1b26a83f7a","sid":"icml2020#370","src":"conf_icml","year":2020}],"year":2020},{"authors":[{"name":"Amir Zandieh"},{"name":"Thomas D. Ahle"},{"id":"53f4ce25dabfaeed20f813b1","name":"Michael Kapralov"},{"name":"Jakob B. T. Knudsen"},{"id":"5406ae8edabfae8faa61951f","name":"Rasmus Pagh"},{"name":"Ameya Velingker"},{"id":"53f42adedabfaeb22f3de2f9","name":"David P. Woodruff"}],"doi":"","id":"5e5e19c193d709897ce87ce8","num_citation":4,"order":4,"pages":{"end":"160","start":"141"},"title":"Oblivious Sketching of High-Degree Polynomial Kernels","urls":["https:\u002F\u002Fwww.siam.org\u002Fconferences\u002Fcm\u002Fprogram\u002Faccepted-papers\u002Fsoda20-accepted-papers#167","http:\u002F\u002Fdblp.uni-trier.de\u002Fdb\u002Fjournals\u002Fcorr\u002Fcorr1909.html#abs-1909-01410"],"venue":{"info":{"name":"symposium on discrete algorithms"},"issue":"","volume":""},"versions":[{"id":"5e5e19c193d709897ce87ce8","sid":"3001361757","src":"mag","vsid":"1130177464","year":2020}],"year":2020},{"authors":[{"id":"5406ae8edabfae8faa61951f","name":"Rasmus Pagh"},{"name":"Johan Sivertsen"}],"doi":"10.4230\u002FLIPIcs.ICDT.2020.22","id":"5e6b5bf491e01104ed6259d1","num_citation":0,"order":0,"pages":{"end":"","start":""},"pdf":"https:\u002F\u002Fstatic.aminer.cn\u002Fstorage\u002Fpdf\u002Farxiv\u002F19\u002F1909\u002F1909.10766.pdf","title":"The Space Complexity of Inner Product Filters.","urls":["https:\u002F\u002Fdblp.org\u002Frec\u002Fconf\u002Ficdt\u002FPaghS20","https:\u002F\u002Fdoi.org\u002F10.4230\u002FLIPIcs.ICDT.2020.22","http:\u002F\u002Fdblp.uni-trier.de\u002Fdb\u002Fjournals\u002Fcorr\u002Fcorr1909.html#abs-1909-10766","https:\u002F\u002Farxiv.org\u002Fabs\u002F1909.10766"],"venue":{"info":{"name":"ICDT"},"issue":"","volume":""},"versions":[{"id":"5e6b5bf491e01104ed6259d1","sid":"conf\u002Ficdt\u002FPaghS20","src":"dblp","vsid":"conf\u002Ficdt","year":2020},{"id":"5ea0141e9fced0a24b9f64fe","sid":"3013040490","src":"mag","vsid":"1165285842","year":2019},{"id":"5d8b3b1e3a55acc418bda601","sid":"1909.10766","src":"arxiv","year":2019}],"year":2020},{"authors":[{"id":"53f4328bdabfaedce55071c6","name":"Ghazi Badih"},{"name":"Golowich Noah"},{"name":"Kumar Ravi"},{"name":"Manurangsi Pasin"},{"id":"5406ae8edabfae8faa61951f","name":"Pagh Rasmus"},{"name":"Velingker Ameya"}],"doi":"10.4230\u002FLIPIcs.ITC.2020.15","id":"5e3be3c33a55ac29c4ae7e59","num_citation":0,"order":4,"pdf":"https:\u002F\u002Fstatic.aminer.cn\u002Fstorage\u002Fpdf\u002Farxiv\u002F20\u002F2002\u002F2002.01919.pdf","title":"Pure Differentially Private Summation from Anonymous Messages","urls":["https:\u002F\u002Farxiv.org\u002Fabs\u002F2002.01919","https:\u002F\u002Fdblp.org\u002Frec\u002Fconf\u002Ficits\u002FGhaziGKMPV20","https:\u002F\u002Fdoi.org\u002F10.4230\u002FLIPIcs.ITC.2020.15"],"venue":{"info":{"name":"ITC"}},"versions":[{"id":"5e3be3c33a55ac29c4ae7e59","sid":"2002.01919","src":"arxiv","year":2020},{"id":"5edb6a3891e011ccb35acdf5","sid":"conf\u002Ficits\u002FGhaziGKMPV20","src":"dblp","vsid":"conf\u002Ficits","year":2020}],"year":2020},{"authors":[{"name":"Goswami Mayank"},{"name":"Jacob Riko"},{"id":"5406ae8edabfae8faa61951f","name":"Pagh Rasmus"}],"doi":"10.1145\u002F3375395.3387649","id":"5e451e433a55acfaed7387bf","num_citation":0,"order":2,"pages":{"end":"212","start":"205"},"pdf":"https:\u002F\u002Fstatic.aminer.cn\u002Fstorage\u002Fpdf\u002Farxiv\u002F20\u002F2002\u002F2002.04870.pdf","title":"On the I\u002FO complexity of the k-nearest neighbor problem","urls":["https:\u002F\u002Farxiv.org\u002Fabs\u002F2002.04870","https:\u002F\u002Fdl.acm.org\u002Fdoi\u002Fabs\u002F10.1145\u002F3375395.3387649","https:\u002F\u002Fdblp.org\u002Frec\u002Fconf\u002Fpods\u002FGoswamiJP20","https:\u002F\u002Fdoi.org\u002F10.1145\u002F3375395.3387649"],"venue":{"info":{"name":"SIGMOD\u002FPODS '20: International Conference on Management of Data\n\t\t Portland\n\t\t OR\n\t\t USA\n\t\t June, 2020"}},"versions":[{"id":"5e451e433a55acfaed7387bf","sid":"2002.04870","src":"arxiv","year":2020},{"id":"5ed384dd9fced0a24b6570b8","sid":"10.1145\u002F3375395.3387649","src":"acm","vsid":"mod","year":2020},{"id":"5edcbb9d91e0110f1d6db446","sid":"conf\u002Fpods\u002FGoswamiJP20","src":"dblp","vsid":"conf\u002Fpods","year":2020}],"year":2020},{"authors":[{"id":"53f4328bdabfaedce55071c6","name":"Badih Ghazi"},{"id":"5406ae8edabfae8faa61951f","name":"Rasmus Pagh"},{"name":"Ameya Velingker"}],"id":"5d1eb9d8da562961f0b12cbc","lang":"en","num_citation":0,"order":1,"pdf":"https:\u002F\u002Fstatic.aminer.cn\u002Fstorage\u002Fpdf\u002Farxiv\u002F19\u002F1906\u002F1906.08320.pdf","title":"Scalable and Differentially Private Distributed Aggregation in the Shuffled Model.","urls":["db\u002Fjournals\u002Fcorr\u002Fcorr1906.html#abs-1906-08320","http:\u002F\u002Farxiv.org\u002Fabs\u002F1906.08320","https:\u002F\u002Farxiv.org\u002Fabs\u002F1906.08320"],"venue":{"info":{"name":"CoRR"},"volume":"abs\u002F1906.08320"},"versions":[{"id":"5e8d92929fced0a24b618102","sid":"journals\u002Fcorr\u002Fabs-1906-08320","src":"dblp","vsid":"journals\u002Fcorr","year":2019},{"id":"5d0caac73a55ac36a9f160a9","sid":"1906.08320","src":"arxiv","year":2019}],"year":2019},{"authors":[{"id":"53f4328bdabfaedce55071c6","name":"Ghazi Badih"},{"name":"Golowich Noah"},{"name":"Kumar Ravi"},{"id":"5406ae8edabfae8faa61951f","name":"Pagh Rasmus"},{"name":"Velingker Ameya"}],"id":"5d68f3bb3a55ac36c20d4bc4","num_citation":0,"order":3,"pdf":"https:\u002F\u002Fstatic.aminer.cn\u002Fstorage\u002Fpdf\u002Farxiv\u002F19\u002F1908\u002F1908.11358.pdf","title":"Private Heavy Hitters and Range Queries in the Shuffled Model","urls":["https:\u002F\u002Farxiv.org\u002Fabs\u002F1908.11358"],"versions":[{"id":"5d68f3bb3a55ac36c20d4bc4","sid":"1908.11358","src":"arxiv","year":2019}],"year":2019},{"authors":[{"name":"Martin Aumüller"},{"id":"562c85af45cedb3398c4de91","name":"Tobias Christiani"},{"id":"5406ae8edabfae8faa61951f","name":"Rasmus Pagh"},{"name":"Michael Vesterli"}],"doi":"","id":"5d1eb9dfda562961f0b195e1","lang":"en","num_citation":6,"order":2,"pages":{"end":"","start":""},"pdf":"https:\u002F\u002Fstatic.aminer.cn\u002Fstorage\u002Fpdf\u002Farxiv\u002F19\u002F1906\u002F1906.12211.pdf","title":"PUFFINN: Parameterless and Universally Fast FInding of Nearest Neighbors.","urls":["db\u002Fjournals\u002Fcorr\u002Fcorr1906.html#abs-1906-12211","http:\u002F\u002Farxiv.org\u002Fabs\u002F1906.12211","https:\u002F\u002Fdblp.org\u002Frec\u002Fconf\u002Fesa\u002F0001CPV19","https:\u002F\u002Fdoi.org\u002F10.4230\u002FLIPIcs.ESA.2019.10","https:\u002F\u002Farxiv.org\u002Fabs\u002F1906.12211"],"venue":{"info":{"name":"ESA"},"issue":"","volume":"abs\u002F1906.12211"},"versions":[{"id":"5e8d92989fced0a24b61ff4b","sid":"journals\u002Fcorr\u002Fabs-1906-12211","src":"dblp","vsid":"journals\u002Fcorr","year":2019},{"id":"5d77759d3a55ac3251ea251e","sid":"conf\u002Fesa\u002F0001CPV19","src":"dblp","vsid":"conf\u002Fesa","year":2019},{"id":"5db92df547c8f76646273651","sid":"2979215852","src":"mag","vsid":"1154039276","year":2019},{"id":"5d19db4d3a55ac7eb1cdf787","sid":"1906.12211","src":"arxiv","year":2019}],"year":2019},{"authors":[{"id":"53f4ce25dabfaeed20f813b1","name":"Kapralov Michael"},{"id":"5406ae8edabfae8faa61951f","name":"Pagh Rasmus"},{"id":"53f43f1ddabfaee02ad058d8","name":"Velingker Ameya"},{"id":"53f42adedabfaeb22f3de2f9","name":"Woodruff David"},{"name":"Zandieh Amir"}],"id":"5d70dce03a55acf001582ed7","num_citation":4,"order":1,"pdf":"https:\u002F\u002Fstatic.aminer.cn\u002Fstorage\u002Fpdf\u002Farxiv\u002F19\u002F1909\u002F1909.01410.pdf","title":"Oblivious Sketching of High-Degree Polynomial Kernels","urls":["https:\u002F\u002Farxiv.org\u002Fabs\u002F1909.01410"],"versions":[{"id":"5d70dce03a55acf001582ed7","sid":"1909.01410","src":"arxiv","year":2019}],"year":2019},{"authors":[{"id":"5406ae8edabfae8faa61951f","name":"Rasmus Pagh"},{"name":"Nina Mesing Stausholm"},{"id":"5434da38dabfaebba5871fb1","name":"Mikkel Thorup"}],"doi":"10.4230\u002FLIPIcs.ESA.2019.74","id":"5d77759d3a55ac3251ea2567","num_citation":2,"order":0,"pages":{"end":"","start":""},"pdf":"https:\u002F\u002Fstatic.aminer.cn\u002Fstorage\u002Fpdf\u002Farxiv\u002F19\u002F1907\u002F1907.02251.pdf","title":"Hardness of Bichromatic Closest Pair with Jaccard Similarity.","urls":["https:\u002F\u002Fdblp.org\u002Frec\u002Fconf\u002Fesa\u002FPaghST19","https:\u002F\u002Fdoi.org\u002F10.4230\u002FLIPIcs.ESA.2019.74","https:\u002F\u002Farxiv.org\u002Fabs\u002F1907.02251"],"venue":{"info":{"name":"ESA"},"issue":"","volume":""},"versions":[{"id":"5d77759d3a55ac3251ea2567","sid":"conf\u002Fesa\u002FPaghST19","src":"dblp","vsid":"conf\u002Fesa","year":2019},{"id":"5db92d7b47c8f7664626501b","sid":"2978452900","src":"mag","vsid":"1154039276","year":2019},{"id":"5d1f1fd13a55ac72f611c81f","sid":"1907.02251","src":"arxiv","year":2019}],"year":2019},{"authors":[{"id":"53f4328bdabfaedce55071c6","name":"Badih Ghazi"},{"name":"Noah Golowich"},{"name":"Ravi Kumar"},{"id":"5406ae8edabfae8faa61951f","name":"Rasmus Pagh"},{"name":"Ameya Velingker"}],"id":"5e8d926a9fced0a24b5efc0c","num_citation":0,"order":3,"pages":{"start":"1382"},"title":"On the Power of Multiple Anonymous Messages.","urls":["db\u002Fjournals\u002Fiacr\u002Fiacr2019.html#GhaziGKPV19","https:\u002F\u002Feprint.iacr.org\u002F2019\u002F1382"],"venue":{"info":{"name":"IACR Cryptology ePrint Archive"},"volume":"2019"},"versions":[{"id":"5e8d926a9fced0a24b5efc0c","sid":"journals\u002Fiacr\u002FGhaziGKPV19","src":"dblp","vsid":"journals\u002Fiacr","year":2019}],"year":2019},{"authors":[{"id":"53f4328bdabfaedce55071c6","name":"Ghazi Badih"},{"name":"Manurangsi Pasin"},{"id":"5406ae8edabfae8faa61951f","name":"Pagh Rasmus"},{"name":"Velingker Ameya"}],"id":"5d8b3b1e3a55acc418bda734","num_citation":0,"order":2,"pdf":"https:\u002F\u002Fstatic.aminer.cn\u002Fstorage\u002Fpdf\u002Farxiv\u002F19\u002F1909\u002F1909.11073.pdf","title":"Private Aggregation from Fewer Anonymous Messages","urls":["https:\u002F\u002Farxiv.org\u002Fabs\u002F1909.11073"],"versions":[{"id":"5d8b3b1e3a55acc418bda734","sid":"1909.11073","src":"arxiv","year":2019}],"year":2019},{"authors":[{"id":"53f324e9dabfae9a8446b76a","name":"Yasuo Tabei"},{"id":"53f4bb1edabfaeda9877b3ba","name":"Yoshihiro Yamanishi"},{"id":"5406ae8edabfae8faa61951f","name":"Rasmus Pagh"}],"doi":"10.1109\u002FICDM.2019.00166","id":"5e3a93a93a55ac06c6119e21","num_citation":0,"order":2,"pages":{"end":"1317","start":"1312"},"title":"Space-Efficient Feature Maps for String Alignment Kernels.","urls":["https:\u002F\u002Fdblp.org\u002Frec\u002Fconf\u002Ficdm\u002FTabeiYP19","https:\u002F\u002Fdoi.org\u002F10.1109\u002FICDM.2019.00166","http:\u002F\u002Fieeexplore.ieee.org\u002Fxpls\u002Fabs_all.jsp?arnumber=8970720","http:\u002F\u002Fxplorestaging.ieee.org\u002Fielx7\u002F8961330\u002F8970627\u002F08970720.pdf?arnumber=8970720"],"venue":{"info":{"name":"ICDM"},"issue":"","volume":""},"versions":[{"id":"5e3a93a93a55ac06c6119e21","sid":"conf\u002Ficdm\u002FTabeiYP19","src":"dblp","vsid":"conf\u002Ficdm","year":2019},{"id":"5e5e19fc93d709897ce95b96","sid":"3003219323","src":"mag","vsid":"1183478919","year":2019}],"year":2019},{"authors":[{"name":"Martin Aumüller"},{"id":"5406ae8edabfae8faa61951f","name":"Rasmus Pagh"},{"id":"53f46775dabfaedf4364a51b","name":"Francesco Silvestri"}],"doi":"10.1145\u002F3375395.3387648","id":"5d04e8ffda56295d08dd22fa","lang":"en","num_citation":2,"order":1,"pages":{"end":"204","start":"191"},"pdf":"https:\u002F\u002Fstatic.aminer.cn\u002Fstorage\u002Fpdf\u002Farxiv\u002F19\u002F1906\u002F1906.01859.pdf","title":"Fair Near Neighbor Search: Independent Range Sampling in High Dimensions.","urls":["db\u002Fjournals\u002Fcorr\u002Fcorr1906.html#abs-1906-01859","http:\u002F\u002Farxiv.org\u002Fabs\u002F1906.01859","https:\u002F\u002Fdl.acm.org\u002Fdoi\u002Fabs\u002F10.1145\u002F3375395.3387648","https:\u002F\u002Fdblp.org\u002Frec\u002Fconf\u002Fpods\u002F0001P020","https:\u002F\u002Fdoi.org\u002F10.1145\u002F3375395.3387648","https:\u002F\u002Farxiv.org\u002Fabs\u002F1906.01859"],"venue":{"info":{"name":"SIGMOD\u002FPODS '20: International Conference on Management of Data\n\t\t Portland\n\t\t OR\n\t\t USA\n\t\t June, 2020"},"volume":"abs\u002F1906.01859"},"versions":[{"id":"5e8d92959fced0a24b61c218","sid":"journals\u002Fcorr\u002Fabs-1906-01859","src":"dblp","vsid":"journals\u002Fcorr","year":2019},{"id":"5ed384dd9fced0a24b6570c3","sid":"10.1145\u002F3375395.3387648","src":"acm","vsid":"mod","year":2020},{"id":"5edcbb9d91e0110f1d6db435","sid":"conf\u002Fpods\u002F0001P020","src":"dblp","vsid":"conf\u002Fpods","year":2020},{"id":"5cf8e4633a55ac7fe7882c44","sid":"1906.01859","src":"arxiv","year":2019}],"year":2019},{"authors":[{"name":"Martin Aumüller"},{"name":"Tobias Christiani"},{"id":"5406ae8edabfae8faa61951f","name":"Rasmus Pagh"},{"id":"562d4b7945cedb3398db531c","name":"Francesco Silvestri"}],"doi":"10.1145\u002F3196959.3196976","id":"599c7954601a182cd2631aa5","lang":"en","num_citation":12,"order":2,"pages":{"end":"104","start":"89"},"title":"Distance-sensitive hashing.","urls":["http:\u002F\u002Farxiv.org\u002Fabs\u002F1703.07867","http:\u002F\u002Fdoi.acm.org\u002F10.1145\u002F3196959.3196976","https:\u002F\u002Fdl.acm.org\u002Fdoi\u002Fabs\u002F10.1145\u002F3196959.3196976","https:\u002F\u002Farxiv.org\u002Fabs\u002F1703.07867"],"venue":{"info":{"name":"SIGMOD\u002FPODS '18: International Conference on Management of Data\n\t\t Houston\n\t\t TX\n\t\t USA\n\t\t June, 2018"},"issue":"","volume":"abs\u002F1703.07867"},"versions":[{"id":"5e8d92719fced0a24b5f55f5","sid":"journals\u002Fcorr\u002FAumullerCP017","src":"dblp","vsid":"journals\u002Fcorr","year":2017},{"id":"5b16428d8fbcbf6e5a9b68ba","sid":"conf\u002Fpods\u002F0001CP018","src":"dblp","vsid":"conf\u002Fpods","year":2018},{"id":"5e8bf47d9fced0a24bc47b0c","sid":"10.1145\u002F3196959.3196976","src":"acm","vsid":"mod","year":2018},{"id":"5f025098dfae54360a45cbdc","sid":"1703.07867","src":"arxiv","year":2018}],"year":2018},{"authors":[{"id":"562c85af45cedb3398c4de91","name":"Tobias Christiani"},{"id":"5406ae8edabfae8faa61951f","name":"Rasmus Pagh"},{"name":"Johan Sivertsen"}],"doi":"10.1109\u002Ficde.2018.00120","id":"59ae3be32bbe271c4c71b6ea","lang":"en","num_citation":17,"order":1,"pages":{"end":"","start":""},"title":"Scalable and robust set similarity join.","urls":["http:\u002F\u002Farxiv.org\u002Fabs\u002F1707.06814","http:\u002F\u002Fdoi.ieeecomputersociety.org\u002F10.1109\u002FICDE.2018.00120","https:\u002F\u002Farxiv.org\u002Fabs\u002F1707.06814"],"venue":{"info":{"name":"international conference on data engineering"},"issue":"","volume":"abs\u002F1707.06814"},"versions":[{"id":"5e8d92749fced0a24b5f8cb8","sid":"journals\u002Fcorr\u002FChristianiPS17","src":"dblp","vsid":"journals\u002Fcorr","year":2017},{"id":"5bdc316717c44a1f58a070e3","sid":"conf\u002Ficde\u002FChristianiPS18","src":"dblp","vsid":"conf\u002Ficde","year":2018},{"id":"5c757016f56def97986be993","sid":"2736701013","src":"mag","vsid":"1163988186","year":2018},{"id":"5d9edc4a47c8f7664603b095","sid":"2963886823","src":"mag","vsid":"1163988186","year":2018},{"id":"5f03001adfae54360a462e12","sid":"1707.06814","src":"arxiv","year":2018}],"year":2018},{"authors":[{"id":"53f324e9dabfae9a8446b76a","name":"Yasuo Tabei"},{"id":"53f4bb1edabfaeda9877b3ba","name":"Yoshihiro Yamanishi"},{"id":"5406ae8edabfae8faa61951f","name":"Rasmus Pagh"}],"doi":"","id":"5a9cb65d17c44a376ffb8251","lang":"en","num_citation":0,"order":2,"pages":{"end":"","start":""},"pdf":"https:\u002F\u002Fstatic.aminer.cn\u002Fstorage\u002Fpdf\u002Farxiv\u002F18\u002F1802\u002F1802.06382.pdf","title":"Scalable Alignment Kernels via Space-Efficient Feature Maps.","urls":["http:\u002F\u002Farxiv.org\u002Fabs\u002F1802.06382","https:\u002F\u002Farxiv.org\u002Fabs\u002F1802.06382"],"venue":{"info":{"name":"arXiv: Learning"},"issue":"","volume":"abs\u002F1802.06382"},"versions":[{"id":"5e8d92779fced0a24b5fb7d2","sid":"journals\u002Fcorr\u002Fabs-1802-06382","src":"dblp","vsid":"journals\u002Fcorr","year":2018},{"id":"5c75737ff56def97988a5ef8","sid":"2788159577","src":"mag","vsid":"2597173376","year":2018},{"id":"5c615e70e1cd8eae15018b6e","sid":"1802.06382","src":"arxiv","year":2019}],"year":2018}],"profilePubsTotal":130,"profilePatentsPage":1,"profilePatents":[],"profilePatentsTotal":1,"profilePatentsEnd":true,"profileProjectsPage":0,"profileProjects":null,"profileProjectsTotal":null,"newInfo":null,"checkDelPubs":[]}};