default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPatrick K. Nicholson
Person information
- affiliation: Max Planck Institute for Informatics, Saarbrücken, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j11]Gopika Premsankar
, Guangyuan Piao, Patrick K. Nicholson, Mario Di Francesco, Diego Lugones:
Data-Driven Energy Conservation in Cellular Networks: A Systems Approach. IEEE Trans. Netw. Serv. Manag. 18(3): 3567-3582 (2021)- [c39]Kamal Hakimzadeh, Patrick K. Nicholson, Diego Lugones, Amir Hossein Payberah:
IMITA: Imitation Learning for Generalizing Cloud Orchestration. CCGRID 2021: 237-246 - [c38]Siddhesh Chaubal, Mateusz Rzepecki, Patrick K. Nicholson, Guangyuan Piao, Alessandra Sala:
Geometric Heuristics for Transfer Learning in Decision Trees. CIKM 2021: 151-160 - [c37]J. Ian Munro, Patrick K. Nicholson, Louisa Seelbach Benkner, Sebastian Wild:
Hypersuccinct Trees - New Universal Tree Source Codes for Optimal Compressed Tree Data Structures and Range Minima. ESA 2021: 70:1-70:18 - [i13]J. Ian Munro, Patrick K. Nicholson, Louisa Seelbach Benkner, Sebastian Wild:
Hypersuccinct Trees - New universal tree source codes for optimal compressed tree data structures. CoRR abs/2104.13457 (2021) - 2020
- [j10]Matteo Pozza, Patrick K. Nicholson, Diego Lugones, Ashwin Rao, Hannu Flinck, Sasu Tarkoma:
On Reconfiguring 5G Network Slices. IEEE J. Sel. Areas Commun. 38(7): 1542-1554 (2020) - [c36]Guangyuan Piao, Patrick K. Nicholson, Diego Lugones:
Env2Vec: accelerating VNF testing with deep learning. EuroSys 2020: 41:1-41:16
2010 – 2019
- 2019
- [j9]Patrick K. Nicholson:
Revisiting explicit adaptive two-probe schemes. Inf. Process. Lett. 143: 1-3 (2019) - [j8]Guruprasad Nayak, Sourav Dutta, Deepak Ajwani, Patrick K. Nicholson, Alessandra Sala:
Automated assessment of knowledge hierarchy evolution: comparing directed acyclic graphs. Inf. Retr. J. 22(3-4): 256-284 (2019) - [c35]Harshit Daga, Patrick K. Nicholson, Ada Gavrilovska, Diego Lugones:
Cartel: A System for Collaborative Transfer Learning at the Edge. SoCC 2019: 25-37 - [c34]Johannes Grohmann, Patrick K. Nicholson, Jesús Omana Iglesias, Samuel Kounev, Diego Lugones:
Monitorless: Predicting Performance Degradation in Cloud Applications with Machine Learning. Middleware 2019: 149-162 - 2018
- [j7]Michael Hoffmann, John Iacono, Patrick K. Nicholson, Rajeev Raman:
Encoding nearest larger values. Theor. Comput. Sci. 710: 97-115 (2018) - [j6]Jiongqian Liang, Deepak Ajwani, Patrick K. Nicholson, Alessandra Sala, Srinivasan Parthasarathy:
Prioritized Relationship Analysis in Heterogeneous Information Networks. ACM Trans. Knowl. Discov. Data 12(3): 29:1-29:27 (2018) - [c33]Deepak Ajwani, Bilyana Taneva, Sourav Dutta, Patrick K. Nicholson, Ghasem Heyrani-Nobari, Alessandra Sala:
ANNOTATE: orgANizing uNstructured cOntenTs viA Topic labEls. IEEE BigData 2018: 1699-1708 - [c32]Kamal Hakimzadeh, Patrick K. Nicholson, Diego Lugones:
Auto-Scaling with Apprenticeship Learning. SoCC 2018: 512 - [c31]Deepak Ajwani, Sourav Dutta, Patrick K. Nicholson, Luca Maria Aiello, Alessandra Sala:
Efficient Auto-Generation of Taxonomies for Structured Knowledge Discovery and Organization. HT 2018: 251-252 - [c30]Guruprasad Nayak, Sourav Dutta, Deepak Ajwani, Patrick K. Nicholson, Alessandra Sala:
Automated Knowledge Hierarchy Assessment. ProfS/KG4IR/Data:Search@SIGIR 2018: 59-60 - [c29]Nikhita Vedula, Patrick K. Nicholson, Deepak Ajwani, Sourav Dutta, Alessandra Sala, Srinivasan Parthasarathy:
Enriching Taxonomies With Functional Domain Knowledge. SIGIR 2018: 745-754 - [c28]Xiaofeng Yang, Deepak Ajwani, Wolfgang Gatterbauer, Patrick K. Nicholson, Mirek Riedewald, Alessandra Sala:
Any-k: Anytime Top-k Tree Pattern Retrieval in Labeled Graphs. WWW 2018: 489-498 - [i12]Xiaofeng Yang, Deepak Ajwani, Wolfgang Gatterbauer, Patrick K. Nicholson, Mirek Riedewald, Alessandra Sala:
Any-k: Anytime Top-k Tree Pattern Retrieval in Labeled Graphs. CoRR abs/1802.06060 (2018) - 2017
- [c27]Preethi Lahoti, Patrick K. Nicholson, Bilyana Taneva:
Efficient Set Intersection Counting Algorithm for Text Similarity Measures. ALENEX 2017: 146-158 - [c26]Tiep Mai, Bichen Shi, Patrick K. Nicholson, Deepak Ajwani, Alessandra Sala:
Scalable Disambiguation System Capturing Individualities of Mentions. LDK 2017: 365-379 - [c25]Ofer Freedman, Pawel Gawrychowski, Patrick K. Nicholson, Oren Weimann:
Optimal Distance Labeling Schemes for Trees. PODC 2017: 185-194 - [c24]Pawel Gawrychowski, Patrick K. Nicholson:
Optimal Query Time for Encoding Range Majority. WADS 2017: 409-420 - [c23]Jiankai Sun, Deepak Ajwani, Patrick K. Nicholson, Alessandra Sala, Srinivasan Parthasarathy:
Breaking Cycles In Noisy Hierarchies. WebSci 2017: 151-160 - [i11]Pawel Gawrychowski, Patrick K. Nicholson:
Optimal Query Time for Encoding Range Majority. CoRR abs/1704.06149 (2017) - 2016
- [j5]J. Ian Munro, Patrick K. Nicholson:
Succinct Posets. Algorithmica 76(2): 445-473 (2016) - [j4]Amr Elmasry, Meng He, J. Ian Munro, Patrick K. Nicholson:
Dynamic range majority data structures. Theor. Comput. Sci. 647: 59-73 (2016) - [c22]Patrick Klitzke, Patrick K. Nicholson:
A General Framework for Dynamic Succinct and Compressed Data Structures. ALENEX 2016: 160-173 - [c21]Jiongqian Liang, Deepak Ajwani, Patrick K. Nicholson, Alessandra Sala, Srinivasan Parthasarathy:
What Links Alice and Bob?: Matching and Ranking Semantic Patterns in Heterogeneous Networks. WWW 2016: 879-889 - [r1]J. Ian Munro, Patrick K. Nicholson:
Compressed Representations of Graphs. Encyclopedia of Algorithms 2016: 382-386 - [i10]Tiep Mai, Bichen Shi, Patrick K. Nicholson, Deepak Ajwani, Alessandra Sala:
Distributed Entity Disambiguation with Per-Mention Learning. CoRR abs/1604.05875 (2016) - [i9]Ofer Freedman, Pawel Gawrychowski, Patrick K. Nicholson, Oren Weimann:
Optimal Distance Labeling Schemes for Trees. CoRR abs/1608.00212 (2016) - 2015
- [c20]Pawel Gawrychowski, Patrick K. Nicholson:
Encodings of Range Maximum-Sum Segment Queries and Applications. CPM 2015: 196-206 - [c19]Patrick K. Nicholson, Rajeev Raman:
Encoding Nearest Larger Values. CPM 2015: 385-395 - [c18]Pawel Gawrychowski, Patrick K. Nicholson:
Optimal Encodings for Range Top- k k , Selection, and Min-Max. ICALP (1) 2015: 593-604 - [c17]Arash Farzan, Alejandro López-Ortiz, Patrick K. Nicholson, Alejandro Salinger:
Algorithms in the Ultra-Wide Word Model. TAMC 2015: 335-346 - 2014
- [j3]Francisco Claude, Patrick K. Nicholson, Diego Seco:
On the compression of search trees. Inf. Process. Manag. 50(2): 272-283 (2014) - [c16]Pawel Gawrychowski, Moshe Lewenstein, Patrick K. Nicholson:
Weighted Ancestors in Suffix Trees. ESA 2014: 455-466 - [c15]Moshe Lewenstein, J. Ian Munro, Patrick K. Nicholson, Venkatesh Raman:
Improved Explicit Data Structures in the Bitprobe Model. ESA 2014: 630-641 - [i8]Tomasz Jurkiewicz, Kurt Mehlhorn, Patrick K. Nicholson:
Cache-Oblivious VAT-Algorithms. CoRR abs/1404.3577 (2014) - [i7]Pawel Gawrychowski, Moshe Lewenstein, Patrick K. Nicholson:
Weighted ancestors in suffix trees. CoRR abs/1406.7716 (2014) - [i6]Patrick K. Nicholson, Pawel Gawrychowski:
Encodings of Range Maximum-Sum Segment Queries and Applications. CoRR abs/1410.2847 (2014) - [i5]Pawel Gawrychowski, Patrick K. Nicholson:
Optimal Encodings for Range Min-Max and Top-k. CoRR abs/1411.6581 (2014) - [i4]Arash Farzan, Alejandro López-Ortiz, Patrick K. Nicholson, Alejandro Salinger:
Algorithms in the Ultra-Wide Word Model. CoRR abs/1411.7359 (2014) - 2013
- [b1]Patrick K. Nicholson:
Space-Efficient Data Structures in the Word-RAM and Bitprobe Models. University of Waterloo, Ontario, Canada, 2013 - [j2]Stephane Durocher, Meng He, J. Ian Munro, Patrick K. Nicholson, Matthew Skala:
Range majority in constant time and linear space. Inf. Comput. 222: 169-179 (2013) - [c14]Patrick K. Nicholson, Venkatesh Raman, S. Srinivasa Rao:
A Survey of Data Structures in the Bitprobe Model. Space-Efficient Data Structures, Streams, and Algorithms 2013: 303-318 - [c13]Robert Fraser, Meng He, Akitoshi Kawamura, Alejandro López-Ortiz, J. Ian Munro, Patrick K. Nicholson:
The Distance 4-Sector of Two Points Is Unique. ISAAC 2013: 612-622 - 2012
- [c12]Francisco Claude, Patrick K. Nicholson, Diego Seco:
Differentially Encoded Search Trees. DCC 2012: 357-366 - [c11]J. Ian Munro, Patrick K. Nicholson:
Succinct Posets. ESA 2012: 743-754 - [c10]Meng He, Patrick K. Nicholson, Norbert Zeh:
A Space-Efficient Framework for Dynamic Point Location. ISAAC 2012: 548-557 - [i3]J. Ian Munro, Patrick K. Nicholson:
Succinct Posets. CoRR abs/1204.1957 (2012) - 2011
- [j1]Diego Arroyuelo, Francisco Claude, Reza Dorrigiv, Stephane Durocher, Meng He, Alejandro López-Ortiz, J. Ian Munro, Patrick K. Nicholson, Alejandro Salinger, Matthew Skala:
Untangled monotonic chains and adaptive range search. Theor. Comput. Sci. 412(32): 4200-4211 (2011) - [c9]Stephane Durocher, Meng He, J. Ian Munro, Patrick K. Nicholson, Matthew Skala:
Range Majority in Constant Time and Linear Space. ICALP (1) 2011: 244-255 - [c8]Amr Elmasry, Meng He, J. Ian Munro, Patrick K. Nicholson:
Dynamic Range Majority Data Structures. ISAAC 2011: 150-159 - [c7]Meng He, J. Ian Munro, Patrick K. Nicholson:
Dynamic Range Selection in Linear Space. ISAAC 2011: 160-169 - [c6]Francisco Claude, Patrick K. Nicholson, Diego Seco:
Space Efficient Wavelet Tree Construction. SPIRE 2011: 185-196 - [c5]Travis Gagie, Meng He, J. Ian Munro, Patrick K. Nicholson:
Finding Frequent Elements in Compressed 2D Arrays and Strings. SPIRE 2011: 295-300 - [i2]Meng He, J. Ian Munro, Patrick K. Nicholson:
Dynamic Range Majority Data Structures. CoRR abs/1104.5517 (2011) - [i1]Meng He, J. Ian Munro, Patrick K. Nicholson:
Dynamic Range Selection in Linear Space. CoRR abs/1106.5076 (2011) - 2010
- [c4]Robert Fraser, Patrick K. Nicholson:
Hausdorff core of a one reflex vertex polygon. CCCG 2010: 183-186 - [c3]Francisco Claude, J. Ian Munro, Patrick K. Nicholson:
Range Queries over Untangled Chains. SPIRE 2010: 82-93
2000 – 2009
- 2009
- [c2]Diego Arroyuelo, Francisco Claude, Reza Dorrigiv, Stephane Durocher, Meng He, Alejandro López-Ortiz, J. Ian Munro, Patrick K. Nicholson, Alejandro Salinger, Matthew Skala:
Untangled Monotonic Chains and Adaptive Range Search. ISAAC 2009: 203-212 - 2008
- [c1]Philip T. Cox, Patrick K. Nicholson:
Unification of Arrays in Spreadsheets with Logic Programming. PADL 2008: 100-115
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:58 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
