Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
168 Publications
2020 |
Published |
Conference Paper |
IST-REx-ID: 9631 |
Aksenov, Vitaly, et al. Scalable Belief Propagation via Relaxed Scheduling. Vol. 33, Neural Information Processing Systems Foundation, 2020, pp. 22361–72.
[Published Version]
View
| Download Published Version (ext.)
| arXiv
2020 |
Published |
Conference Paper |
IST-REx-ID: 9632 |
Singh, Sidak Pal, and Dan-Adrian Alistarh. WoodFisher: Efficient Second-Order Approximation for Neural Network Compression. Vol. 33, Neural Information Processing Systems Foundation, 2020, pp. 18098–109.
[Published Version]
View
| Download Published Version (ext.)
| arXiv
2020 |
Published |
Conference Paper |
IST-REx-ID: 7213 |
Bhatia, Sumit, et al. “A Persistent Homology Perspective to the Link Prediction Problem.” Complex Networks and Their Applications VIII, vol. 881, Springer Nature, 2020, pp. 27–39, doi:10.1007/978-3-030-36687-2_3.
[Submitted Version]
View
| Files available
| DOI
| WoS
2020 |
Published |
Journal Article |
IST-REx-ID: 7224 |
Rybicki, Joel, et al. “Habitat Fragmentation and Species Diversity in Competitive Communities.” Ecology Letters, vol. 23, no. 3, Wiley, 2020, pp. 506–17, doi:10.1111/ele.13450.
[Published Version]
View
| Files available
| DOI
| WoS
| PubMed | Europe PMC
2020 |
Published |
Conference Paper |
IST-REx-ID: 7272 |
Arbel-Raviv, Maya, et al. “Getting to the Root of Concurrent Binary Search Tree Performance.” Proceedings of the 2018 USENIX Annual Technical Conference, USENIX Association, 2020, pp. 295–306.
[Published Version]
View
| Download Published Version (ext.)
2020 |
Published |
Conference Paper |
IST-REx-ID: 7605 |
Alistarh, Dan-Adrian, et al. “In Search of the Fastest Concurrent Union-Find Algorithm.” 23rd International Conference on Principles of Distributed Systems, vol. 153, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, p. 15:1-15:16, doi:10.4230/LIPIcs.OPODIS.2019.15.
[Published Version]
View
| Files available
| DOI
| arXiv
2020 |
Published |
Conference Paper |
IST-REx-ID: 7635 |
Koval, Nikita, et al. “Testing Concurrency on the JVM with Lincheck.” Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, Association for Computing Machinery, 2020, pp. 423–24, doi:10.1145/3332466.3374503.
[Published Version]
View
| DOI
| Download Published Version (ext.)
2020 |
Published |
Conference Paper |
IST-REx-ID: 7636 |
Brown, Trevor A., et al. “Non-Blocking Interpolation Search Trees with Doubly-Logarithmic Running Time.” Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, Association for Computing Machinery, 2020, pp. 276–91, doi:10.1145/3332466.3374542.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| WoS
2020 |
Published |
Conference Paper |
IST-REx-ID: 8724 |
Konstantinov, Nikola H., et al. “On the Sample Complexity of Adversarial Multi-Source PAC Learning.” Proceedings of the 37th International Conference on Machine Learning, vol. 119, ML Research Press, 2020, pp. 5416–25.
[Published Version]
View
| Files available
| arXiv
2020 |
Published |
Conference Paper |
IST-REx-ID: 9198 |
Shevchenko, Aleksandr, and Marco Mondelli. “Landscape Connectivity and Dropout Stability of SGD Solutions for Over-Parameterized Neural Networks.” Proceedings of the 37th International Conference on Machine Learning, vol. 119, ML Research Press, 2020, pp. 8773–84.
[Published Version]
View
| Files available
| arXiv
2019 |
Published |
Conference Paper |
IST-REx-ID: 5947 |
Chatterjee, Bapi, et al. “A Simple and Practical Concurrent Non-Blocking Unbounded Graph with Linearizable Reachability Queries.” ACM International Conference Proceeding Series, ACM, 2019, pp. 168–77, doi:10.1145/3288599.3288617.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2019 |
Published |
Conference Poster |
IST-REx-ID: 6485
Koval, Nikita, et al. “Lock-Free Channels for Programming via Communicating Sequential Processes.” Proceedings of the 24th Symposium on Principles and Practice of Parallel Programming, ACM, 2019, pp. 417–18, doi:10.1145/3293883.3297000.
View
| DOI
| WoS
2019 |
Published |
Conference Paper |
IST-REx-ID: 6676 |
Alistarh, Dan-Adrian, et al. “Why Extension-Based Proofs Fail.” Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, ACM, 2019, pp. 986–96, doi:10.1145/3313276.3316407.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2019 |
Published |
Journal Article |
IST-REx-ID: 6759 |
Jelínek, Vít, and Martin Töpfer. “On Grounded L-Graphs and Their Relatives.” Electronic Journal of Combinatorics, vol. 26, no. 3, P3.17, Electronic Journal of Combinatorics, 2019, doi:10.37236/8096.
[Published Version]
View
| Files available
| DOI
| arXiv
2019 |
Published |
Conference Paper |
IST-REx-ID: 6931 |
Nowak, Thomas, and Joel Rybicki. “Byzantine Approximate Agreement on Graphs.” 33rd International Symposium on Distributed Computing, vol. 146, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 29:1--29:17, doi:10.4230/LIPICS.DISC.2019.29.
[Published Version]
View
| Files available
| DOI
| arXiv
2019 |
Published |
Conference Paper |
IST-REx-ID: 6933 |
Censor-Hillel, Keren, et al. “Fast Approximate Shortest Paths in the Congested Clique.” Proceedings of the 2019 ACM Symposium on Principles of Distributed Computin, ACM, 2019, pp. 74–83, doi:10.1145/3293611.3331633.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2019 |
Published |
Conference Paper |
IST-REx-ID: 6935 |
Foerster, Klaus-Tycho, et al. “Does Preprocessing Help under Congestion?” Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, ACM, 2019, pp. 259–61, doi:10.1145/3293611.3331581.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2019 |
Published |
Journal Article |
IST-REx-ID: 6936 |
Ovaskainen, Otso, et al. “What Can Observational Data Reveal about Metacommunity Processes?” Ecography, vol. 42, no. 11, Wiley, 2019, pp. 1877–86, doi:10.1111/ecog.04444.
[Published Version]
View
| Files available
| DOI
| WoS
2019 |
Published |
Journal Article |
IST-REx-ID: 6972 |
Lenzen, Christoph, and Joel Rybicki. “Self-Stabilising Byzantine Clock Synchronisation Is Almost as Easy as Consensus.” Journal of the ACM, vol. 66, no. 5, 32, ACM, 2019, doi:10.1145/3339471.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2019 |
Published |
Conference Paper |
IST-REx-ID: 7122
Khirirat, Sarit, et al. “Gradient Compression for Communication-Limited Convex Optimization.” 2018 IEEE Conference on Decision and Control, 8619625, IEEE, 2019, doi:10.1109/cdc.2018.8619625.
View
| DOI
| WoS