Information Processing Letters, Volume 95

Volume 95, Number 1, 16 July 2005

Kimmo Fredriksson:
Exploiting distance coherence to speed up range queries in metric indexes. 287-292
Electronic Edition (link) BibTeX
Xiaofan Yang, David J. Evans, Graham M. Megson:
Maximum induced subgraph of a recursive circulant. 293-298
Electronic Edition (link) BibTeX
Ajoy Kumar Datta, Maria Gradinariu, Michel Raynal:
Stabilizing mobile philosophers. 299-306
Electronic Edition (link) BibTeX
Shing-Tsaan Huang, Su-Shen Hung, Chi-Hung Tzeng:
Self-stabilizing coloration in anonymous planar networks. 307-312
Electronic Edition (link) BibTeX
Sebastian Deorowicz:
Context exhumation after the Burrows-Wheeler transform. 313-320
Electronic Edition (link) BibTeX
Gopal Pandurangan:
On a simple randomized algorithm for finding a 2-factor in sparse graphs. 321-327
Electronic Edition (link) BibTeX
Piotr Faliszewski, Janusz Jarosz:
Properties of uniformly hard languages. 329-332
Electronic Edition (link) BibTeX

Zhi-Zhong Chen, Yuusuke Okamoto, Lusheng Wang:
Improved deterministic approximation algorithms for Max TSP. 333-342
Electronic Edition (link) BibTeX
Srdjan Petrovic:
Space-efficient FCFS group mutual exclusion. 343-350
Electronic Edition (link) BibTeX
Savio S. H. Tse:
A short note on the lower bound of dilation for O(logn)-label interval routing. 351-353
Electronic Edition (link) BibTeX
Gudmund Skovbjerg Frandsen, Peter Bro Miltersen:
Reviewing bounds on the circuit size of the hardest functions. 354-357
Electronic Edition (link) BibTeX
Guy Even, Dror Rawitz, Shimon Shahar:
Hitting sets when the VC-dimension is small. 358-362
Electronic Edition (link) BibTeX
Linh Anh Nguyen, Rajeev Goré:
Completeness of hyper-resolution via the semantics of disjunctive logic programs. 363-369
Electronic Edition (link) BibTeX
Jeff Abrahamson, Ali Shokoufandeh, Pawel Winter:
Euclidean TSP between two nested convex obstacles. 370-375
Electronic Edition (link) BibTeX

John M. Hitchcock, Aduri Pavan:
Resource-bounded strong dimension versus resource-bounded category. 377-381
Electronic Edition (link) BibTeX
Qingmin Shi, Joseph JáJá:
Optimal and near-optimal algorithms for generalized intersection reporting on pointer machines. 382-388
Electronic Edition (link) BibTeX
Bodo Manthey:
Non-approximability of weighted multiple sequence alignment for arbitrary metrics. 389-395
Electronic Edition (link) BibTeX
Benedek Nagy:
On the language equivalence of NE star-patterns. 396-400
Electronic Edition (link) BibTeX
Jean Goubault-Larrecq:
Deciding H₁ by resolution. 401-408
Electronic Edition (link) BibTeX
Lu Xiao, Howard M. Heys:
A simple power analysis attack against the key schedule of the Camellia block cipher. 409-412
Electronic Edition (link) BibTeX
Kishan Chand Gupta, Palash Sarkar:
Construction of high degree resilient S-boxes with improved nonlinearity. 413-417
Electronic Edition (link) BibTeX
Travis Gagie:
Restructuring binary search trees revisited. 418-421
Electronic Edition (link) BibTeX

Beate Bollig:
A large lower bound on the query complexity of a simple boolean function. 423-428
Electronic Edition (link) BibTeX
Camino Balbuena, Martín Cera, Ana Diánez, Pedro García-Vázquez, Xavier Marcote:
Sufficient conditions for lambda^'-optimality of graphs with small conditional diameter. 429-434
Electronic Edition (link) BibTeX
Jyh-haw Yeh, Marion Scheepers, Wen-Chen Hu:
Modifying YCN key assignment scheme to resist the attack from Hwang. 435-440
Electronic Edition (link) BibTeX
Behrooz Parhami:
The Hamiltonicity of swapped (OTIS) networks built of Hamiltonian component networks. 441-445
Electronic Edition (link) BibTeX
Salvador Lucas, Claude Marché, José Meseguer:
Operational termination of conditional term rewriting systems. 446-453
Electronic Edition (link) BibTeX
Sophie Pinchinat, Stéphane Riedweg:
A decidable class of problems for control under partial observation. 454-460
Electronic Edition (link) BibTeX
Yaron Ostrovsky-Berman:
The transportation metric and related problems. 461-465
Electronic Edition (link) BibTeX
Justin Colannino, Godfried T. Toussaint:
An algorithm for computing the restriction scaffold assignment problem in computational biology. 466-471
Electronic Edition (link) BibTeX

Bruno Blanchet:
Security protocols: from linear to classical logic by abstract interpretation. 473-479
Electronic Edition (link) BibTeX
Kyung-Sub Min, Hyoung-Joo Kim:
A path-based node filtering method for efficient structural joins^,. 480-486
Electronic Edition (link) BibTeX
Maurice H. ter Beek, Jetty Kleijn:
Modularity for teams of I/O automata. 487-495
Electronic Edition (link) BibTeX
Ian F. Blake, V. Kumar Murty, Guangwu Xu:
A note on window tau-NAF algorithm. 496-502
Electronic Edition (link) BibTeX
Kengo Katayama, Akihiro Hamamoto, Hiroyuki Narihisa:
An effective local search for the maximum clique problem. 503-511
Electronic Edition (link) BibTeX
Abraham P. Punnen, Olena Chapovska:
The bottleneck k-MST. 512-517
Electronic Edition (link) BibTeX

Applications of Spiking Neural Networks

Sander M. Bohte, Joost N. Kok:
Applications of spiking neural networks. 519-520
Electronic Edition (link) BibTeX
David Verstraeten, Benjamin Schrauwen, Dirk Stroobandt, Jan Van Campenhout:
Isolated word recognition with the Liquid State Machine: a case study. 521-528
Electronic Edition (link) BibTeX
Carl O'Dwyer, Daniel Richardson:
Spiking neural nets with symbolic internal state. 529-536
Electronic Edition (link) BibTeX
Andreas Knoblauch:
Neural associative memory for brain modeling and information retrieval. 537-544
Electronic Edition (link) BibTeX
Nicolangelo Iannella, Lars Kindermann:
Finding iterative roots with a spiking neural network. 545-551
Electronic Edition (link) BibTeX
Olaf Booij, Hieu Tat Nguyen:
A gradient descent rule for spiking neurons emitting multiple spikes. 552-558
Electronic Edition (link) BibTeX