Parallella system

Organisation: avdelning

Fler filtreringsmöjligheter
  1. 2021
  2. Pushing the Online Boolean Matrix-vector Multiplication conjecture off-line and identifying its easy cases

    Leszek Gasieniec, Jesper Jansson, Christos Levcopoulos, Andrzej Lingas & Mia Persson, 2021 jun, I: Journal of Computer and System Sciences. 118, s. 108-118 11 s.

    Forskningsoutput: TidskriftsbidragArtikel i vetenskaplig tidskrift

  3. Sparse Steiner triple systems of order 21

    Janne I. Kokkala & Patric R.J. Östergård, 2021 feb, I: Journal of Combinatorial Designs. 29, 2, s. 75-83 9 s.

    Forskningsoutput: TidskriftsbidragArtikel i vetenskaplig tidskrift

  4. Learn to relax: Integrating 0-1 integer linear programming with pseudo-Boolean conflict-driven search

    Jo Devriendt, Ambros Gleixner & Jakob Nordström, 2021 jan 18, I: Constraints.

    Forskningsoutput: TidskriftsbidragArtikel i vetenskaplig tidskrift

  5. Foreword: Selected papers from the 22nd International Symposium on Fundamentals of Computation Theory (FCT 2019)

    Leszek Gasieniec, Jesper Jansson & Christos Levcopoulos, 2021, I: Journal of Computer and System Sciences. 120, s. 177-178 2 s.

    Forskningsoutput: TidskriftsbidragArtikel i vetenskaplig tidskrift

  6. Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling

    Susanna F. De Rezende, Or Meir, Jakob Nordström & Robert Robere, 2021, I: Computational Complexity. 30, 1, 4.

    Forskningsoutput: TidskriftsbidragArtikel i vetenskaplig tidskrift

  7. Quantum and Approximation Algorithms for Maximum Witnesses of Boolean Matrix Products

    Mirosław Kowaluk & Andrzej Lingas, 2021, Algorithms and Discrete Applied Mathematics - 7th International Conference, CALDAM 2021, Proceedings. Mudgal, A. & Subramanian, C. R. (red.). Springer Science + Business Media, s. 440-451 12 s. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 12601 LNCS).

    Forskningsoutput: Kapitel i bok/rapport/Conference proceedingKonferenspaper i proceeding

  8. 2020
  9. A simple approach to nondecreasing paths

    Mirosław Kowaluk & Andrzej Lingas, 2020 okt, I: Information Processing Letters. 162, 105992.

    Forskningsoutput: TidskriftsbidragArtikel i vetenskaplig tidskrift

  10. Multivariate Analysis of Orthogonal Range Searching and Graph Distances

    Karl Bringmann, Thore Husfeldt & Måns Magnusson, 2020 aug, I: Algorithmica. 82, 8, s. 2292-2315 24 s.

    Forskningsoutput: TidskriftsbidragArtikel i vetenskaplig tidskrift

  11. Exponential resolution lower bounds for weak pigeonhole principle and perfect matching formulas over sparse graphs

    Susanna F. de Rezende, Jakob Nordström, Kilian Risse & Dmitry Sokolov, 2020 jul 1, CCC '20: Proceedings of the 35th Computational Complexity Conference 2020. Saraf, S. (red.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 28. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 169).

    Forskningsoutput: Kapitel i bok/rapport/Conference proceedingKonferenspaper i proceeding

  12. Small normalized circuits for semi-disjoint bilinear forms require logarithmic and-depth

    Andrzej Lingas, 2020 jun 8, I: Theoretical Computer Science. 820, s. 17-25 9 s.

    Forskningsoutput: TidskriftsbidragArtikel i vetenskaplig tidskrift

  13. Dual-precision fixed-point arithmetic for low-power ray-triangle intersections

    Krishna Rajan, Soheil Hashemi, Ulya Karpuzcu, Michael Doggett & Sherief Reda, 2020 apr, I: Computers and Graphics. 87, s. 72-79 8 s.

    Forskningsoutput: TidskriftsbidragArtikel i vetenskaplig tidskrift

  14. Photon Mapping Superluminal Particles

    Gustaf Waldemarson & Michael Doggett, 2020 apr, EG 2020 - Short Papers. Eurographics - European Association for Computer Graphics, 4 s.

    Forskningsoutput: Kapitel i bok/rapport/Conference proceedingKonferenspaper i proceeding

  15. Crystal centering using deep learning in X-ray crystallography

    Jonathan Schurmann, Isaak Lindhe, Jorn W. Janneck, Gustavo Lima & Zdenek Matej, 2020 mar 30, 2019 53rd Asilomar Conference on Signals, Systems, and Computers. Matthews, M. B. (red.). IEEE - Institute of Electrical and Electronics Engineers Inc., s. 978-983 6 s. 9048793

    Forskningsoutput: Kapitel i bok/rapport/Conference proceedingKonferenspaper i proceeding

  16. Computing the boolean product of two n × n boolean matrices using o(N2) mechanical operations

    Andrzej Lingas & Mia Persson, 2020 jan 1, I: International Journal of Unconventional Computing. 15, 3, s. 225-236 12 s.

    Forskningsoutput: TidskriftsbidragArtikel i vetenskaplig tidskrift

  17. Trade-offs between size and degree in polynomial calculus

    Guillaume Lagarde, Jakob Nordström, Dmitry Sokolov & Joseph Swernofsky, 2020 jan, 11th Innovations in Theoretical Computer Science Conference, ITCS 2020. Vidick, T. (red.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 72. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 151).

    Forskningsoutput: Kapitel i bok/rapport/Conference proceedingKonferenspaper i proceeding

  18. A framework to generate domain-specific manycore architectures from dataflow programs

    Süleyman Savas, Zain Ul-Abdin & Tomas Nordström, 2020, I: Microprocessors and Microsystems. 72, 102908.

    Forskningsoutput: TidskriftsbidragArtikel i vetenskaplig tidskrift

  19. Certifying Solvers for Clique and Maximum Common (Connected) Subgraph Problems

    Stephan Gocht, Ross McBride, Ciaran McCreesh, Jakob Nordström, Patrick Prosser & James Trimble, 2020, Principles and Practice of Constraint Programming - 26th International Conference, CP 2020, Proceedings. Simonis, H. (red.). Springer, s. 338-357 20 s. (Lecture Notes in Computer Science; vol. 12333).

    Forskningsoutput: Kapitel i bok/rapport/Conference proceedingKonferenspaper i proceeding

  20. Graphs with equal domination and covering numbers

    Andrzej Lingas, Mateusz Miotk, Jerzy Topp & Paweł Żyliński, 2020, I: Journal of Combinatorial Optimization. 39, 1, s. 55-71

    Forskningsoutput: TidskriftsbidragArtikel i vetenskaplig tidskrift

  21. Simplified and Improved Separations Between Regular and General Resolution by Lifting

    Marc Vinyals, Jan Elffers, Jan Johannsen & Jakob Nordström, 2020, Theory and Applications of Satisfiability Testing – SAT 2020: 23rd International Conference, Proceedings. Pulina, L. & Seidl, M. (red.). Springer, s. 182-200 19 s. (Lecture Notes in Computer Science; vol. 12178).

    Forskningsoutput: Kapitel i bok/rapport/Conference proceedingKonferenspaper i proceeding

  22. Solving Hard Problems by Protein Folding?

    Andrzej Lingas, 2020, Theory and Practice of Natural Computing - 9th International Conference, TPNC 2020, Proceedings. Martín-Vide, C., Vega-Rodríguez, M. A. & Yang, M-S. (red.). Springer Science + Business Media, s. 36-41 6 s. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 12494 LNCS).

    Forskningsoutput: Kapitel i bok/rapport/Conference proceedingKonferenspaper i proceeding

  23. Theoretical and Experimental Results for Planning with Learned Binarized Neural Network Transition Models

    Buser Say, Jo Devriendt, Jakob Nordström & Peter J. Stuckey, 2020, Principles and Practice of Constraint Programming - 26th International Conference, CP 2020, Proceedings. Simonis, H. (red.). Springer, s. 917-934 18 s. (Lecture Notes in Computer Science; vol. 12333).

    Forskningsoutput: Kapitel i bok/rapport/Conference proceedingKonferenspaper i proceeding

  24. Tinted, Detached, and Lazy CNF-XOR Solving and Its Applications to Counting and Sampling

    Mate Soos, Stephan Gocht & Kuldeep S. Meel, 2020, Computer Aided Verification - 32nd International Conference, CAV 2020, Proceedings. Lahiri, S. K. & Wang, C. (red.). Springer Gabler, s. 463-484 22 s. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 12224 LNCS).

    Forskningsoutput: Kapitel i bok/rapport/Conference proceedingKonferenspaper i proceeding

  25. Using Resolution Proofs to Analyse CDCL Solvers

    Janne I. Kokkala & Jakob Nordström, 2020, Principles and Practice of Constraint Programming - 26th International Conference, CP 2020, Proceedings. Simonis, H. (red.). Springer, s. 427-444 18 s. (Lecture Notes in Computer Science; vol. 12333).

    Forskningsoutput: Kapitel i bok/rapport/Conference proceedingKonferenspaper i proceeding

  26. Verifying Properties of Bit-vector Multiplication Using Cutting Planes Reasoning

    Vincent Liew, Paul Beame, Jo Devriendt, Jan Elffers & Jakob Nordstrom, 2020, Proceedings of the 20th Conference on Formal Methods in Computer-Aided Design, FMCAD 2020. Ivrii, A., Strichman, O., Hunt, W. A. & Weissenbacher, G. (red.). Institute of Electrical and Electronics Engineers Inc., s. 194-204 11 s. 9283622. (Proceedings of the 20th Conference on Formal Methods in Computer-Aided Design, FMCAD 2020).

    Forskningsoutput: Kapitel i bok/rapport/Conference proceedingKonferenspaper i proceeding

  27. 2019
  28. Tÿcho: A framework for compiling stream programs

    Gustav Cedersjö & Jörn W. Janneck, 2019 dec, I: ACM Transactions on Embedded Computing Systems. 18, 6, 120.

    Forskningsoutput: TidskriftsbidragArtikel i vetenskaplig tidskrift

  29. Local Routing in Sparse and Lightweight Geometric Graphs

    Vikrant Ashvinkumar, Joachim Gudmundsson, Christos Levcopoulos, Bengt J. Nilsson & André van Renssen, 2019 nov 28, 30th International Symposium on Algorithms and Computation (ISAAC 2019): ISAAC 2019, December 8–11, 2019, Shanghai University of Finance and Economics, Shanghai, China. Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Vol. 149. s. 30:1-30:13 13 s. (LIPIcs – Leibniz International Proceedings in Informatics; vol. 149).

    Forskningsoutput: Kapitel i bok/rapport/Conference proceedingKonferenspaper i proceeding

  30. Shortest two disjoint paths in polynomial time

    Andreas Björklund & Thore Husfeldt, 2019 nov 19, I: SIAM Journal on Computing. 48, 6, s. 1698-1710 13 s.

    Forskningsoutput: TidskriftsbidragArtikel i vetenskaplig tidskrift

  31. Generalized Kakeya sets for polynomial evaluation and faster computation of fermionants

    Andreas Björklund, Petteri Kaski & Ryan Williams, 2019 okt, I: Algorithmica. 81, 10, s. 4010-4028 19 s.

    Forskningsoutput: TidskriftsbidragArtikel i vetenskaplig tidskrift

  32. Constraint programming in embedded systems design: Considered helpful

    Krzysztof Kuchcinski, 2019 sep 1, I: Microprocessors and Microsystems. 69, s. 24-34 11 s.

    Forskningsoutput: TidskriftsbidragArtikel i vetenskaplig tidskrift

  33. Fundamentals of Computation Theory: 22nd International Symposium, FCT 2019, Copenhagen, Denmark, August 12-14, 2019, Proceedings

    Leszek Gąsieniec (red.), Jesper Jansson (red.) & Christos Levcopoulos (red.), 2019 aug 1, Springer. 365 s. (Lecture Notes in Computer Science; vol. 11651)

    Forskningsoutput: Bok/rapportBok

  34. Approximate counting of K-paths: Deterministic and in polynomial space

    Andreas Björklund, Daniel Lokshtanov, Saket Saurabh & Meirav Zehavi, 2019 jul 1, 46th International Colloquium on Automata, Languages, and Programming, ICALP 2019. Chatzigiannakis, I., Baier, C., Leonardi, S. & Flocchini, P. (red.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Vol. 132. 24

    Forskningsoutput: Kapitel i bok/rapport/Conference proceedingKonferenspaper i proceeding

  35. Solving systems of polynomial equations over GF(2) by a parity-counting self-reduction

    Andreas Björklund, Petteri Kaski & Ryan Williams, 2019 jul 1, 46th International Colloquium on Automata, Languages, and Programming: ICALP 2019. Chatzigiannakis, I., Baier, C., Leonardi, S. & Flocchini, P. (red.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Vol. 132. s. 26:1-26:13 26. (Leibniz International Proceedings in Informatics (LIPIcs)).

    Forskningsoutput: Kapitel i bok/rapport/Conference proceedingKonferenspaper i proceeding

  36. Computing permanents and counting Hamiltonian cycles by listing dissimilar vectors

    Andreas Björklund & Ryan Williams, 2019 jul, 46th International Colloquium on Automata, Languages, and Programming: ICALP 2019. Chatzigiannakis, I., Baier, C., Leonardi, S. & Flocchini, P. (red.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Vol. 132. s. 25:1–25:14 14 s. 25. (Leibniz International Proceedings in Informatics (LIPIcs)).

    Forskningsoutput: Kapitel i bok/rapport/Conference proceedingKonferenspaper i proceeding

  37. A faster hafnian formula for complex matrices and its benchmarking on a supercomputer

    Andreas Björklund, Brajesh Gupt & Nicolás Quesada, 2019 jun, I: ACM Journal of Experimental Algorithmics. 24, 1, 17 s., 1.11.

    Forskningsoutput: TidskriftsbidragArtikel i vetenskaplig tidskrift

  38. Pushing the Online Matrix-Vector Conjecture Off-Line and Identifying Its Easy Cases

    Leszek Gasieniec, Jesper Jansson, Christos Levcopoulos, Andrzej Lingas & Mia Persson, 2019 apr 9, Frontiers in Algorithmics : 13th International Workshop, FAW 2019, Sanya, China, April 29 – May 3, 2019, Proceedings. Springer, s. 156-169 14 s. (Lecture Notes in Computer Science; vol. 11458).

    Forskningsoutput: Kapitel i bok/rapport/Conference proceedingKonferenspaper i proceeding

  39. Importance Sampling of Many Lights on the GPU

    Pierre Moreau & Petrik Clarberg, 2019 mar 18, Ray Tracing Gems. Haines, E. & Akenine-Möller, T. (red.). Apress, s. 255 283 s. 18

    Forskningsoutput: Kapitel i bok/rapport/Conference proceedingKapitel samlingsverk

  40. Multivariate Analysis of Orthogonal Range Searching and Graph Distances

    Karl Bringmann, Thore Husfeldt & Måns Magnusson, 2019 feb 6, 13th International Symposium on Parameterized and Exact Computation, IPEC 2018: August 20-24, 2018, Helsinki, Finland. Paul, C. & Philipczuk, M. (red.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Vol. 115. s. 1–13 13 s. 4. (LIPIcs; vol. 115).

    Forskningsoutput: Kapitel i bok/rapport/Conference proceedingKonferenspaper i proceeding

  41. Preface

    Leszek Antoni Gąsieniec, Jesper Jansson & Christos Levcopoulos, 2019 jan 1, Fundamentals of Computation Theory: International Symposium on Fundamentals of Computation Theory. Vol. 11651 LNCS. s. v-v 1 s. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

    Forskningsoutput: Kapitel i bok/rapport/Conference proceedingFörord till konferenspublikation

  42. Rare Siblings Speed-Up Deterministic Detection and Counting of Small Pattern Graphs

    Mirosław Kowaluk & Andrzej Lingas, 2019 jan 1, Fundamentals of Computation Theory: 22nd International Symposium, FCT 2019, Proceedings. Gąsieniec, L. A., Jansson, J. & Levcopoulos, C. (red.). Springer, Vol. 11651. s. 322-334 13 s. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11651 LNCS).

    Forskningsoutput: Kapitel i bok/rapport/Conference proceedingKonferenspaper i proceeding

  43. A fast deterministic detection of small pattern graphs in graphs without large cliques

    Mirosław Kowaluk & Andrzej Lingas, 2019, I: Theoretical Computer Science. 770, s. 79-87

    Forskningsoutput: TidskriftsbidragArtikel i vetenskaplig tidskrift

  44. Clearing directed subgraphs by mobile agents: Variations on covering with paths

    Dariusz Dereniowski, Andrzej Lingas, Dorota Osula, Mia Persson & Paweł Żyliński, 2019, I: Journal of Computer and System Sciences. 102, s. 57-68

    Forskningsoutput: TidskriftsbidragArtikel i vetenskaplig tidskrift

  45. Dynamic Many-Light Sampling for Real-Time Ray Tracing

    Pierre Moreau, Matt Pharr & Petrik Clarberg, 2019, High-Performance Graphics 2019 - Short Papers. Steinberger, M. & Foley, T. (red.). Eurographics - European Association for Computer Graphics, 6 s.

    Forskningsoutput: Kapitel i bok/rapport/Conference proceedingKonferenspaper i proceeding

  46. Lower bounds for Demorgan circuits of bounded negation width

    Stasys Jukna & Andrzej Lingas, 2019, 36th International Symposium on Theoretical Aspects of Computer Science, STACS 2019. Niedermeier, R. & Paul, C. (red.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 41. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 126).

    Forskningsoutput: Kapitel i bok/rapport/Conference proceedingKonferenspaper i proceeding

  47. On a Fire Fighter’s Problem

    Rolf Klein, Elmar Langetepe, Christos Levcopoulos, Andrzej Lingas & Barbara Schwarzwald, 2019, I: International Journal of Foundations of Computer Science. 30, 02, s. 231-246 16 s.

    Forskningsoutput: TidskriftsbidragArtikel i vetenskaplig tidskrift

  48. Ray Tracing Gems: High-Quality and Real-Time Rendering with DXR and other APIs

    Eric Haines (red.) & Tomas Akenine-Möller (red.), 2019, Apress. 607 s.

    Forskningsoutput: Bok/rapportBok

  49. Shortcuts for the circle

    Sang Won Bae, Mark de Berg, Otfried Cheong, Joachim Gudmundsson & Christos Levcopoulos, 2019, I: Computational Geometry: Theory and Applications. 79, s. 37-54

    Forskningsoutput: TidskriftsbidragArtikel i vetenskaplig tidskrift

  50. The approximability of maximum rooted triplets consistency with fan triplets and forbidden triplets

    Katharina Dannenberg, Jesper Jansson, Andrzej Lingas & Eva Marta Lundell, 2019, I: Discrete Applied Mathematics. 257, s. 101-114

    Forskningsoutput: TidskriftsbidragArtikel i vetenskaplig tidskrift

  51. 2018
  52. MPEG reconfigurable video coding

    Marco Mattavelli, Jorn W. Janneck & Mickaël Raulet, 2018 okt 13, Handbook of Signal Processing Systems. Springer, s. 213-249 37 s.

    Forskningsoutput: Kapitel i bok/rapport/Conference proceedingKapitel samlingsverk

  53. Real-Time Rendering

    Tomas Akenine-Möller, Eric Haines, Naty Hoffman, Angelo Pesce, Michał Iwanicki & Sébastien Hillaire, 2018 aug 1, 4th uppl. Taylor & Francis Inc. 1198 s.

    Forskningsoutput: Bok/rapportBok

  54. Determining the consistency of resolved triplets and fan triplets

    Jesper Jansson, Andrzej Lingas, Ramesh Rajaby & Wing Kin Sung, 2018 jul 1, I: Journal of Computational Biology. 25, 7, s. 740-754 15 s.

    Forskningsoutput: TidskriftsbidragArtikel i vetenskaplig tidskrift

Föregående 1 2 3 4 5 6 7 8 9 Nästa