Nie jesteś zalogowany | Zaloguj się

Piotr Sankowski

Liczba publikacji: 123

2024

Rajesh Jayaram, Jakub Łącki, Slobodan Mitrović, Krzysztof Onak, Piotr Sankowski , Dynamic PageRank: Algorithms and Lower Bounds, 51st International Colloquium on Automata, Languages and Programming, Tallinn, Estonia, 8 lipca 2024 - 12 lipca 2024. Zobacz w PBN
Mathieu Mari, Michał Pawłowski, Runtian Ren, Piotr Sankowski , Multi-level Aggregation with Delays and Stochastic Arrivals, 23rd International Conference on Autonomous Agents and Multiagent Systems, Auckland, New Zealand, 6 maja 2024 - 10 maja 2024. Zobacz w PBN
Jan Ludziejewski , Jakub Krajewski, Kamil Adamczewski, Maciej Pióro, Michał Krutul, Szymon Antoniak, Kamil Ciebiera, Krystian Król, Tomasz Odrzygóźdź, Piotr Sankowski , Marek Cygan , Sebastian Jaszczur, Scaling Laws for Fine-Grained Mixture of Experts, 41st International Conference on Machine Learning, Vienna, Austria, 21 lipca 2024 - 27 lipca 2024, 235 2024, s. 33270-33288. Zobacz w PBN
Mathieu Mari , Anish Mukherjee, Michał Pilipczuk , Piotr Sankowski , Shortest Disjoint Paths on a Grid, 35th 2024 Annual ACM-SIAM Symposium on Discrete Algorithms, Alexandria, the United States of America, 7 stycznia 2024 - 10 stycznia 2024. Zobacz w PBN

2023

Adam Karczmarz , Piotr Sankowski , Fully Dynamic Shortest Paths and Reachability in Sparse Digraphs, 50th EATCS International Colloquium on Automata, Languages and Programming, Padeborn, Germany, 10 lipca 2023 - 14 lipca 2023. Zobacz w PBN
Mathieu Mari , Michał Pawłowski, Runtian Ren, Piotr Sankowski , Online Matching with Delays and Stochastic Arrival Times, The 22nd International Conference on Autonomous Agents and Multiagent Systems, London, the United Kingdom of Great Britain and Northern Ireland, 29 maja 2023 - 2 czerwca 2023. Zobacz w PBN
I Martynowicz, Piotr Wygocki , T Gilewicz, M Siennicki, P Pawilk, H Kompanowski, Piotr Sankowski , B Stankiewicz, A Kuczyńska, S Deluga-Białowarczuk, R Milewski, P Sieczyński, P-214 The size of the embryo can be used as a single predictor for selecting embryo for transfer, HUMAN REPRODUCTION, 39th Annual Meeting of the European Society of Human Reproduction and Embryology, Copenhagen, Denmark, 25 czerwca 2023 - 28 czerwca 2023, 38 (Supplement_1) 2023, s. i290-i291. Zobacz w PBN
S Deluga-Białowarczuk, Piotr Wygocki , P Pawlik, H Kompanowski, T Gilewicz, M Siennicki, Piotr Sankowski , R Milewski, B Stankiewicz, I Martynowicz, P Sieczyński, W Kuczyński, P-225 Trustworthy AI algorithm for embryo ranking, HUMAN REPRODUCTION, 39th Annual Meeting of the European Society of Human Reproduction and Embryology, Copenhagen, Denmark, 25 czerwca 2023 - 28 czerwca 2023, 38 (Supplement_1) 2023, s. i295-i296. Zobacz w PBN
Piotr Wygocki , M Siennicki, P Pawlik, H Kompanowski, T Gilewicz, Piotr Sankowski , J Kuśmierczyk-Kubiak, C S S Lee, A Y X Lim, B Stankiewicz, K Zielińsk, J Liss, T Barut, R Milewski, W Kuczyński, P-289 Evaluation of AI-based, non-invasive and annotation free EMBRYOAID software with embryologists: time and prediction, HUMAN REPRODUCTION, 39th Annual Meeting of the European Society of Human Reproduction and Embryology, Copenhagen, Denmark, 25 czerwca 2023 - 28 czerwca 2023, 38 (Supplement_1) 2023, s. i328-i329. Zobacz w PBN
Piotr Wygocki , M Ulfig, Marcin Wrochna , A Zapała, M Zieleń, U Sankowska, K Zieliński, N Gajewska, Piotr Sankowski , Damian Drzyzga, P-674 Automatizing ovarian follicle counting and measurement with artificial intelligence, HUMAN REPRODUCTION, 39th Annual Meeting of the European Society of Human Reproduction and Embryology, Copenhagen, Denmark, 25 czerwca 2023 - 28 czerwca 2023, 38 (Supplement_1) 2023, s. i507. Zobacz w PBN
Adam Karczmarz , Piotr Sankowski , Sensitivity and Dynamic Distance Oracles via Generic Matrices and Frobenius Form, 64th IEEE Annual Symposium on Foundations of Computer Science, Santa Cruz, the United States of America, 6 listopada 2023 - 9 listopada 2023. Zobacz w PBN

2022

Anna Zych-Pawlewicz , Piotr Sankowski , Dariusz Leniowski, Bartłomiej Bosek, A tight bound for shortest augmenting paths on trees, Theoretical Computer Science, 901 2022, s. 45-61. Zobacz w PBN
Adam Karczmarz , Tomasz Michalak , Anish Mukherjee, Piotr Sankowski , Piotr Wygocki , Improved feature importance computation for tree models based on the Banzhaf value, Thirty-Eighth Conference on Uncertainty in Artificial Intelligence, Eindhoven, the Netherlands, 2 sierpnia 2022 - 4 sierpnia 2022, 180 2022. Zobacz w PBN
Adam Gabriel Dobrakowski, Andrzej Pacuk, Piotr Sankowski , Marcin Mucha , Paweł Brach, Improving Ads-Profitability Using Traffic-Fingerprints, Communications in Computer and Information Science, 2022. Zobacz w PBN
Adam Karczmarz , Anish Mukherjee, Piotr Sankowski , Subquadratic dynamic path reporting in directed graphs against an adaptive adversary, SYMPOSIUM ON THEORY OF COMPUTING, STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rzym, Italy, 20 czerwca 2022 - 24 czerwca 2022. Zobacz w PBN

2021

Adam Karczmarz , Piotr Sankowski , A Deterministic Parallel {APSP} Algorithm and its Applications, the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2021), Alexandria, Virginia (Virtual Conference), the United States of America, 10 stycznia 2021 - 13 stycznia 2021. Zobacz w PBN
Harold N. Gabow, Piotr Sankowski , Algorithms for Weighted Matching Generalizations I: Bipartite Graphs, b-matching, and Unweighted f-factors, SIAM Journal on Computing, 50 (2) 2021, s. 440-486. Zobacz w PBN
Harold N. Gabow, Piotr Sankowski , Algorithms for Weighted Matching Generalizations II: f-factors and the Special Case of Shortest Paths, SIAM Journal on Computing, 50 (2) 2021, s. 555-601. Zobacz w PBN
Kyriakos Axiotis, Adam Karczmarz , Anish Mukherjee, Piotr Sankowski , Adrian Vladu, Decomposable Submodular Function Minimization via Maximum Flow, 38th International Conference on Machine Learning, Seattle, the United States of America, 18 sierpnia 2021 - 24 sierpnia 2021, 139 2021, s. 446--456. Zobacz w PBN
Adam Karczmarz , Jakub Pawlewicz , Piotr Sankowski , Sublinear Average-Case Shortest Paths in Weighted Unit-Disk Graphs, 37th International Symposium on Computational Geometry, SoCG 2021, Buffalo, the United States of America, 7 lipca 2021 - 11 lipca 2021. Zobacz w PBN

2020

Stefano Leonardi, Gianpiero Monaco, Piotr Sankowski , Qiang Zhang, Budget Feasible Mechanisms on Matroids, Algorithmica, 83 (5) 2020, s. 1222-1237. Zobacz w PBN
Artur Czumaj, Jakub Ła̧cki, Aleksander Ma̧dry, Slobodan Mitrović, Krzysztof Onak, Piotr Sankowski , Round Compression for Parallel Matching Algorithms, SIAM Journal on Computing, 49 (5) 2020, s. STOC18-1-STOC18-44. Zobacz w PBN
Jakub Łącki, Slobodan Mitrovic, Krzysztof Onak, Piotr Sankowski , Walking randomly, massively, and efficiently, SYMPOSIUM ON THEORY OF COMPUTING, 52nd ACM Symposium on Theory of Computing, Chicago, the United States of America, 22 czerwca 2020 - 26 czerwca 2020. Zobacz w PBN

2019

Chris Schwiegelshohn, Shay Solomon, Fabrizio Grandoni, Stefano Leonardi, Piotr Sankowski , (1 + $ε$)-Approximate Incremental Matching in Constant Deterministic Amortized Time, 30th ACM-SIAM Symposium on Discrete Algorithms, San Diego, the United States of America, 6 stycznia 2019 - 9 stycznia 2019. Zobacz w PBN
Piotr Sankowski , Karol Węgrzycki, Improved Distance Queries and Cycle Counting by Frobenius Normal Form, Theory of Computing Systems, 63 (5) 2019, s. 1049–1067. Zobacz w PBN
Piotr Sankowski , Adam Karczmarz , Min-Cost Flow in Unit-Capacity Planar Graphs, 27th Annual European Symposium on Algorithms (ESA 2019), Monachium, Germany, 9 września 2019 - 13 września 2019, 144 2019, s. 66:1--66:17. Zobacz w PBN

2018

Piotr Sankowski , NC Algorithms for Weighted Planar Perfect Matching and Related Problems, 45th International Colloquium on Automata, Languages, and Programming, Praha, Czechia, 9 lipca 2018 - 13 lipca 2018. Zobacz w PBN
Marcin Pilipczuk , Michał Pilipczuk , Piotr Sankowski , Erik Jan van Leeuwen, Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs, ACM Transactions on Algorithms, 14 (4) 2018, s. 53:1-53:73. Zobacz w PBN
Marek Cygan , Artur Czumaj, Marcin Mucha , Piotr Sankowski , Online Facility Location with Deletions, 26th Annual European Symposium on Algorithms, Helsinki, Finland, 20 sierpnia 2018 - 22 sierpnia 2018. Zobacz w PBN
Paweł Gawrychowski, Adam Karczmarz , Tomasz Kociumaka, Piotr Sankowski , Jakub Łącki, Optimal dynamic strings, 29th ACM-SIAM Symposium on Discrete Algorithms, New Orleans, the United States of America, 7 stycznia 2018 - 10 stycznia 2018. Zobacz w PBN
Bartłomiej Bosek, Dariusz Leniowski, Anna Zych-Pawlewicz , Piotr Sankowski , Shortest augmenting paths for online matchings on trees, Theory of Computing Systems, 62 (2) 2018, s. 337-348. Zobacz w PBN

2017

Piotr Sankowski , Piotr Wygocki , Approximate Nearest Neighbors Search Without False Negatives For l_2 For c>sqrtloglogn, 28th International Symposium on Algorithms and Computation, Phuket, Thailand, 9 grudnia 2017 - 12 grudnia 2017. Zobacz w PBN
Stefano Leonardi, Gianpiero Monaco, Piotr Sankowski , Qiang Zhang, Budget Feasible Mechanisms on Matroids, 19th International Conference on Integer Programming and Combinatorial Optimization, Waterloo, Canada, 26 czerwca 2017 - 28 czerwca 2017. Zobacz w PBN
Jacob Holm, Giuseppe F. Italiano, Adam Karczmarz , Eva Rotenberg, Piotr Sankowski , Jakub Łącki, Contracting a Planar Graph Efficiently, 25th Annual European Symposium on Algorithms, Vienna, Austria, 4 września 2017 - 6 września 2017. Zobacz w PBN
Giuseppe F. Italiano, Adam Karczmarz , Piotr Sankowski , Jakub Łącki, Decremental Single-source Reachability in Planar Digraphs, 49th ACM Symposium on Theory of Computing, Montreal, Canada, 19 czerwca 2017 - 23 czerwca 2017. Zobacz w PBN
Piotr Sankowski , Karol Węgrzycki, Improved Distance Queries and Cycle Counting by Frobenius Normal Form, 34th International Symposium on Theoretical Aspects of Computer Science, Hannover, Germany, 8 marca 2017 - 11 marca 2017. Zobacz w PBN
Adrian Vladu, Michael B. Cohen, Aleksander Madry, Piotr Sankowski , Negative-Weight Shortest Paths and Unit Capacity Minimum Cost Flow in \~O (\emphm$^\mbox10/7$ log \emphW) Time (Extended Abstract), Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017, Barcelona, Spain, Hotel Porta Fira, January 16-19, 2017. Zobacz w PBN
Michael B. Cohen, Aleksander Mądry, Piotr Sankowski , Adrian Vladu, Negative-Weight Shortest Paths and Unit Capacity Minimum Cost Flow in Õ(m^10/7 log W) Time, 28th ACM-SIAM Symposium on Discrete Algorithms, Barcelona, Spain, 16 stycznia 2017 - 19 stycznia 2017. Zobacz w PBN
Jakub Lacki, Piotr Sankowski , Optimal Decremental Connectivity in Planar Graphs, Theory of Computing Systems, 2017. Zobacz w PBN
Andrzej Pacuk, Piotr Sankowski , Piotr Wygocki , Karol Węgrzycki, Why Do Cascade Sizes Follow a Power-Law?, 26th International Conference on World Wide Web Companion, Perth, Australia, 3 kwietnia 2017 - 7 kwietnia 2017. Zobacz w PBN

2016

Zaroliagis Christos, Piotr Sankowski , 24th Annual European Symposium on Algorithms, ESA 2016, August 22-24, 2016, Aarhus, Denmark, 2016. Zobacz w PBN
Paweł Brach, Marek Cygan , Piotr Sankowski , Jakub Łącki, Algorithmic Complexity of Power Law Networks, Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, January 10-12, 2016, 2016. Zobacz w PBN
Andrzej Pacuk, Piotr Sankowski , Piotr Wygocki , Karol Węgrzycki, Locality-Sensitive Hashing Without False Negatives for l_p, 22nd International Conference, COCOON 2016, Ho Chi Minh City, Vietnam, August 2-4, 2016, Ho Chi Minh City, Viet Nam, 2 sierpnia 2016 - 4 sierpnia 2016. Zobacz w PBN
Marcin Dziubiński , Piotr Sankowski , Qiang Zhang, Network elicitation in adversarial environment, Decision and Game Theory for Security, New York, the United States of America, 2 listopada 2016 - 4 listopada 2016. Zobacz w PBN
Aris Anagnostopoulos, Fabrizio Grandoni, Stefano Leonardi, Piotr Sankowski , Online Network Design with Outliers, Algorithmica, 2016. Zobacz w PBN
Marek Cygan , Marcin Mucha , Piotr Sankowski , Qiang Zhang, Online Pricing with Impatient Bidders, Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, the United States of America, 10 stycznia 2016 - 12 stycznia 2016. Zobacz w PBN
Andrzej Pacuk, Piotr Sankowski , Adam Witkowski, Piotr Wygocki , Karol Węgrzycki, RecSys Challenge 2016: Job Recommendations Based on Preselection of Offers and Gradient Boosting, The ACM Conference Series on Recommender Systems, Boston, the United States of America, 15 września 2016 - 19 września 2016. Zobacz w PBN
Andrzej Pacuk, Piotr Sankowski , Piotr Wygocki , Karol Węgrzycki, There is Something Beyond the Twitter Network, 27th ACM Conference on Hypertext and Social Media, Halifax, Canada, 10 lipca 2016 - 13 lipca 2016. Zobacz w PBN

2015

Marek Cygan , Harold N. Gabow, Piotr Sankowski , Algorithmic Applications of Baur-Strassen's Theorem: Shortest Cycles, Diameter, and Matchings, JOURNAL OF THE ACM, 2015. Zobacz w PBN
Piotr Sankowski , Glencora Borradaile, Christian Wulff-Nilsen, Min st-Cut Oracle for Planar Graphs with Near-Linear Preprocessing Time, ACM Transactions on Algorithms, 11 (3) 2015, s. 16:1-16:29. Zobacz w PBN
Aris Anagnostopoulos, Luca Becchetti, Ilaria Bordino, Stefano Leonardi, Ida Mele, Piotr Sankowski , Stochastic Query Covering for Fast Approximate Document Retrieval, ACM Transactions on Information Systems, 2015. Zobacz w PBN
Jakub Oćwieja, Marcin Pilipczuk , Piotr Sankowski , Anna Zych-Pawlewicz , Jakub Łącki, The Power of Dynamic Distance Oracles: Efficient Dynamic Algorithms for the Steiner Tree, Forty-Seventh Annual ACM on Symposium on Theory of Computing, Portland, the United States of America, 14 czerwca 2015 - 17 czerwca 2015. Zobacz w PBN

2014

Marek Adamczyk, Piotr Sankowski , Qiang Zhang, Efficiency of Truthful and Symmetric Mechanisms in One-Sided Matching, Lecture Notes in Computer Science, 7th International Symposium on Algorithmic Game Theory, 2014. Zobacz w PBN
Attila Bernáth, Krzysztof Ciebiera, Piotr Godlewski, Piotr Sankowski , Implementation of the Iterative Relaxation Algorithm for the Minimum Bounded-Degree Spanning Tree Problem., Lecture Notes in Computer Science, 13th International Symposium on Experimental Algorithms, 2014. Zobacz w PBN
Marcin Pilipczuk , Michał Pilipczuk , Piotr Sankowski , Erik Jan van Leeuwen, Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs, 55th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2014, Philadelphia, the United States of America, 18 października 2014 - 21 października 2014. Zobacz w PBN
Dariusz Leniowski, Piotr Sankowski , Anna Zych-Pawlewicz , Bartłomiej Bosek, Online Bipartite Matching in Offline Time, 55th IEEE Symposium on Foundations of Computer Science (FOCS14), Filadelfia, the United States of America, 18 października 2014 - 21 października 2014. Zobacz w PBN
Riccardo Colini-Baldeschi, Stefano Leonardi, Piotr Sankowski , Qiang Zhang, Revenue Maximizing Envy-Free Fixed-Price Auctions with Budgets, Lecture Notes in Computer Science, 10th International Conference on Web and Internet Economics, 2014. Zobacz w PBN
Paweł Brach, Alessandro Epasto, Alessandro Panconesi, Piotr Sankowski , Spreading Rumours Without the Network, ACM conference on Online social networks, 2014. Zobacz w PBN
Piotr Sankowski , Dariusz Leniowski, Angelo Fanelli, Gianpiero Monaco, The ring design game with fair cost allocation, Theoretical Computer Science, 562 2014, s. 90–100. Zobacz w PBN

2013

Marek Cygan , Marcin Mucha , Piotr Sankowski , Matthias Englert, Anupam Gupta, Catch them if you can: how to serve impatient users, Innovations in Theoretical Computer Science, Berkeley, the United States of America, 2013. Zobacz w PBN
Jakub Łącki, Piotr Sankowski , Reachability in graph timelines, Innovations in Theoretical Computer Science, Berkeley, the United States of America, 2013, s. 257-268. Zobacz w PBN
Fabrizio Grandoni, Anupam Gupta, Stefano Leonardi, Pauli Miettinen, Piotr Sankowski , Mohit Singh, Set Covering with Our Eyes Closed, SIAM Journal on Computing, 2013. Zobacz w PBN
Marcin Pilipczuk , Michał Pilipczuk , Piotr Sankowski , Erik Jan van Leeuwen, Subexponential-Time Parameterized Algorithm for Steiner Tree on Planar Graphs, 30th International Symposium on Theoretical Aspects of Computer Science, Kiel, Germany, 27 lutego 2013 - 2 marca 2013. Zobacz w PBN

2012

Marek Cygan , Fabrizio Grandoni, Stefano Leonardi, Marcin Pilipczuk , Piotr Sankowski , A Path-Decomposition Theorem with Applications to Pricing and Covering on Trees, Algorithms - ESA 2012 - 20th Annual European Symposium, Ljubljana, Slovenia, 10 września 2012 - 12 września 2012. Zobacz w PBN
Marek Cygan , Harold N. Gabow, Piotr Sankowski , Algorithmic Applications of Baur-Strassen's Theorem: Shortest Cycles, Diameter and Matchings, 2012. Zobacz w PBN
Michał Feldman, Amos Fiat, Stefano Leonardi, Piotr Sankowski , Revenue maximizing envy-free multi-unit auctions with budgets, 2012. Zobacz w PBN
Yahav Nussbaum, Piotr Sankowski , Christian Wulff-Nilsen, Jakub Łącki, Single Source - All Sinks Max Flows in Planar Digraphs, 53rd Annual IEEE Symposium on Foundations of Computer Science, FOCS 2012, 2012. Zobacz w PBN
R. Buczko, M. Bukała, P. Kacman, Piotr Sankowski , Structural and electronic properties of Pb$_1$-$x$Cd$_x$Te and Pb$_1$-$x$Mn$_x$Te ternary alloys, PHYSICAL REVIEW B, 2012. Zobacz w PBN
Angelo Fanelli, Dariusz Leniowski, Gianpiero Monaco, Piotr Sankowski , The Ring Design Game with Fair Cost Allocation - [Extended Abstract], 2012. Zobacz w PBN

2011

Marek Cygan , Fabrizio Grandoni, Stefano Leonardi, Marcin Mucha , Marcin Pilipczuk , Piotr Sankowski , Approximation Algorithms for Union and Intersection Covering Problems, IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Mumbai, India, 12 grudnia 2011 - 14 grudnia 2011. Zobacz w PBN
Ryszard Buczko, Małgorzata Bukała, Perła Kacman, Piotr Sankowski , Crystal and electronic structure of PbTe/CdTe nanostructures, 2011. Zobacz w PBN
Gudmund Frandsen, Piotr Sankowski , Dynamic normal forms and dynamic characteristic polynomial, Theoretical Computer Science, 2011. Zobacz w PBN
Giuseppe F. Italiano, Yahav Nussbaum, Piotr Sankowski , Christian Wulff-Nilsen, Improved algorithms for min cut and max flow in undirected planar graphs, 2011. Zobacz w PBN
Filip Murlak , Piotr Sankowski , Mathematical Foundations of Computer Science 2011 - 36th International Symposium, MFCS 2011, Warsaw, Poland, August 22-26, 2011., 2011. Zobacz w PBN
Piotr Sankowski , Jakub Łącki, Min-Cuts and Shortest Cycles in Planar Graphs in O(n log log n) Time, Lecture Notes in Computer Science, 2011. Zobacz w PBN
Amos Fiat, Stefano Leonardi, Jared Saia, Piotr Sankowski , Single valued combinatorial auctions with budgets, 2011. Zobacz w PBN
Aris Anagnostopoulos, Luca Becchetti, Stefano Leonardi, Ida Mele, Piotr Sankowski , Stochastic query covering, 2011. Zobacz w PBN

2010

Marek Cygan, Łukasz Kowalik , Marcin Mucha , Marcin Pilipczuk, Piotr Sankowski , Fast Approximation in Subspaces by Doubling Metric Decomposition, Lecture Notes in Computer Science, 2010. Zobacz w PBN
Marcin Mucha , Piotr Sankowski , Fast Dynamic Transitive Closure with Lookahead, Algorithmica, 2010. Zobacz w PBN
Glencora Borradaile, Piotr Sankowski , Christian Wulff-Nilsen, Min st-cut Oracle for Planar Graphs with Near-Linear Preprocessing Time, 2010. Zobacz w PBN
Aris Anagnostopoulos, Fabrizio Grandoni, Stefano Leonardi, Piotr Sankowski , Online Network Design with Outliers, Lecture Notes in Computer Science, 2010. Zobacz w PBN

2009

R. Buczko, M. Bukała, V. Domukhovski, K. Dybko, P. Dziawa, M. Galicka, P. Kacman, L. Kowalczyk, A. Mycielski, Piotr Sankowski , E. Smajek, T. Story, A. Szczerbakow, M. Szot, E. Łusakowska, Experimental and Theoretical Analysis οf PbTe-CdTe Solid Solution Grown by Physical Vapour Transport Method, Acta Physica Polonica A, 2009. Zobacz w PBN
Piotr Sankowski , Maximum weight bipartite matching in matrix multiplication time, Theoretical Computer Science, 2009. Zobacz w PBN
Perła Kacman, Piotr Sankowski , Modeling of Tunneling Magnetoresistance in (Ga, Mn) As-TRILAYERS, International Journal of Modern Physics B, 2009. Zobacz w PBN

2008

Piotr Sankowski , Algebraic Graph Algorithms, Lecture Notes in Computer Science, 2008. Zobacz w PBN
Gudmund Skovbjerg Frandsen, Piotr Sankowski , Dynamic Normal Forms and Dynamic Characteristic Polynomial, Lecture Notes in Computer Science, 2008. Zobacz w PBN
P. Kacman, Piotr Sankowski , Jacek Majewski, Modeling of bias anomaly in (Ga,Mn)As structures, Journal of Applied Physics, 2008. Zobacz w PBN
Perla Kacman, Piotr Sankowski , Jacek Majewski, Modeling of bias anomaly in (Ga,Mn)As tunneling magnetoresistance structures, Journal of Applied Physics, 2008. Zobacz w PBN
Piotr Sankowski , Processor Efficient Parallel Matching, Theory of Computing Systems, 2008. Zobacz w PBN
P. Kacman, Piotr Sankowski , Jacek Majewski, Self-consistent model of spin dependent tunneling in (Ga,Mn)As structures, Physica E: Low-Dimensional Systems and Nanostructures, 2008. Zobacz w PBN
Fabrizio Grandoni, Anupam Gupta, Stefano Leonardi, Pauli Miettinen, Piotr Sankowski , Mohit Singh, Set Covering with our Eyes Closed., 2008. Zobacz w PBN
Naveen Garg, Anupam Gupta, Stefano Leonardi, Piotr Sankowski , Stochastic analyses for online combinatorial optimization problems, 2008. Zobacz w PBN

2007

Jacek Majewski, Tomasz Dietl, R Oszwałdowski, P Kacman, Piotr Sankowski , Coherent spin transport in magnetization modulated semiconductor heterostructures, Physica Status Solidi (B): Basic Research, 2007. Zobacz w PBN
Krzysztof Diks , Piotr Sankowski , Dynamic Plane Transitive Closure, Lecture Notes in Computer Science, 2007. Zobacz w PBN
Piotr Sankowski , Faster dynamic matchings and vertex connectivity, 2007. Zobacz w PBN
S. Leonardi, Piotr Sankowski , Network Formation Games with Local Coalitions, 2007. Zobacz w PBN
Piotr Sankowski , Tomasz Dietl, P. Kacman, Jacek Majewski, Spin-dependent tunneling in modulated structures of (Ga,Mn)As, PHYSICA STATUS SOLIDI C-CONFERENCES, 2007. Zobacz w PBN
P. Kacman, Piotr Sankowski , Tomasz Dietl, Jacek Majewski, Vertical spin transport in semiconductor heterostructures, Low Temperature Physics, 2007. Zobacz w PBN

2006

Marcin Mucha , Piotr Sankowski , Maximum Matchings in Planar Graphs via Gaussian Elimination, Algorithmica, 2006. Zobacz w PBN
Perła Kacman, Piotr Sankowski , Spin-Dependent Phenomena in (Ga,Mn)As Heterostructures, Acta Physica Polonica A, 2006. Zobacz w PBN
T. Dietl, Piotr Sankowski , P. Kacman, Jacek Majewski, Spin-dependent tunneling in modulated structures of (Ga,Mn)As, PHYSICAL REVIEW B, 2006. Zobacz w PBN
T. Dietl, P. Kacman, Piotr Sankowski , Jacek Majewski, Theory of spin-dependent tunneling and resonant tunneling in layered structures based on (Ga,Mn)As, PHYSICA STATUS SOLIDI C-CONFERENCES, 2006. Zobacz w PBN
J. Dietl, Perła Kacman, Piotr Sankowski , Jacek Majewski, Tight-binding model of spin-polarized tunnelling in (Ga,Mn)As-basek structures, Physica E: Low-Dimensional Systems and Nanostructures, 2006. Zobacz w PBN
Piotr Sankowski , Weighted Bipartite Matching in Matrix Multiplication Time, Lecture Notes in Computer Science, 2006. Zobacz w PBN

2005

P. Kacman, Piotr Sankowski , Interlayer Exchange Coupling in (Ga,Mn)As-based Superlattices, PHYSICAL REVIEW B, 2005. Zobacz w PBN
T. Giebultowicz, P. Kacman, H. Kepa, C. Majkrzak, Piotr Sankowski , Neutron diffraction and reflectivity studies of Eu chalogenide based superlattices, Journal of Alloys and Compounds, 2005. Zobacz w PBN
T Giebultowicz, A Sipatov, P Kacman, C Majkrzak, Henryk Kępa, Piotr Sankowski , Neutron scattering studies of spin structure of magnetic semiconductor superlattices, AIP CONFERENCE PROCEEDINGS, 2005. Zobacz w PBN
Piotr Sankowski , Shortest Paths in Matrix Multiplication Time, Lecture Notes in Computer Science, 2005. Zobacz w PBN
Piotr Sankowski , Subquadratic Algorithm for Dynamic Shortest Distances, Lecture Notes in Computer Science, 2005. Zobacz w PBN
G. Borghs, J. De Boeck, T. Dietl, P. Kacman, J. Majewski, Piotr Sankowski , P. Van Dorpe, W. Van Roy, Voltage controlled spin injection in (Ga,Mn)As/(Al,Ga)As Zener diode, PHYSICAL REVIEW B, 2005. Zobacz w PBN
J. De Boeck, G. Borghs, W. van Roy, P. Kacman, Jacek Majewski, Tomasz Dietl, P. Van Dorpe, Piotr Sankowski , Voltage-controlled spin injection in a (Ga, Mn)As/(Al, Ga) As Zener diode, PHYSICAL REVIEW B, 2005. Zobacz w PBN

2004

T Giebultowicz, Perła Kacman, Henryk Kępa, C Majkrzak, Piotr Sankowski , A Sipatov, Antiferromagnetic interlayer coupling in EuS/YbSe superlattices, Journal of Magnetism and Magnetic Materials, 2004. Zobacz w PBN
Piotr Sankowski , Dynamic Transitive Closure via Dynamic Matrix Inverse, 2004. Zobacz w PBN
Krzysztof Ciebiera, Piotr Sankowski , Improving Web Sites by Automatic Source Code Analysis and Modification, Lecture Notes in Computer Science, 2004. Zobacz w PBN
T. Giebultowicz, P. Kacman, H. Kępa, C. Majkrzak, Piotr Sankowski , A. Sipatov, Interlayer Coupling in EuS-Based Superlattices Deduced from Neutron Scattering Experiments, Acta Physica Polonica A, 2004. Zobacz w PBN
Marcin Mucha , Piotr Sankowski , Maximum Matchings in Planar Graphs via Gaussian Elimination, Lecture Notes in Computer Science, 2004. Zobacz w PBN
Marcin Mucha , Piotr Sankowski , Maximum Matchings via Gaussian Elimination, 2004. Zobacz w PBN
Henryk Kępa, Perła Kacman, C Majkrzak, T Giebułtowicz, Piotr Sankowski , Neutron diffraction and reflectivity studies of Eu chalkogenides based superlattices, 2004. Zobacz w PBN

2003

Piotr Sankowski , Alternative Algorithm for Counting All Matchings in Graphs, Lecture Notes in Computer Science, 2003. Zobacz w PBN
Krzysztof Ciebiera, Piotr Sankowski , Inteligentny system dopasowania struktury pasmowej dla modelu ciasnego wiązania, 2003. Zobacz w PBN
P. Kacman, Piotr Sankowski , Interlayer Coupling in EuS-Based Superlattices (Dependence on the Energy Structure of Non-Magnetic Layer), Acta Physica Polonica A, 2003. Zobacz w PBN
Piotr Sankowski , Multisampling: a New Approach to Uniform Sampling and Approximate Counting, Lecture Notes in Computer Science, 2003. Zobacz w PBN