External Links

    Journal: Inf. Comput.

    Volume 187, Issue 2

    155 -- 195Michal Parnas, Dana Ron. Testing metric properties
    196 -- 208Yoram Hirshfeld, Alexander Moshe Rabinovich. Future temporal logic needs infinitely many modalities
    209 -- 245Gennaro Costagliola, Vincenzo Deufemia, Filomena Ferrucci, Carmine Gravino. On regular drawn symbolic picture languages
    246 -- 276Israel Gottlieb, Bojana Obrenic. Controlling the data space of tree structured computations
    277 -- 290Nader H. Bshouty, Jeffrey C. Jackson, Christino Tamon. Uniform-distribution attribute noise learnability
    291 -- 319Jörg Flum, Martin Grohe. Describing parameterized complexity classes

    Volume 187, Issue 1

    1 -- 19Peter V. Homeier, David F. Martin. Secure mechanical verification of mutually recursive procedures
    20 -- 39Lefteris M. Kirousis, Phokion G. Kolaitis. The complexity of minimal satisfiability problems
    40 -- 48Juhani Karhumäki, Leonid P. Lisovik. A simple undecidable problem: the inclusion problem for finite substitutions on ab*c
    49 -- 79Jack H. Lutz. The dimensions of individual strings and sequences
    80 -- 109Dietrich Kuske. Regular sets of infinite message sequence charts
    110 -- 122Takashi Mihara. Splitting information securely with entanglement
    123 -- 153Hubert Comon, Florent Jacquemard. Ground reducibility is EXPTIME-complete
    runs on