default search action
BibTeX records: Malika More
@inproceedings{DBLP:conf/wise/Journault0MPR20, author = {Matthieu Journault and Pascal Lafourcade and Malika More and R{\'{e}}my Poulain and L{\'{e}}o Robert}, editor = {Lynette Drevin and Sun{\'{e}} von Solms and Marianthi Theocharidou}, title = {How to Teach the Undecidability of Malware Detection Problem and Halting Problem}, booktitle = {Information Security Education. Information Security in Action - 13th {IFIP} {WG} 11.8 World Conference, {WISE} 13, Maribor, Slovenia, September 21-23, 2020, Proceedings}, series = {{IFIP} Advances in Information and Communication Technology}, volume = {579}, pages = {159--169}, publisher = {Springer}, year = {2020}, url = {https://doi.org/10.1007/978-3-030-59291-2\_11}, doi = {10.1007/978-3-030-59291-2\_11}, timestamp = {Thu, 17 Sep 2020 15:00:52 +0200}, biburl = {https://dblp.org/rec/conf/wise/Journault0MPR20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cryptologia/BultelDLM17, author = {Xavier Bultel and Jannik Dreier and Pascal Lafourcade and Malika More}, title = {How to explain modern security concepts to your children}, journal = {Cryptologia}, volume = {41}, number = {5}, pages = {422--447}, year = {2017}, url = {https://doi.org/10.1080/01611194.2016.1238422}, doi = {10.1080/01611194.2016.1238422}, timestamp = {Mon, 16 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/cryptologia/BultelDLM17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/bsl/DurandJMM12, author = {Arnaud Durand and Neil D. Jones and Johann A. Makowsky and Malika More}, title = {Fifty years of the spectrum problem: survey and new results}, journal = {Bull. Symb. Log.}, volume = {18}, number = {4}, pages = {505--553}, year = {2012}, url = {https://doi.org/10.2178/bsl.1804020}, doi = {10.2178/BSL.1804020}, timestamp = {Fri, 03 Jul 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/bsl/DurandJMM12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/sigact/DurandLM07, author = {Arnaud Durand and Clemens Lautemann and Malika More}, title = {A simple proof of the polylog counting ability of first-order logic: guest column}, journal = {{SIGACT} News}, volume = {38}, number = {4}, pages = {40--45}, year = {2007}, url = {https://doi.org/10.1145/1345189.1345199}, doi = {10.1145/1345189.1345199}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/sigact/DurandLM07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mlq/ChateauM06, author = {Annie Chateau and Malika More}, title = {The ultra-weak Ash conjecture and some particular cases}, journal = {Math. Log. Q.}, volume = {52}, number = {1}, pages = {4--13}, year = {2006}, url = {https://doi.org/10.1002/malq.200510010}, doi = {10.1002/MALQ.200510010}, timestamp = {Wed, 17 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mlq/ChateauM06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/dagstuhl/DurandLM06, author = {Arnaud Durand and Clemens Lautemann and Malika More}, editor = {Thomas Schwentick and Denis Th{\'{e}}rien and Heribert Vollmer}, title = {Counting Results in Weak Formalisms}, booktitle = {Circuits, Logic, and Games, 08.11. - 10.11.2006}, series = {Dagstuhl Seminar Proceedings}, volume = {06451}, publisher = {Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany}, year = {2006}, url = {http://drops.dagstuhl.de/opus/volltexte/2007/976}, timestamp = {Thu, 10 Jun 2021 13:02:03 +0200}, biburl = {https://dblp.org/rec/conf/dagstuhl/DurandLM06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/CegielskiM04, author = {Patrick C{\'{e}}gielski and Malika More}, title = {Foreword}, journal = {Theor. Comput. Sci.}, volume = {322}, number = {1}, pages = {1--3}, year = {2004}, url = {https://doi.org/10.1016/j.tcs.2004.03.021}, doi = {10.1016/J.TCS.2004.03.021}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/CegielskiM04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/DurandM02, author = {Arnaud Durand and Malika More}, title = {Nonerasing, Counting, and Majority over the Linear Time Hierarchy}, journal = {Inf. Comput.}, volume = {174}, number = {2}, pages = {132--142}, year = {2002}, url = {https://doi.org/10.1006/inco.2001.3084}, doi = {10.1006/INCO.2001.3084}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/DurandM02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/MalgouyresM02, author = {R{\'{e}}my Malgouyres and Malika More}, title = {On the computational complexity of reachability in 2D binary images and some basic problems of 2D digital topology}, journal = {Theor. Comput. Sci.}, volume = {283}, number = {1}, pages = {67--108}, year = {2002}, url = {https://doi.org/10.1016/S0304-3975(01)00054-8}, doi = {10.1016/S0304-3975(01)00054-8}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/MalgouyresM02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/EsbelinM98, author = {Henri{-}Alex Esbelin and Malika More}, title = {Rudimentary Relations and Primitive Recursion: {A} Toolbox}, journal = {Theor. Comput. Sci.}, volume = {193}, number = {1-2}, pages = {129--148}, year = {1998}, url = {https://doi.org/10.1016/S0304-3975(97)00002-9}, doi = {10.1016/S0304-3975(97)00002-9}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/EsbelinM98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/logcom/CreignouM97, author = {Nadia Creignou and Malika More}, title = {Complexity of Satisfiability Problems with Symmetric Polynomial Clauses}, journal = {J. Log. Comput.}, volume = {7}, number = {3}, pages = {353--366}, year = {1997}, url = {https://doi.org/10.1093/logcom/7.3.353}, doi = {10.1093/LOGCOM/7.3.353}, timestamp = {Wed, 17 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/logcom/CreignouM97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mlq/MoreO97, author = {Malika More and Fr{\'{e}}d{\'{e}}ric Olive}, title = {Rudimentary Languages and Second Order Logic}, journal = {Math. Log. Q.}, volume = {43}, pages = {419--426}, year = {1997}, url = {https://doi.org/10.1002/malq.19970430315}, doi = {10.1002/MALQ.19970430315}, timestamp = {Wed, 17 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mlq/MoreO97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/More94, author = {Malika More}, title = {Investigation of Binary Spectra by Explicit Polynomial Transformations of Graphs}, journal = {Theor. Comput. Sci.}, volume = {124}, number = {2}, pages = {221--272}, year = {1994}, url = {https://doi.org/10.1016/0304-3975(92)00018-M}, doi = {10.1016/0304-3975(92)00018-M}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/More94.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.