News

Andrei Sipoş published the paper Bounds on strong unicity for Chebyshev approximation with bounded coefficients in Mathematische Nachrichten.

Cristian Rusu and Paul Irofti published the paper Efficient and Parallel Separable Dictionary Learning in the Proceedings of the IEEE 27th International Conference on Parallel and Distributed Systems (ICPADS 2021).

Paul Irofti and Florin Stoican published (in collaboration with Luis Romero-Ben and Vicenç Puig) the paper Data-driven Leak Localization in Water Distribution Networks via Dictionary Learning and Graph-based Interpolation on arXiv.

Bogdan Dumitru (University of Bucharest) will give on Thursday, December 16, 2021 at 10:00 the talk SAT Solvers: Introduction and applications in the Logic Seminar.

Alin Ştefănescu (University of Bucharest) will give on Tuesday, December 14, 2021 at 14:00 the talk River: fuzz testing using AI for binaries and IoT in the LOS seminar.

Bogdan Macovei published (in collaboration with Ioana Leuştean) the paper DELP: Dynamic Epistemic Logic for Security Protocols in the Proceedings of the 23rd International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC 2021).

Mihai Adamescu (University of Bucharest) will give on Tuesday, December 7, 2021 at 14:00 the talk Interdisciplinarity and transdisciplinary in the LOS seminar.

Andrei Sipoş will give on Thursday, December 9, 2021 at 10:00 the talk On extracting variable Herbrand disjunctions in the Logic Seminar.

Bogdan Macovei will give on December 8, 2021 at 16:20 the talk DELP: Dynamic Epistemic Logic for Security Protocols (joint work with Ioana Leuştean) at Working Formal Methods Symposium (FROM) 2021, held, in conjunction with SYNASC 2021, on December 8-9, 2021 at Timişoara, Romania.

Răzvan Diaconescu (IMAR) will give on Thursday, December 2, 2021 at 10:00 the talk Experimental Mathematics by Rewriting in the Logic Seminar.

Andrei Sipoş published the preprint On extracting variable Herbrand disjunctions on arXiv.

Traian Şerbănuţă will give on Thursday, November 25, 2021 at 10:00 the talk Consensus in Distributed Systems. Formalizing Correct by Construction Protocols in the Logic Seminar.

Horațiu Cheval will give on Tuesday, November 23, 2021 at 14:00 the talk Quadratic rates of asymptotic regularity for the Tikhonov-Mann iteration in the LOS seminar.

Andrei Popescu (University of Sheffield) will give on Thursday, November 18, 2021 at 10:30 the talk Inductive and Coinductive Reasoning with Isabelle/HOL in the Logic Seminar.

Ruxandra Bălucea will give on Tuesday, November 16, 2021 at 14:00 the talk Low-level Attacks and Software Mitigations on RISC-V in the LOS seminar.

Ionuţ Ţuţu (IMAR) will give on Thursday, November 11, 2021 at 10:00 the talk A Rewriting-based Toolset for Specification Processing in the Logic Seminar.

Andrei Pătraşcu will give on Tuesday, November 9, 2021 at 14:00 the talk Inexact Proximal Point Algorithm for Convex Optimization under Holderian Growth in the LOS seminar.

Paul Irofti will give on Tuesday, November 2, 2021 at 14:00 the talk Anomaly Detection ABC in the LOS seminar.

Andrei Sipoş published the paper A quantitative multiparameter mean ergodic theorem in Pacific Journal of Mathematics.

Bogdan Macovei will give on Thursday, October 28, 2021 at 10:00 the talk DELP: Dynamic Epistemic Logic for Security Protocols in the Logic Seminar.

Mihai Prunescu (University of Bucharest and IMAR) will give on Thursday, October 21, 2021 at 10:00 the talk On Representations of Intended Structures in Foundational Theories in the Logic Seminar.

Andra Băltoiu will give on Tuesday, October 19, 2021 at 14:00 the talk Dictionary Learning Heuristics Control Through Adaptive Strategies and Applications to Anomaly Detection in the LOS seminar.

Andrei Sipoş published the paper Quantitative inconsistent feasibility for averaged mappings in Optimization Letters.

Cristian Rusu published (in collaboration with Lorenzo Rosasco) the paper Constructing fast approximate eigenspaces with application to the fast graph Fourier transforms in IEEE Transactions on Signal Processing.

The NetAlert (SOL4/2021) research grant is implemented in the LOS Research Center.

Andrei Sipoş published the preprint Abstract strongly convergent variants of the proximal point algorithm on arXiv.

Andrei Pătraşcu and Paul Irofti published the preprint Computational complexity of Inexact Proximal Point Algorithm for Convex Optimization under Holderian Growth on arXiv.

Laurențiu Leuștean and Horațiu Cheval published the preprint Quadratic rates of asymptotic regularity for the Tikhonov-Mann iteration on arXiv.

Laurențiu Leuștean will give on Wednesday, June 23, 2021 at 14:00 the talk Proof mining and applications in nonlinear analysis and convex optimization. Part II in the LOS seminar.

Laurențiu Leuștean will give on Tuesday, June 14, 2021 at 14:00 the talk Proof mining and applications in nonlinear analysis and convex optimization in the LOS seminar.

Gabriel Ciobanu (Alexandru Ioan Cuza University of Iași and Romanian Academy (ICS)) will give on Thursday, June 3, 2021 at 10:00 the talk Choice principles and infinities for finitely supported structures in the Logic Seminar.

Andrei Sipoş will give on Tuesday, June 1, 2021 at 14:00 the talk On abstract proximal point algorithms and related concepts in the LOS seminar.

Cătălin Dima (University Paris-Est Créteil) will give on Thursday, May 27, 2021 at 10:00 the talk Rational Synthesis in the Commons with Careless and Careful Agents in the Logic Seminar.

Andrei Pătraşcu will give on Tuesday, May 18, 2021 at 14:00 the talk On complexity of the first-order algorithms for convex optimization. Part II in the LOS seminar.

Andrei Sipoş published the paper Construction of Fixed Points of Asymptotically Nonexpansive Mappings in Uniformly Convex Hyperbolic Spaces in Numerical Functional Analysis and Optimization.

Horațiu Cheval won the second prize in the Master Section of the Student Scientific Communications Session - FMI (UB), organized on May 8, 2021, with the presentation General metatheorems in proof mining.

Bruno Dinis (University of Lisbon) will give on Thursday, May 13, 2021 at 10:00 the talk Functional interpretations for nonstandard arithmetic in the Logic Seminar.

Andrei Pătraşcu will give on Tuesday, May 11, 2021 at 14:00 the talk On complexity of the first-order algorithms for convex optimization in the LOS seminar.

Gabriel Istrate (West University of Timişoara) will give on Thursday, April 22, 2021 at 10:00 the talk Kernelization, Proof Complexity and Social Choice in the Logic Seminar.

Andrei Sipoş published the paper Rates of metastability for iterations on the unit interval in Journal of Mathematical Analysis and Applications.

Cristian Rusu will give on Tuesday, April 20, 2021 at 14:00 the talk Learning orthonormal dictionaries as efficient as the Fast Fourier Transform in the LOS seminar.

Dorel Lucanu (Alexandru Ioan Cuza University of Iaşi) will give on Thursday, April 15, 2021 at 10:00 the talk (Co)Initial (Co)Algebra Semantics in Matching Logic in the Logic Seminar.

Andrei Sipoş published the paper Revisiting jointly firmly nonexpansive families of mappings in Optimization.

Gheorghe Ştefănescu (University of Bucharest) will give on Thursday, April 8, 2021 at 10:00 the talk Adaptive Virtual Organisms: A Compositional Model for Complex Hardware-software Binding in the Logic Seminar.

Florin Stoican will give on Tuesday, April 6, 2021 at 14:00 the talk About the use of B-spline functions in motion planning in the new LOS Seminar.

Laurenţiu Leuştean published (in collaboration with Pedro Pinto) the paper Quantitative results on a Halpern-type proximal point algorithm in Computational Optimization and Applications.

Andrei Pătraşcu and Paul Irofti published the paper Stochastic proximal splitting algorithm for composite minimization in Optimization Letters.

Cristi Rusu and Paul Irofti published the preprint Efficient and Parallel Separable Dictionary Learning on arXiv.

Paul Irofti, together with Bogdan Dumitrescu, received the Grigore Moisil Romanian Academy Award for the book Dictionary Learning Algorithms and Applications published at Springer Nature Group in 2018.

Paul Irofti won the Cybersecurity ANIS Award for the Operating Systems: Design and Security course tought at the Security and Applied Logic master program.

The DDNET (12PD/2020) research grant is implemented in the LOS Research Center.

The Graphomaly (287PED/2020) research grant is implemented in the LOS Research Center.

Andrei Pătraşcu and Paul Irofti published the preprint Stochastic proximal splitting for composite minimizationon on arXiv.