Wydział Matematyki, Informatyki i Mechaniki Uniwersytetu Warszawskiego
Publikacje
Piotr Sankowski
2018
- Piotr Sankowski i Karol Zbigniew Węgrzycki, Improved Distance Queries and Cycle Counting by Frobenius Normal Form, Theory Of Computing Systems 2018.zobacz w PBN
- Paweł Gawrychowski, Adam Karczmarz, Tomasz Kociumaka, Jakub Łącki i Piotr Sankowski, Optimal Dynamic Strings, w: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018, New Orleans, LA, USA, January 7-10, 2018, SIAM, 2018, s. 1509–1528.zobacz w PBN
- Marek Adam Cygan, Artur Czumaj, Marcin Ireneusz Mucha i Piotr Sankowski, Online Facility Location with Deletions, w: 26th Annual European Symposium on Algorithms, ESA 2018, August 20-22, 2018, Helsinki, Finland, 2018, r. 21, s. 1–15.zobacz w PBN
- Marcin Pilipczuk, Michał Pilipczuk, Piotr Sankowski i 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
2017
- Karol Zbigniew Węgrzycki, Piotr Sankowski, Andrzej Krzysztof Pacuk i Piotr Wygocki, Why Do Cascade Sizes Follow a Power-Law?, w: Proceedings of the 26th International Conference on World Wide Web, 2017, s. 569–576.zobacz w PBN
- Piotr Sankowski i Karol Zbigniew Węgrzycki, Improved Distance Queries and Cycle Counting by Frobenius Normal Form, w: 34th Symposium on Theoretical Aspects of Computer Science, 2017, r. 56, s. 1–14.zobacz w PBN
- Piotr Sankowski i Piotr Wygocki, Approximate Nearest Neighbors Search Without False Negatives For l_2 For c>sqrtloglogn, w: 28th International Symposium on Algorithms and Computation (ISAAC 2017), 2017, s. 63:1–63:12.zobacz w PBN
- Michael B. Cohen, Aleksander Mądry, Piotr Sankowski i Adrian Vladu, Negative-Weight Shortest Paths and Unit Capacity Minimum Cost Flow in Õ(m^10/7 log W) Time, w: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017, Barcelona, Spain, Hotel Porta Fira, January 16-19, Society for Industrial and Applied Mathematics, 2017, s. 752–771.zobacz w PBN
- Jacob Holm, Giuseppe F. Italiano, Adam Karol Karczmarz, Jakub Włodzimierz Łącki, Eva Rotenberg i Piotr Sankowski, Contracting a Planar Graph Efficiently, w: 25th Annual European Symposium on Algorithms, ESA 2017, September 4-6, 2017, Vienna, Austria, 2017, s. 50:1–50:15.zobacz w PBN
- Giuseppe F. Italiano, Adam Karol Karczmarz, Jakub Włodzimierz Łącki i Piotr Sankowski, Decremental Single-source Reachability in Planar Digraphs, w: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017, s. 1108–1121.zobacz w PBN
2016
- Aris Anagnostopoulos, Fabrizio Grandoni, Stefano Leonardi i Piotr Sankowski, Online Network Design with Outliers, Algorithmica 76 (1) 2016, s. 88–109.zobacz w PBN
- Marcin Konrad Dziubiński, Piotr Sankowski i Qiang Zhang, Network elicitation in adversarial environment, w: Proceedings of the 7th International Conference on Decision and Game Theory for Security, GameSec 2016, Springer, New York 2016, s. 397–414.zobacz w PBN
- Piotr Sankowski i Zaroliagis Christos (red.), 24th Annual European Symposium on Algorithms, ESA 2016, August 22-24, 2016, Aarhus, Denmark, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2016.zobacz w PBN
- Andrzej Krzysztof Pacuk, Piotr Sankowski, Karol Zbigniew Węgrzycki i Piotr Wygocki, There is Something Beyond the Twitter Network, w: Proceedings of the 27th ACM Conference on Hypertext and Social Media, 2016, s. 279–284.zobacz w PBN
- Andrzej Krzysztof Pacuk, Piotr Sankowski, Karol Zbigniew Węgrzycki i Piotr Wygocki, Locality-Sensitive Hashing Without False Negatives for \$\$l\_p\$\$, w: Computing and Combinatorics : 22nd International Conference, COCOON 2016, Ho Chi Minh City, Vietnam, August 2-4, 2016, Proceedings, 2016, s. 105–118.zobacz w PBN
- Marek Adam Cygan, Marcin Ireneusz Mucha, Piotr Sankowski i Qiang Zhang, Online Pricing with Impatient Bidders, w: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, January 10-12, 2016, SIAM, 2016, s. 190–201.zobacz w PBN
- Marcin Ireneusz Mucha i Piotr Sankowski, Maximum Matching, w: Encyclopedia of Algorithms, Springer, 2016, s. 1238–1240.zobacz w PBN
- Paweł Jarosław Brach, Marek Adam Cygan, Jakub Włodzimierz Łącki i Piotr Sankowski, Algorithmic Complexity of Power Law Networks, w: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, January 10-12, 2016, SIAM, 2016, s. 1306–1325.zobacz w PBN
- Andrzej Krzysztof Pacuk, Piotr Sankowski, Karol Zbigniew Węgrzycki, Adam Wojciech Witkowski i Piotr Wygocki, RecSys Challenge 2016: Job Recommendations Based on Preselection of Offers and Gradient Boosting, w: Proceedings of the Recommender Systems Challenge, ACM, 2016, s. 10:1–10:4.zobacz w PBN
2015
- Aris Anagnostopoulos, Luca Becchetti, Ilaria Bordino, Stefano Leonardi, Ida Mele i Piotr Sankowski, Stochastic Query Covering for Fast Approximate Document Retrieval, Acm Transactions On Information Systems 33 (3) 2015, s. 11:1–11:35.zobacz w PBN
- Glencora Borradaile, Piotr Sankowski i Christian Wulff-Nilsen, Min st-Cut Oracle for Planar Graphs with Near-Linear Preprocessing Time, Acm Transactions On Algorithms 2015.zobacz w PBN
- Marek Adam Cygan, Harold N. Gabow i Piotr Sankowski, Algorithmic Applications of Baur-Strassen's Theorem: Shortest Cycles, Diameter, and Matchings, Journal Of The Acm 62 (4) 2015, s. 28.zobacz w PBN
- Jakub Włodzimierz Łącki, Jakub Oćwieja, Marcin Pilipczuk, Piotr Sankowski i Anna Katarzyna Zych, The Power of Dynamic Distance Oracles: Efficient Dynamic Algorithms for the Steiner Tree, w: Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, STOC 2015, Portland, OR, USA, June 14-17, 2015, ACM, 2015, s. 11–20.zobacz w PBN
2014
- Riccardo Colini-Baldeschi, Stefano Leonardi, Piotr Sankowski i Qiang Zhang, Revenue Maximizing Envy-Free Fixed-Price Auctions with Budgets, Lecture Notes In Computer Science 2014.zobacz w PBN
- Paweł Jarosław Brach, Alessandro Epasto, Alessandro Panconesi i Piotr Sankowski, Spreading Rumours Without the Network, w: Proceedings of the Second ACM Conference on Online Social Networks, 2014, s. 107–118.zobacz w PBN
- Attila Bernáth, Krzysztof Ciebiera, Piotr Godlewski i Piotr Sankowski, Implementation of the Iterative Relaxation Algorithm for the Minimum Bounded-Degree Spanning Tree Problem., Lecture Notes In Computer Science 2014.zobacz w PBN
- Marek Adamczyk, Piotr Sankowski i Qiang Zhang, Efficiency of Truthful and Symmetric Mechanisms in One-Sided Matching, Lecture Notes In Computer Science 2014.zobacz w PBN
- Bartłomiej Bosek, Dariusz Leniowski, Piotr Sankowski i Anna Katarzyna Zych, Online Bipartite Matching in Offline Time, w: 55th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2014, IEEE Computer Society, 2014, s. 384–393.zobacz w PBN
- Angelo Fanelli, Dariusz Leniowski, Gianpiero Monaco i Piotr Sankowski, The ring design game with fair cost allocation, Theoretical Computer Science 2014.zobacz w PBN
- Marcin Pilipczuk, Michał Pilipczuk, Piotr Sankowski i Erik Jan van Leeuwen, Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs, w: 55th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2014, IEEE Computer Society, 2014, s. 276–285.zobacz w PBN
2013
- Fabrizio Grandoni, Anupam Gupta, Stefano Leonardi, Pauli Miettinen, Piotr Sankowski i Mohit Singh, Set Covering with Our Eyes Closed, Siam Journal On Computing 42 (3) 2013, s. 808–830.zobacz w PBN
- Jakub Włodzimierz Łącki i Piotr Sankowski, Reachability in graph timelines, w: Innovations in Theoretical Computer Science, ITCS '13, Berkeley, CA, USA, January 9-12, 2013, ACM, 2013, s. 257–268.zobacz w PBN
- Marcin Łukasz Pilipczuk, Michał Pilipczuk, Piotr Sankowski i Erik Jan van Leeuwen, Subexponential-Time Parameterized Algorithm for Steiner Tree on Planar Graphs, w: 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013), Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany 2013, s. 353–364.zobacz w PBN
- Marek Adam Cygan, Marcin Ireneusz Mucha, Piotr Sankowski, Matthias Englert i Anupam Gupta, Catch them if you can: how to serve impatient users, w: Innovations in Theoretical Computer Science, ITCS '13, Berkeley, CA, USA, January 9-12, 2013, ACM, 2013.zobacz w PBN
2012
- Marek Cygan, Harold N. Gabow i Piotr Sankowski, Algorithmic Applications of Baur-Strassen's Theorem: Shortest Cycles, Diameter and Matchings, w: 53rd Annual IEEE Symposium on Foundations of Computer Science, FOCS 2012, IEEE Computer Society, 2012.zobacz w PBN
- Marek Cygan, Fabrizio Grandoni, Stefano Leonardi, Marcin Pilipczuk i Piotr Sankowski, A Path-Decomposition Theorem with Applications to Pricing and Covering on Trees, w: Algorithms - ESA 2012 - 20th Annual European Symposium, Springer, 2012, s. 349–360.zobacz w PBN
- Angelo Fanelli, Dariusz Leniowski, Gianpiero Monaco i Piotr Sankowski, The Ring Design Game with Fair Cost Allocation - [Extended Abstract], w: WINE, 2012.zobacz w PBN
- Michał Feldman, Amos Fiat, Stefano Leonardi i Piotr Sankowski, Revenue maximizing envy-free multi-unit auctions with budgets, w: ACM Conference on Electronic Commerce, 2012.zobacz w PBN
- Jakub Łącki, Yahav Nussbaum, Piotr Sankowski i Christian Wulff-Nilsen, Single Source - All Sinks Max Flows in Planar Digraphs, w: 53rd Annual IEEE Symposium on Foundations of Computer Science, FOCS 2012, IEEE Computer Society, 2012.zobacz w PBN
- M. Bukała, Piotr Sankowski, R. Buczko i P. Kacman, Structural and electronic properties of Pb$_1$-$x$Cd$_x$Te and Pb$_1$-$x$Mn$_x$Te ternary alloys, Physical Review B 86 2012, s. 085205.zobacz w PBN
2011
- Małgorzata Bukała, Piotr Sankowski, Ryszard Buczko i Perła Kacman, Crystal and electronic structure of PbTe/CdTe nanostructures, Nanoscale Research Letters 6 (1) 2011, s. 1–7.zobacz w PBN
- Jakub Łącki i Piotr Sankowski, Min-Cuts and Shortest Cycles in Planar Graphs in O(n log log n) Time, Lecture Notes In Computer Science 6942 2011, s. 155–166.zobacz w PBN
- Marek Cygan, Fabrizio Grandoni, Stefano Leonardi, Marcin Mucha, Marcin Pilipczuk i Piotr Sankowski, Approximation Algorithms for Union and Intersection Covering Problems, w: Proceedings of IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science 2011, Leibniz-Zentrum fuer Informatik, Dagstuhl 2011, s. 28–40.zobacz w PBN
- Filip Murlak i Piotr Sankowski (red.), Mathematical Foundations of Computer Science 2011 - 36th International Symposium, MFCS 2011, Warsaw, Poland, August 22-26, 2011., Springer, Berlin 2011.zobacz w PBN
- Gudmund Frandsen i Piotr Sankowski, Dynamic normal forms and dynamic characteristic polynomial, Theoretical Computer Science 412 (16) 2011, s. 1470–1483.zobacz w PBN
- Giuseppe F. Italiano, Yahav Nussbaum, Piotr Sankowski i Christian Wulff-Nilsen, Improved algorithms for min cut and max flow in undirected planar graphs, w: STOC, ACM, San Jose 2011.zobacz w PBN
- Amos Fiat, Stefano Leonardi, Jared Saia i Piotr Sankowski, Single valued combinatorial auctions with budgets, w: ACM Conference on Electronic Commerce, 2011.zobacz w PBN
- Aris Anagnostopoulos, Luca Becchetti, Stefano Leonardi, Ida Mele i Piotr Sankowski, Stochastic query covering, w: WSDM, ACM, Hong Kong 2011.zobacz w PBN
2010
- Marek Cygan, Łukasz Kowalik, Marcin Mucha, Marcin Pilipczuk i Piotr Sankowski, Fast Approximation in Subspaces by Doubling Metric Decomposition, Lecture Notes In Computer Science 6346 2010, s. 72–83.zobacz w PBN
- Glencora Borradaile, Piotr Sankowski i Christian Wulff-Nilsen, Min st-cut Oracle for Planar Graphs with Near-Linear Preprocessing Time, w: FOCS, 2010.zobacz w PBN
- Aris Anagnostopoulos, Fabrizio Grandoni, Stefano Leonardi i Piotr Sankowski, Online Network Design with Outliers, Lecture Notes In Computer Science 6198 2010, s. 114–126.zobacz w PBN
- Piotr Sankowski i Marcin Mucha, Fast Dynamic Transitive Closure with Lookahead, Algorithmica 56 (2) 2010, s. 180–197.zobacz w PBN
2009
- Piotr Sankowski, Maximum weight bipartite matching in matrix multiplication time, Theoretical Computer Science 410 (44) 2009, s. 4480–4488.zobacz w PBN
- M. Szot, A. Szczerbakow, K. Dybko, L. Kowalczyk, E. Smajek, V. Domukhovski, E. Łusakowska, P. Dziawa, A. Mycielski, T. Story, M. Bukała, M. Galicka, Piotr Sankowski, R. Buczko i P. Kacman, Experimental and Theoretical Analysis οf PbTe-CdTe Solid Solution Grown by Physical Vapour Transport Method, Acta Physica Polonica A 116 (5) 2009, s. 959–961.zobacz w PBN
- Piotr Sankowski i Perła Kacman, Modeling of Tunneling Magnetoresistance in (Ga, Mn) As-TRILAYERS, International Journal Of Modern Physics B 23 (12-13) 2009, s. 2969–2973.zobacz w PBN
2008
- P Sankowski, Perla Kacman i Jacek Majewski, Modeling of bias anomaly in (Ga,Mn)As tunneling magnetoresistance structures, Journal Of Applied Physics 103 2008, s. 1–10.zobacz w PBN
- Piotr Sankowski, P. Kacman i J. A. Majewski, Self-consistent model of spin dependent tunneling in (Ga,Mn)As structures, Physica E-low-dimensional Systems & Nanostructures 40 (6) 2008, s. 1944–1946.zobacz w PBN
- Gudmund Skovbjerg Frandsen i Piotr Sankowski, Dynamic Normal Forms and Dynamic Characteristic Polynomial, Lecture Notes In Computer Science 5125 2008, s. 434–446.zobacz w PBN
- Piotr Sankowski, Algebraic Graph Algorithms, Lecture Notes In Computer Science 5162 2008, s. 68–82.zobacz w PBN
- Naveen Garg, Anupam Gupta, Stefano Leonardi i Piotr Sankowski, Stochastic analyses for online combinatorial optimization problems, w: SODA, 2008.zobacz w PBN
- Piotr Sankowski, Processor Efficient Parallel Matching, Theory Of Computing Systems 42 (1) 2008, s. 73–90.zobacz w PBN
- Fabrizio Grandoni, Anupam Gupta, Stefano Leonardi, Pauli Miettinen, Piotr Sankowski i Mohit Singh, Set Covering with our Eyes Closed., w: FOCS, 2008.zobacz w PBN
- Piotr Sankowski, P. Kacman i J. A. Majewski, Modeling of bias anomaly in (Ga,Mn)As structures, Journal Of Applied Physics 103 (10) 2008, s. 103709–103702.zobacz w PBN
2007
- Piotr Sankowski, P. Kacman, J. Majewski i Tomasz Dietl, Spin-dependent tunneling in modulated structures of (Ga,Mn)As, Physica Status Solidi C-conferences 4 (2) 2007, s. 493–496.zobacz w PBN
- Piotr Sankowski, P. Kacman, J. Majewski i Tomasz Dietl, Vertical spin transport in semiconductor heterostructures, Low Temperature Physics 33 2007, s. 187.zobacz w PBN
- Krzysztof Diks i Piotr Sankowski, Dynamic Plane Transitive Closure, Lecture Notes In Computer Science 4698 2007, s. 594–604.zobacz w PBN
- Piotr Sankowski, Faster dynamic matchings and vertex connectivity, w: SODA 2007, SIAM Ź, Louisiana 2007.zobacz w PBN
- S. Leonardi i Piotr Sankowski, Network Formation Games with Local Coalitions, w: Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing (PODC 2007), Oregon 2007.zobacz w PBN
- Piotr Sankowski, P. Kacman, J. Majewski i Tomasz Dietl, Spin-dependent tunneling in modulated structures of (Ga,Mn)As, Physical Review B 75 2007, s. 45306.zobacz w PBN
2006
- Marcin Mucha i Piotr Sankowski, Maximum Matchings in Planar Graphs via Gaussian Elimination, Algorithmica 45 (1) 2006, s. 3–20.zobacz w PBN
- Piotr Sankowski, Weighted Bipartite Matching in Matrix Multiplication Time, Lecture Notes In Computer Science 4052 2006, s. 274–285.zobacz w PBN
- Piotr Sankowski, P. Kacman, J. Majewski i T. Dietl, Spin-dependent tunneling in modulated structures of (Ga,Mn)As, Physical Review B 75 2006, s. 45306.zobacz w PBN
- Piotr Sankowski i Perła Kacman, Spin-Dependent Phenomena in (Ga,Mn)As Heterostructures, Acta Physica Polonica A 110 (2) 2006, s. 139–150.zobacz w PBN
- Piotr Sankowski, Perła Kacman, Jacek Majewski i J. Dietl, Tight-binding model of spin-polarized tunnelling in (Ga,Mn)As-basek structures, Physica E-low-dimensional Systems & Nanostructures 32 2006, s. 275–378.zobacz w PBN
- Piotr Sankowski, P. Kacman, J. Majewski i T. Dietl, Theory of spin-dependent tunneling and resonant tunneling in layered structures based on (Ga,Mn)As, Physica Status Solidi C-conferences 3 2006, s. 4188–4191.zobacz w PBN
2005
- H. Kepa, C. Majkrzak, Piotr Sankowski, P. Kacman i T. Giebultowicz, Neutron diffraction and reflectivity studies of Eu chalogenide based superlattices, Journal Of Alloys And Compounds 401 2005, s. 238–248.zobacz w PBN
- Piotr Sankowski, Shortest Paths in Matrix Multiplication Time, Lecture Notes In Computer Science 3669 2005, s. 770–778.zobacz w PBN
- Piotr Sankowski, Subquadratic Algorithm for Dynamic Shortest Distances, Lecture Notes In Computer Science 3595 2005, s. 461–470.zobacz w PBN
- P. Van Dorpe, W. Van Roy, J. De Boeck, G. Borghs, Piotr Sankowski, P. Kacman, J. Majewski i T. Dietl, Voltage controlled spin injection in (Ga,Mn)As/(Al,Ga)As Zener diode, Physical Review B 72 2005, s. 205322.zobacz w PBN
- Piotr Sankowski i P. Kacman, Interlayer Exchange Coupling in (Ga,Mn)As-based Superlattices, Physical Review B 71 2005, s. 201303.zobacz w PBN
2004
- Henryk Kępa, Piotr Sankowski, Perła Kacman, A Sipatov, C Majkrzak i T Giebultowicz, Antiferromagnetic interlayer coupling in EuS/YbSe superlattices, Journal Of Magnetism And Magnetic Materials 272-276 (Part 1) 2004, s. 323–324.zobacz w PBN
- Piotr Sankowski, Henryk Kępa, P Kacman, A Sipatov, C Majkrzak i T Giebultowicz, Interlayer coupling in EuS-based superlattices deduced from neutron scattering experiments, Acta Physica Polonica A 105 (6) 2004, s. 607–614.zobacz w PBN
- Krzysztof Ciebiera i Piotr Sankowski, Improving Web Sites by Automatic Source Code Analysis and Modification, Lecture Notes In Computer Science 3140 2004, s. 579–580.zobacz w PBN
- Marcin Mucha i Piotr Sankowski, Maximum Matchings in Planar Graphs via Gaussian Elimination, Lecture Notes In Computer Science 3221 2004, s. 532–543.zobacz w PBN
- Marcin Mucha i Piotr Sankowski, Maximum Matchings via Gaussian Elimination, w: Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science, IEEE Computer Society, USA 2004.zobacz w PBN
- Piotr Sankowski, Dynamic Transitive Closure via Dynamic Matrix Inverse, w: Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science, IEEE Computer Society, USA 2004.zobacz w PBN
- P. Sankowski, H. Kępa, P. Kacman, A. Sipatov, C. Majkrzak i T. Giebultowicz, Interlayer Coupling in EuS-Based Superlattices Deduced from Neutron Scattering Experiments, Acta Physica Polonica A 105 2004, s. 607–614.zobacz w PBN
2003
- Piotr Sankowski, Alternative Algorithm for Counting All Matchings in Graphs, Lecture Notes In Computer Science 2607 2003, s. 427–438.zobacz w PBN
- Piotr Sankowski, Multisampling: a New Approach to Uniform Sampling and Approximate Counting, Lecture Notes In Computer Science 2832 2003, s. 740–751.zobacz w PBN
- Piotr Sankowski i Perla Kacman, Interlayer Coupling in EuS-based Superlattices (Dependence on the Energy Structure of Non-magnetic Layer), Acta Physica Polonica A 103 (6) 2003, s. 621–628.zobacz w PBN
- Krzysztof Ciebiera i Piotr Sankowski, Inteligentny system dopasowania struktury pasmowej dla modelu ciasnego wiązania, w: V Krajowa Konferencja Naukowa Inżynieria Wiedzy i Systemy Ekspertowe 2003, Wrocław 2003.zobacz w PBN
- P. Sankowski i P. Kacman, Interlayer Coupling in EuS-Based Superlattices (Dependence on the Energy Structure of Non-Magnetic Layer), Acta Physica Polonica A 103 2003, s. 621–628.zobacz w PBN
Nie jesteś zalogowany | zaloguj się
