default search action
Pawel Lorek
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c8]Pawel Lorek, Moti Yung, Filip Zagórski:
Mirrored Commitment: Fixing "Randomized Partial Checking" and Applications. ACNS (3) 2024: 3-27 - [i5]Pawel Lorek, Moti Yung, Filip Zagórski:
Mirrored Commitment: Fixing "Randomized Partial Checking" and Applications. IACR Cryptol. ePrint Arch. 2024: 285 (2024) - 2022
- [c7]Pawel Lorek, Rafal Nowak, Tomasz Trzcinski, Maciej Zieba:
FlowHMM: Flow-based continuous hidden Markov models. NeurIPS 2022 - 2020
- [j5]Pawel Lorek, Grzegorz Los, Karol Gotfryd, Filip Zagórski:
On testing pseudorandom generators via statistical tests based on the arcsine law. J. Comput. Appl. Math. 380: 112968 (2020)
2010 – 2019
- 2019
- [j4]Pawel Lorek, Filip Zagórski, Michal Kulis:
Strong Stationary Times and its use in Cryptography. IEEE Trans. Dependable Secur. Comput. 16(5): 805-818 (2019) - [i4]Pawel Lorek, Grzegorz Los, Karol Gotfryd, Filip Zagórski:
On testing pseudorandom generators via statistical tests based on the arcsine law. CoRR abs/1903.09805 (2019) - 2018
- [j3]Celina M. Olszak, Tomasz Bartus, Pawel Lorek:
A comprehensive framework of information system design to provide organizational creativity support. Inf. Manag. 55(1): 94-108 (2018) - [c6]Karol Gotfryd, Pawel Lorek, Filip Zagórski:
RiffleScrambler - A Memory-Hard Password Storing Function. ESORICS (2) 2018: 309-328 - [i3]Karol Gotfryd, Pawel Lorek, Filip Zagórski:
RiffleScrambler - a memory-hard password storing function. CoRR abs/1807.06443 (2018) - 2017
- [c5]Celina M. Olszak, Tomasz Bartus, Pawel Lorek:
An Information System Design for Organizational Creativity Support. HICSS 2017: 1-10 - [c4]Pawel Lorek, Michal Kulis, Filip Zagórski:
Leakage-Resilient Riffle Shuffle. MACIS 2017: 395-408 - [c3]Pawel Lorek, Marcin Slowik, Filip Zagórski:
Statistical Testing of PRNG: Generalized Gambler's Ruin Problem. MACIS 2017: 425-437 - [i2]Pawel Lorek, Filip Zagórski, Michal Kulis:
Strong stationary times and its use in cryptography. CoRR abs/1709.02631 (2017) - 2016
- [c2]Michal Kulis, Pawel Lorek, Filip Zagórski:
Randomized Stopping Times and Provably Secure Pseudorandom Permutation Generators. Mycrypt 2016: 145-167 - [i1]Michal Kulis, Pawel Lorek, Filip Zagórski:
Randomized stopping times and provably secure pseudorandom permutation generators. IACR Cryptol. ePrint Arch. 2016: 1049 (2016) - 2013
- [j2]Wojciech Tarnawski, Vartan Kurtcuoglu, Pawel Lorek, Marcin Bodych, Jan Rotter, Monika Muszkieta, Lukasz Piwowar, Dimos Poulikakos, Michal Majkowski, Aldo Ferrari:
A Robust Algorithm for Segmenting and Tracking Clustered Cells in Time-Lapse Fluorescent Microscopy. IEEE J. Biomed. Health Informatics 17(4): 862-869 (2013) - 2012
- [j1]Pawel Lorek, Ryszard Szekli:
Strong stationary duality for Möbius monotone Markov chains. Queueing Syst. Theory Appl. 71(1-2): 79-95 (2012)
2000 – 2009
- 2006
- [c1]Miroslaw Dynia, Jaroslaw Kutylowski, Pawel Lorek, Friedhelm Meyer auf der Heide:
Maintaining Communication Between an Explorer and a Base Station. BICC 2006: 137-146
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 22:50 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint