Wydział Matematyki i Informatyki UJ - lista publikacji

1-200 z 3450.

2017

3446.
Extending partial representations of trapezoid graphs vol. 10520 of Lecture Notes in Computer Science (2017), "Graph-Theoretic Concepts in Computer Science, 43rd International Workshop, WG 2017, Eindhoven, The Netherlands, June 21-23, 2017, Revised Selected Papers", Springer
3443.
Tight Conditional Lower Bounds for Longest Common Increasing Subsequence, 12TH INTERNATIONAL SYMPOSIUM ON PARAMETERIZED AND EXACT COMPUTATION (IPEC 2017) (2017),
3439.
3433.
On normal products of selfadjoint operators, KYUNGPOOK MATHEMATICAL JOURNAL vol. 57 (2017), 457-471
3427.
Reliability Optimization for Controller Placement in Software-Defined Networks vol. Advances in Intelligent Systems and Computing (2017), "Advances in Dependability Engineering and Complex Systems", Springer
3426.
Power Allocation in Cognitive Radio with Distributed Antenna System, LECTURE NOTES IN COMPUTER SCIENCE vol. vol. 10531 (2017), 745 - 754
3425.
Fuzzy Reinforcement Learning for Routing in Multi-Hop Cognitive Radio Networks, LECTURE NOTES IN COMPUTER SCIENCE vol. vol. 10350 (2017), 118 - 123
3424.
QoS-Based Power Control and Resource Allocation in Cognitive LTE Femtocell Networks vol. Communications in Computer and Information Science (2017), "Computer Networks", Springer
3413.
Split-and-merge Tweak in Cross Entropy Clustering, COMPUTER INFORMATION SYSTEMS AND INDUSTRIAL MANAGEMENT: 16TH IFIP TC8 INTERNATIONAL CONFERENCE (2017), 193 - 204
3398.
Boolean dimension and local dimension, ELECTRONIC NOTES IN DISCRETE MATHEMATICS vol. 61 (2017), 1047-1053
3384.
Coloring curves that cross a fixed curve vol. 77 of Leibniz International Proceedings in Informatics (2017), "33rd International Symposium on Computational Geometry (SoCG 2017)", Schloss Dagstuhl – Leibniz-Zentrum für Informatik
3342.
The Complexity of Minimal Inference Problem for Conservative Constraint Languages, PROCEEDINGS OF THE ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS) (2017),
3341.
Minimal Inference Problem over Finite Domains: The Landscape of Complexity, PROCEDINGS OF THE INTERNATIONAL CONFERENCE ON LOGIC PROGRAMMING AND NONMONOTONIC REASONING (LPNMR) (2017),
3331.
3328.
Absorption in Universal Algebra and CSP, (2017), "The Constraint Satisfaction Problem: Complexity and Approximability", Schloss Dagstuhl – Leibniz-Zentrum für Informatik
3327.
Robust algorithms with polynomial loss for near-unanimity CSPs, PROCEEDINGS OF THE 28TH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS SODA'17 (2017), 340-357
3309.
Lower Bounds for On-line Interval Coloring with Vector and Cardinality Constraints vol. 10139 (Lecture Notes in Computer Science) (2017), "SOFSEM 2017: Current Trends in Theory and Practice of Computer Science, 43rd International Conference, Limerick, Ireland, January 16-20, 2017, Proceedings", Springer
3290.
3286.
Newton-Okounkov bodies sprouting on the valuative tree, RENDICONTI DEL CIRCOLO MATEMATICO DI PALERMO SERIES 2 vol. 66(2) (2017), 159-160
3263.
Variational-Hemivariational Inequalities with Applications vol. Chapman & Hall/CRC Monographs and Research Notes in Mathematics (2017), CRC Press (gałąź Taylor & Francis Group)

2016

3261.
Fast Saddle-Point Algorithm for Generalized Dantzig Selector and FDR Control with Ordered L1-Norm, PROCEEDINGS OF THE 19TH INTERNATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE AND STATISTICS vol. 51 (2016), 780-789
3260.
A remark on Bishop’s multivalued projections, UNIV. IAG. ACTA MATH. vol. 53 (2016), 13-20
3255.
Non-commutative functional calculus in finite type I von Neumann algebras, MATHEMATICAL PROCEEDINGS OF THE ROYAL IRISH ACADEMY vol. 116A (2) (2016), 113-147