Authors: Emdin, Gregory^{Aff1, IDs0022402410168w_cor1}, Kulikov, Alexander S., Mihajlin, Ivan, Slezkin, Nikita

Superior Title: Theory of Computing Systems. :1-21

Authors: Belova, Tatiana, Chukhin, Nikolai, Kulikov, Alexander S., Mihajlin, Ivan

Subject Terms: Computational Complexity cs.CC, Data Structures and Algorithms cs.DS, FOS Computer and information sciences

Availability: https://doi.org/10.48550/arxiv.2402.13170
https://arxiv.org/abs/2402.13170

Authors: Belova, Tatiana, Kulikov, Alexander S., Mihajlin, Ivan, Ratseeva, Olga, Reznikov, Grigory, Sharipov, Denil

Subject Terms: Computer Science - Computational Complexity

Relation: http://arxiv.org/abs/2307.11444

Availability: http://arxiv.org/abs/2307.11444

Authors: Emdin, Gregory, Kulikov, Alexander S., Mihajlin, Ivan, Slezkin, Nikita

Subject Terms: encoding, parity, lower bounds, circuits, CNF, Theory of computation → Complexity theory and logic, Theory of computation → Circuit complexity

File Description: application/pdf

Relation: https://eccc.weizmann.ac.il/report/2017/092; http://cjtcs.cs.uchicago.edu/articles/1999/11/contents.html; https://dx.doi.org/10.4230/LIPIcs.MFCS.2022; https://dx.doi.org/10.1137/060664537; https://dx.doi.org/10.1145/235767.235769; https://dx.doi.org/10.1007/978-3-642-24508-4; https://dx.doi.org/10.1016/j.tcs.2018.09.003; https://dx.doi.org/10.1007/978-3-319-21398-9_23; https://dx.doi.org/10.1016/S0166-218X(02)00410-9; https://dx.doi.org/10.3233/978-1-58603-929-5-75; https://dx.doi.org/10.1007/11564751_73; https://dx.doi.org/10.1007/3-540-08353-7_135

Availability: https://doi.org/10.4230/lipics.mfcs.2022.4710.4230/LIPIcs.MFCS.202210.1137/06066453710.1145/235767.23576910.1007/978-3-642-24508-410.1016/j.tcs.2018.09.00310.1007/978-3-319-21398-9_2310.1016/S0166-218X(02)00410-910.3233/978-1-58603-929-5-7510.1007/11564751_7310.1007/3-540-08353-7_135

Authors: Ignatiev, Artur, Mihajlin, Ivan, Smal, Alexander

Subject Terms: communication complexity, circuit complexity, Karchmer-Wigderson games, Theory of computation → Circuit complexity

File Description: application/pdf

Relation: https://eccc.weizmann.ac.il/report/2022/016; https://dx.doi.org/10.4230/LIPIcs.ISAAC.2022; https://dx.doi.org/10.1007/978-3-030-67731-2_17; https://dx.doi.org/10.4230/LIPIcs.CCC.2016.3; https://dx.doi.org/10.1007/s00037-001-8195-x; https://dx.doi.org/10.1109/FOCS.2016.19; https://dx.doi.org/10.1007/s000370100001; https://dx.doi.org/10.1137/15M1018319; https://dx.doi.org/10.1137/S0097539794261556; https://dx.doi.org/10.1090/dimacs/013/07; https://dx.doi.org/10.4230/LIPIcs.ISAAC.2018.10; https://dx.doi.org/10.1007/3-540-45687-2_29; https://dx.doi.org/10.1007/978-3-642-24508-4; https://dx.doi.org/10.1007/BF01206317; https://dx.doi.org/10.1145/62212.62265; https://dx.doi.org/10.4230/LIPIcs.CCC.2021.38

Availability: https://doi.org/10.4230/lipics.isaac.2022.6610.4230/LIPIcs.ISAAC.202210.1007/978-3-030-67731-2_1710.4230/LIPIcs.CCC.2016.310.1007/s00037-001-8195-x10.1109/FOCS.2016.1910.1007/s00037010000110.1137/15M101831910.1137/S009753979426155610.1090/dimacs/013/0710.4230/LIPIcs.ISAAC.2018.1010.1007/3-540-45687-2_2910.1007/978-3-642-24508-410.1007/BF0120631710.1145/62212.6226510.4230/LIPIcs.CCC.2021.38

Authors: Mihajlin, Ivan, Sofronova, Anastasia

Subject Terms: formula complexity, communication complexity, Karchmer-Raz-Wigderson conjecture, De Morgan formulas, Theory of computation → Circuit complexity

File Description: application/pdf

Relation: https://eccc.weizmann.ac.il/report/2022/033/; https://dx.doi.org/10.4230/LIPIcs.CCC.2022; https://dx.doi.org/10.1109/FOCS46700.2020.00013; https://dx.doi.org/10.4230/LIPIcs.CCC.2016.3; https://dx.doi.org/10.1007/s00037-001-8195-x; https://dx.doi.org/10.1137/15M1018319; https://dx.doi.org/10.1137/S0097539794261556; https://dx.doi.org/10.1090/dimacs/013/07; https://dx.doi.org/10.1007/BF01206317; https://dx.doi.org/10.1145/62212.62265; https://dx.doi.org/10.4230/LIPIcs.APPROX-RANDOM.2018.48; https://dx.doi.org/10.4230/LIPIcs.CCC.2021.38; https://dx.doi.org/10.1109/SFCS.1991.185385; https://dx.doi.org/10.1002/sapm194221183; https://dx.doi.org/10.1109/FOCS.2014.65

Availability: https://doi.org/10.4230/lipics.ccc.2022.1310.4230/LIPIcs.CCC.202210.1109/FOCS46700.2020.0001310.4230/LIPIcs.CCC.2016.310.1007/s00037-001-8195-x10.1137/15M101831910.1137/S009753979426155610.1090/dimacs/013/0710.1007/BF0120631710.1145/62212.6226510.4230/LIPIcs.APPROX-RANDOM.2018.4810.4230/LIPIcs.CCC.2021.3810.1109/SFCS.1991.18538510.1002/sapm19422118310.1109/FOCS.2014.65

Authors: Belova, Tatiana, Golovnev, Alexander, Kulikov, Alexander S., Mihajlin, Ivan, Sharipov, Denil

Subject Terms: Computer Science - Computational Complexity, Computer Science - Data Structures and Algorithms

Relation: http://arxiv.org/abs/2205.07709

Availability: http://arxiv.org/abs/2205.07709

Authors: Cygan, Marek, Kulikov, Alexander S., Mihajlin, Ivan, Nikolaev, Maksim, Reznikov, Grigory

Subject Terms: similarity measure, string distance, exact algorithms, upper bounds, lower bounds, Theory of computation → Parameterized complexity and exact algorithms, Theory of computation → Algorithm design techniques

File Description: application/pdf

Relation: http://www.combinatorics.org/Volume_12/Abstracts/v12i1r50.html; http://dl.acm.org/citation.cfm?id=314500.315093; http://www.combinatorics.org/Volume_14/Abstracts/v14i1r50.html; https://dx.doi.org/10.4230/LIPIcs.ESA.2021; https://dx.doi.org/10.1137/070683933; https://dx.doi.org/10.1007/978-3-642-40453-5_19; https://dx.doi.org/10.1137/1.9781611973402.8; https://dx.doi.org/10.1145/1103963.1103971; https://dx.doi.org/10.1145/1219944.1219947; https://dx.doi.org/10.1007/978-3-540-87361-7_8; https://dx.doi.org/10.1007/978-3-642-22616-8_24; https://dx.doi.org/10.1016/j.tcs.2014.05.006; https://dx.doi.org/10.1145/2847419; https://dx.doi.org/10.1007/s10878-010-9370-2; https://dx.doi.org/10.1016/j.ipl.2005.08.010; https://dx.doi.org/10.1016/j.ipl.2005.11.013; https://dx.doi.org/10.1016/j.jda.2005.01.010; https://dx.doi.org/10.1016/j.tcs.2005.09.023

Availability: https://doi.org/10.4230/lipics.esa.2021.3510.4230/LIPIcs.ESA.202110.1137/07068393310.1007/978-3-642-40453-5_1910.1137/1.9781611973402.810.1145/1103963.110397110.1145/1219944.121994710.1007/978-3-540-87361-7_810.1007/978-3-642-22616-8_2410.1016/j.tcs.2014.05.00610.1145/284741910.1007/s10878-010-9370-210.1016/j.ipl.2005.08.01010.1016/j.ipl.2005.11.01310.1016/j.jda.2005.01.01010.1016/j.tcs.2005.09.023

Authors: Mihajlin, Ivan, Smal, Alexander

Subject Terms: communication complexity, KRW conjecture, circuit complexity, half-duplex communication complexity, Karchmer-Wigderson games, multiplexer relation, universal relation, Theory of computation → Circuit complexity

File Description: application/pdf

Relation: https://eccc.weizmann.ac.il/report/2020/116/; https://eccc.weizmann.ac.il/report/2018/089; https://dx.doi.org/10.4230/LIPIcs.CCC.2021; https://dx.doi.org/10.1109/FOCS46700.2020.00013; https://dx.doi.org/10.1007/978-3-030-67731-2_17; https://dx.doi.org/10.1007/s00037-017-0159-x; https://dx.doi.org/10.1007/s00037-001-8195-x; https://dx.doi.org/10.1137/15M1018319; https://dx.doi.org/10.1137/S0097539794261556; https://dx.doi.org/10.1090/dimacs/013/07; https://dx.doi.org/10.4230/LIPIcs.ISAAC.2018.10; https://dx.doi.org/10.1007/BF01206317; https://dx.doi.org/10.1145/62212.62265; https://dx.doi.org/10.4230/LIPIcs.APPROX-RANDOM.2018.48; https://dx.doi.org/10.1007/s00037-020-00194-8; https://dx.doi.org/10.1109/FOCS.2014.65

Availability: https://doi.org/10.4230/lipics.ccc.2021.3810.4230/LIPIcs.CCC.202110.1109/FOCS46700.2020.0001310.1007/978-3-030-67731-2_1710.1007/s00037-017-0159-x10.1007/s00037-001-8195-x10.1137/15M101831910.1137/S009753979426155610.1090/dimacs/013/0710.4230/LIPIcs.ISAAC.2018.1010.1007/BF0120631710.1145/62212.6226510.4230/LIPIcs.APPROX-RANDOM.2018.4810.1007/s00037-020-00194-810.1109/FOCS.2014.65

Authors: Fomin, Fedor V., Lokshtanov, Daniel, Mihajlin, Ivan, Saurabh, Saket, Zehavi, Meirav

Subject Terms: Hadwiger Number, Exponential-Time Hypothesis, Exact Algorithms, Edge Contraction Problems, Theory of computation → Design and analysis of algorithms

File Description: application/pdf

Relation: https://dx.doi.org/10.4230/LIPIcs.ICALP.2020; https://dx.doi.org/10.1137/110839229; https://dx.doi.org/10.1016/S0195-6698(80)80001-1; https://dx.doi.org/10.1016/j.ic.2005.05.001; https://dx.doi.org/10.1145/3051094; https://dx.doi.org/10.1016/j.jda.2008.10.003

Availability: https://doi.org/10.4230/lipics.icalp.2020.4910.4230/LIPIcs.ICALP.202010.1137/11083922910.1016/S0195-6698(80)80001-110.1016/j.ic.2005.05.00110.1145/305109410.1016/j.jda.2008.10.003

Authors: Golovnev, Alexander, Kulikov, Alexander S., Logunov, Alexander, Mihajlin, Ivan, Nikolaev, Maksim

Subject Terms: superstring, shortest common superstring, approximation, greedy algorithms, greedy conjecture, Theory of computation → Design and analysis of algorithms, Theory of computation → Approximation algorithms analysis

File Description: application/pdf

Relation: https://github.com/alexanderskulikov/greedy-superstring-conjecture; http://compsciclub.ru/scs/; https://dx.doi.org/10.4230/LIPIcs.APPROX-RANDOM.2019

Availability: https://doi.org/10.4230/lipics.approx-random.2019.2610.4230/LIPIcs.APPROX-RANDOM.2019

Authors: Fomin, Fedor V.^{Aff17, Aff19}, Golovnev, Alexander^{Aff18, Aff19}, Kulikov, Alexander S.^Aff19, Mihajlin, Ivan^{Aff19, Aff20}

Contributors: Hutchison, David, Series editor^Aff1, Kanade, Takeo, Series editor^Aff2, Kittler, Josef, Series editor^Aff3, Kleinberg, Jon M., Series editor^Aff4, Mattern, Friedemann, Series editor^Aff5, Mitchell, John C., Series editor^Aff6, Naor, Moni, Series editor^Aff7, Pandu Rangan, C., Series editor^Aff8, Steffen, Bernhard, Series editor^Aff9, Terzopoulos, Demetri, Series editor^Aff10, Tygar, Doug, Series editor^Aff11, Weikum, Gerhard, Series editor^Aff12, Halldórsson, Magnús M., editor^Aff13, Iwama, Kazuo, editor^Aff14, Kobayashi, Naoki, editor^Aff15, Speckmann, Bettina, editor^Aff16

Superior Title: Automata, Languages, and Programming : 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part I. 9134:481-493

Authors: Carmosino, Marco L., Impagliazzo, Russell, Lovett, Shachar, Mihajlin, Ivan

Subject Terms: arithmetic circuits, hardness amplification, circuit lower bounds, non-commutative computation

File Description: application/pdf

Relation: http://eccc.hpi-web.de/report/2010/040; https://dx.doi.org/10.4230/LIPIcs.CCC.2018; https://dx.doi.org/10.1145/3055399.3055442; https://dx.doi.org/10.1145/2956230; https://dx.doi.org/10.1145/800135.804419

Availability: https://doi.org/10.4230/lipics.ccc.2018.1210.4230/LIPIcs.CCC.201810.1145/3055399.305544210.1145/295623010.1145/800135.804419

Authors: Hoover, Kenneth, Impagliazzo, Russell, Mihajlin, Ivan, Smal, Alexander V.

Subject Terms: communication complexity, half-duplex channel, information theory

File Description: application/pdf

Relation: https://eccc.weizmann.ac.il/report/2018/089; https://eccc.weizmann.ac.il/report/2017/093; http://dimacs.rutgers.edu/Volumes/Vol13.html; https://dx.doi.org/10.4230/LIPIcs.ISAAC.2018; https://dx.doi.org/10.1007/s00037-001-8195-x; https://dx.doi.org/10.1137/15M1018319; https://dx.doi.org/10.1007/BF01206317; https://dx.doi.org/10.1145/62212.62265; https://dx.doi.org/10.1145/800135.804414

Availability: https://doi.org/10.4230/lipics.isaac.2018.1010.4230/LIPIcs.ISAAC.201810.1007/s00037-001-8195-x10.1137/15M101831910.1007/BF0120631710.1145/62212.6226510.1145/800135.804414

Authors: Golovnev, Alexander^Aff19, Kulikov, Alexander S.^Aff20, Mihajlin, Ivan^{Aff20, Aff21}

Contributors: Hutchison, David, editor^Aff1, Kanade, Takeo, editor^Aff2, Kittler, Josef, editor^Aff3, Kleinberg, Jon M., editor^Aff4, Kobsa, Alfred, editor^Aff5, Mattern, Friedemann, editor^Aff6, Mitchell, John C., editor^Aff7, Naor, Moni, editor^Aff8, Nierstrasz, Oscar, editor^Aff9, Pandu Rangan, C., editor^Aff10, Steffen, Bernhard, editor^Aff11, Terzopoulos, Demetri, editor^Aff12, Tygar, Doug, editor^Aff13, Weikum, Gerhard, editor^Aff14, Esparza, Javier, editor^Aff15, Fraigniaud, Pierre, editor^Aff16, Husfeldt, Thore, editor^Aff17, Koutsoupias, Elias, editor^Aff18

Superior Title: Automata, Languages, and Programming : 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part I. 8572:551-562

Authors: Golovnev, Alexander^Aff18, Kulikov, Alexander S.^{Aff19, Aff20}, Mihajlin, Ivan^Aff21

Contributors: Hutchison, David, editor^Aff1, Kanade, Takeo, editor^Aff2, Kittler, Josef, editor^Aff3, Kleinberg, Jon M., editor^Aff4, Mattern, Friedemann, editor^Aff5, Mitchell, John C., editor^Aff6, Naor, Moni, editor^Aff7, Nierstrasz, Oscar, editor^Aff8, Pandu Rangan, C., editor^Aff9, Steffen, Bernhard, editor^Aff10, Sudan, Madhu, editor^Aff11, Terzopoulos, Demetri, editor^Aff12, Tygar, Doug, editor^Aff13, Vardi, Moshe Y., editor^Aff14, Weikum, Gerhard, editor^Aff15, Chatterjee, Krishnendu, editor^Aff16, Sgall, Jirí, editor^Aff17

Superior Title: Mathematical Foundations of Computer Science 2013 : 38th International Symposium, MFCS 2013, Klosterneuburg, Austria, August 26-30, 2013. Proceedings. 8087:480-491

Authors: Golovnev, Alexander^Aff18, Kulikov, Alexander S.^{Aff19, Aff20}, Mihajlin, Ivan^Aff21

Contributors: Hutchison, David, editor^Aff1, Kanade, Takeo, editor^Aff2, Kittler, Josef, editor^Aff3, Kleinberg, Jon M., editor^Aff4, Mattern, Friedemann, editor^Aff5, Mitchell, John C., editor^Aff6, Naor, Moni, editor^Aff7, Nierstrasz, Oscar, editor^Aff8, Pandu Rangan, C., editor^Aff9, Steffen, Bernhard, editor^Aff10, Sudan, Madhu, editor^Aff11, Terzopoulos, Demetri, editor^Aff12, Tygar, Doug, editor^Aff13, Vardi, Moshe Y., editor^Aff14, Weikum, Gerhard, editor^Aff15, Fischer, Johannes, editor^Aff16, Sanders, Peter, editor^Aff17

Superior Title: Combinatorial Pattern Matching : 24th Annual Symposium, CPM 2013, Bad Herrenalb, Germany, June 17-19, 2013. Proceedings. 7922:120-129

Authors: Carmosino, Marco L, Impagliazzo, Russell, Lovett, Shachar, Mihajlin, Ivan

Subject Terms: arithmetic circuits, hardness amplification, circuit lower bounds, non-commutative computation, Information and computing sciences

Relation: qt1vn690ss; https://escholarship.org/uc/item/1vn690ss

Availability: https://escholarship.org/uc/item/1vn690ss

Authors: Golovnev, Alexander, Kulikov, Alexander S., Logunov, Alexander, Mihajlin, Ivan, Nikolaev, Maksim

Subject Terms: Computer Science - Data Structures and Algorithms

Relation: http://arxiv.org/abs/1809.08669

Availability: http://arxiv.org/abs/1809.08669

Authors: Kulikov, Alexander S.^{Aff19, Aff20}, Melanich, Olga^Aff19, Mihajlin, Ivan^Aff21

Contributors: Hutchison, David, editor^Aff1, Kanade, Takeo, editor^Aff2, Kittler, Josef, editor^Aff3, Kleinberg, Jon M., editor^Aff4, Mattern, Friedemann, editor^Aff5, Mitchell, John C., editor^Aff6, Naor, Moni, editor^Aff7, Nierstrasz, Oscar, editor^Aff8, Pandu Rangan, C., editor^Aff9, Steffen, Bernhard, editor^Aff10, Sudan, Madhu, editor^Aff11, Terzopoulos, Demetri, editor^Aff12, Tygar, Doug, editor^Aff13, Vardi, Moshe Y., editor^Aff14, Weikum, Gerhard, editor^Aff15, Cooper, S. Barry, editor^Aff16, Dawar, Anuj, editor^Aff17, Löwe, Benedikt, editor^Aff18

Superior Title: How the World Computes : Turing Centenary Conference and 8th Conference on Computability in Europe, CiE 2012, Cambridge, UK, June 18-23, 2012. Proceedings. 7318:432-439