default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPiotr Wygocki
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j1]Krystian Zielinski
, Sebastian Pukszta, Malgorzata Mickiewicz, Marta Kotlarz, Piotr Wygocki, Marcin Zielen, Dominika Drzewiecka, Damian Drzyzga, Anna Kloska, Joanna Jakóbkiewicz-Banecka:
Personalized prediction of the secondary oocytes number after ovarian stimulation: A machine learning model based on clinical and genetic data. PLoS Comput. Biol. 19(4) (2023)- 2022
- [c7]Adam Karczmarz, Tomasz P. Michalak, Anish Mukherjee, Piotr Sankowski, Piotr Wygocki:
Improved feature importance computation for tree models based on the Banzhaf value. UAI 2022: 969-979 - 2021
- [i9]Adam Karczmarz, Anish Mukherjee, Piotr Sankowski, Piotr Wygocki:
Improved Feature Importance Computations for Tree Models: Shapley vs. Banzhaf. CoRR abs/2108.04126 (2021) - 2020
- [c6]Lukasz Kowalik, Marcin Mucha, Wojciech Nadara, Marcin Pilipczuk, Manuel Sorge, Piotr Wygocki:
The PACE 2020 Parameterized Algorithms and Computational Experiments Challenge: Treedepth. IPEC 2020: 37:1-37:18
2010 – 2019
- 2017
- [c5]Piotr Sankowski, Piotr Wygocki:
Approximate Nearest Neighbors Search Without False Negatives For l_2 For c>sqrt{loglog{n}}. ISAAC 2017: 63:1-63:12 - [c4]Karol Wegrzycki, Piotr Sankowski, Andrzej Pacuk, Piotr Wygocki:
Why Do Cascade Sizes Follow a Power-Law? WWW 2017: 569-576 - [i8]Karol Wegrzycki, Piotr Sankowski, Andrzej Pacuk, Piotr Wygocki:
Why Do Cascade Sizes Follow a Power-Law? CoRR abs/1702.05913 (2017) - [i7]Piotr Wygocki:
On fast bounded locality sensitive hashing. CoRR abs/1704.05902 (2017) - [i6]Piotr Sankowski, Piotr Wygocki:
Approximate nearest neighbors search without false negatives for l2. CoRR abs/1708.06395 (2017) - [i5]Piotr Wygocki:
Improved approximate near neighbor search without false negatives for $l_2$. CoRR abs/1709.10338 (2017) - 2016
- [c3]Andrzej Pacuk, Piotr Sankowski, Karol Wegrzycki, Piotr Wygocki:
Locality-Sensitive Hashing Without False Negatives for l_p. COCOON 2016: 105-118 - [c2]Andrzej Pacuk, Piotr Sankowski, Karol Wegrzycki, Piotr Wygocki:
There is Something Beyond the Twitter Network. HT 2016: 279-284 - [c1]Andrzej Pacuk, Piotr Sankowski, Karol Wegrzycki, Adam Witkowski, Piotr Wygocki:
RecSys Challenge 2016: job recommendations based on preselection of offers and gradient boosting. RecSys Challenge 2016: 10:1-10:4 - [i4]Andrzej Pacuk, Piotr Sankowski, Karol Wegrzycki, Piotr Wygocki:
Locality-Sensitive Hashing without False Negatives for l_p. CoRR abs/1611.09317 (2016) - [i3]Andrzej Pacuk, Piotr Sankowski, Karol Wegrzycki, Piotr Wygocki:
There is Something Beyond the Twitter Network. CoRR abs/1611.09387 (2016) - [i2]Andrzej Pacuk, Piotr Sankowski, Karol Wegrzycki, Adam Witkowski, Piotr Wygocki:
RecSys Challenge 2016: job recommendations based on preselection of offers and gradient boosting. CoRR abs/1612.00959 (2016) - 2014
- [i1]Krzysztof Ciebiera, Piotr Godlewski, Piotr Sankowski, Piotr Wygocki:
Approximation Algorithms for Steiner Tree Problems Based on Universal Solution Frameworks. CoRR abs/1410.7534 (2014)
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-24 23:19 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:
