[et_pb_section fb_built=”1″ _builder_version=”4.18.0″ custom_padding=”||6px|||” top_divider_style=”wave2″ top_divider_color=”#5390c1″ global_colors_info=”{}”][et_pb_row _builder_version=”4.16″ global_colors_info=”{}”][et_pb_column type=”4_4″ _builder_version=”4.16″ global_colors_info=”{}”][et_pb_text _builder_version=”4.16″ global_colors_info=”{}”]<\/p>\n
[\/et_pb_text][et_pb_divider color=”#e09900″ _builder_version=”4.16″ global_colors_info=”{}”][\/et_pb_divider][\/et_pb_column][\/et_pb_row][et_pb_row column_structure=”2_5,3_5″ _builder_version=”4.27.4″ _module_preset=”default” global_colors_info=”{}”][et_pb_column type=”2_5″ _builder_version=”4.27.4″ _module_preset=”default” global_colors_info=”{}”][et_pb_image src=”https:\/\/easyconferences.eu\/ciac2025\/wp-content\/uploads\/2025\/02\/sfdr.webp” title_text=”sfdr” align=”center” _builder_version=”4.27.4″ _module_preset=”default” global_colors_info=”{}”][\/et_pb_image][\/et_pb_column][et_pb_column type=”3_5″ _builder_version=”4.27.4″ _module_preset=”default” global_colors_info=”{}”][et_pb_text _builder_version=”4.27.4″ _module_preset=”default” global_colors_info=”{}”]<\/p>\n
Department of Computer Science, LTH, Lund University<\/p>\n
[\/et_pb_text][et_pb_text _builder_version=”4.27.4″ _module_preset=”default” global_colors_info=”{}”]<\/p>\n
TITLE: <\/strong>Lower Bounds in Monotone Circuit Complexity<\/p>\n ABSTRACT: <\/strong>Monotone Boolean circuits are circuits that use only AND and OR gates (no NOT gates). In this talk, we will survey both classical results and recent developments\u00a0in monotone circuit complexity. Our focus will be on so-called query-to-communication lifting theorems, which have been instrumental in addressing many open problems in the area. In particular, we will show how these have led to the strongest known\u00a0lower bounds for the clique function. Along the way, we will touch on other recent results and discuss some open questions that remain.\u00a0<\/p>\n [\/et_pb_text][\/et_pb_column][\/et_pb_row][et_pb_row _builder_version=”4.27.4″ _module_preset=”default” global_colors_info=”{}”][et_pb_column type=”4_4″ _builder_version=”4.27.4″ _module_preset=”default” global_colors_info=”{}”][et_pb_divider color=”#E09900″ _builder_version=”4.27.4″ _module_preset=”default” global_colors_info=”{}”][\/et_pb_divider][\/et_pb_column][\/et_pb_row][et_pb_row column_structure=”2_5,3_5″ _builder_version=”4.27.4″ _module_preset=”default” custom_margin=”-5px|auto||auto||” global_colors_info=”{}”][et_pb_column type=”2_5″ _builder_version=”4.27.4″ _module_preset=”default” global_colors_info=”{}”][et_pb_image src=”https:\/\/easyconferences.eu\/ciac2025\/wp-content\/uploads\/2025\/03\/paolo.png” title_text=”paolo” align=”center” _builder_version=”4.27.4″ _module_preset=”default” global_colors_info=”{}”][\/et_pb_image][\/et_pb_column][et_pb_column type=”3_5″ _builder_version=”4.27.4″ _module_preset=”default” global_colors_info=”{}”][et_pb_text _builder_version=”4.27.4″ _module_preset=”default” global_colors_info=”{}”]<\/p>\n Sant’Anna School of Advanced Studies<\/p>\n [\/et_pb_text][et_pb_text _builder_version=”4.27.4″ _module_preset=”default” global_colors_info=”{}”]<\/p>\n TITLE:<\/strong> Learning for Data Compression and Indexing<\/p>\n ABSTRACT:<\/strong> Key-value stores, vector and graph DBs, as well as search engines are posing a continuously growing need to efficiently store, retrieve and analyze massive datasets under the many and different requirements posed by data types, users, devices, and applications. Such a new level of complexity cannot be properly handled by just known techniques, so that academic and industrial researchers started recently to devise new compression and indexing schemes that integrate classic approaches with various kinds of advanced techniques drawn from computational geometry and machine learning. In this talk, I\u2019ll survey the evolution of these algorithmic solutions, discuss their theoretical and experimental performance, highlight their limits and some recent results that are pointing out new challenges worth of future research.<\/p>\n [\/et_pb_text][\/et_pb_column][\/et_pb_row][et_pb_row _builder_version=”4.27.4″ _module_preset=”default” global_colors_info=”{}”][et_pb_column type=”4_4″ _builder_version=”4.27.4″ _module_preset=”default” global_colors_info=”{}”][et_pb_divider color=”#E09900″ _builder_version=”4.27.4″ _module_preset=”default” global_colors_info=”{}”][\/et_pb_divider][\/et_pb_column][\/et_pb_row][et_pb_row column_structure=”2_5,3_5″ _builder_version=”4.27.4″ _module_preset=”default” custom_margin=”6px|auto||auto||” global_colors_info=”{}”][et_pb_column type=”2_5″ _builder_version=”4.27.4″ _module_preset=”default” global_colors_info=”{}”][et_pb_image src=”https:\/\/easyconferences.eu\/ciac2025\/wp-content\/uploads\/2025\/02\/New-Project-3.png” title_text=”New Project (3)” align=”center” _builder_version=”4.27.4″ _module_preset=”default” global_colors_info=”{}”][\/et_pb_image][\/et_pb_column][et_pb_column type=”3_5″ _builder_version=”4.27.4″ _module_preset=”default” global_colors_info=”{}”][et_pb_image _builder_version=”4.27.4″ _module_preset=”default” custom_margin=”||2px|||” global_colors_info=”{}”][\/et_pb_image][et_pb_text _builder_version=”4.27.4″ _module_preset=”default” global_colors_info=”{}”]<\/p>\n Laboratoire d’Informatique, de Mod\u00e9lisation et d’Optimisation des Syst\u00e8mes TITLE:<\/strong> Open problems about the simplex method<\/p>\n ABSTRACT: <\/strong>The simplex method is a very efficient algorithm. In this talk we look at recent attempts to explain this using smoothed analysis. Following that, we discuss to what extent smoothed analysis succeeds at providing a scientific explanation, and discuss what any successor theory much resolve. Along the way I will sprinkle in some historical anecdotes about linear programming and its applications for human rights violations.<\/p>\n [\/et_pb_text][\/et_pb_column][\/et_pb_row][\/et_pb_section]<\/p>\n","protected":false},"excerpt":{"rendered":" Keynote SpeakersSusanna F. de Rezende Department of Computer Science, LTH, Lund UniversityTITLE: Lower Bounds in Monotone Circuit Complexity ABSTRACT: Monotone Boolean circuits are circuits that use only AND and OR gates (no NOT gates). In this talk, we will survey both classical results and recent developments\u00a0in monotone circuit complexity. Our focus will be on so-called […]<\/p>\n","protected":false},"author":2,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"_et_pb_use_builder":"on","_et_pb_old_content":"","_et_gb_content_width":"","footnotes":""},"class_list":["post-18","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/easyconferences.eu\/ciac2025\/wp-json\/wp\/v2\/pages\/18"}],"collection":[{"href":"https:\/\/easyconferences.eu\/ciac2025\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/easyconferences.eu\/ciac2025\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/easyconferences.eu\/ciac2025\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/easyconferences.eu\/ciac2025\/wp-json\/wp\/v2\/comments?post=18"}],"version-history":[{"count":20,"href":"https:\/\/easyconferences.eu\/ciac2025\/wp-json\/wp\/v2\/pages\/18\/revisions"}],"predecessor-version":[{"id":243887,"href":"https:\/\/easyconferences.eu\/ciac2025\/wp-json\/wp\/v2\/pages\/18\/revisions\/243887"}],"wp:attachment":[{"href":"https:\/\/easyconferences.eu\/ciac2025\/wp-json\/wp\/v2\/media?parent=18"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}Paolo Ferragina<\/h3>\n
Sophie Huiberts<\/h3>\n
\nClermont Auvergne University[\/et_pb_text][et_pb_text _builder_version=”4.27.4″ _module_preset=”default” global_colors_info=”{}”]<\/p>\n