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
  
• Xiaofan Yang, David J. Evans, Graham M. Megson:
  Maximum induced subgraph of a recursive circulant. 293-298
  
• Ajoy Kumar Datta, Maria Gradinariu, Michel Raynal:
  Stabilizing mobile philosophers. 299-306
  
• Shing-Tsaan Huang, Su-Shen Hung, Chi-Hung Tzeng:
  Self-stabilizing coloration in anonymous planar networks. 307-312
  
• Sebastian Deorowicz:
  Context exhumation after the Burrows-Wheeler transform. 313-320
  
• Gopal Pandurangan:
  On a simple randomized algorithm for finding a 2-factor in sparse graphs. 321-327
  
• Piotr Faliszewski, Janusz Jarosz:
  Properties of uniformly hard languages. 329-332
  

Volume 95, Number 2, 31 July 2005

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

Volume 95, Number 3, 16 August 2005

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

Volume 95, Number 4, 31 August 2005

• Beate Bollig:
  A large lower bound on the query complexity of a simple boolean function. 423-428
  
• 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
  
• Jyh-haw Yeh, Marion Scheepers, Wen-Chen Hu:
  Modifying YCN key assignment scheme to resist the attack from Hwang. 435-440
  
• Behrooz Parhami:
  The Hamiltonicity of swapped (OTIS) networks built of Hamiltonian component networks. 441-445
  
• Salvador Lucas, Claude Marché, José Meseguer:
  Operational termination of conditional term rewriting systems. 446-453
  
• Sophie Pinchinat, Stéphane Riedweg:
  A decidable class of problems for control under partial observation. 454-460
  
• Yaron Ostrovsky-Berman:
  The transportation metric and related problems. 461-465
  
• Justin Colannino, Godfried T. Toussaint:
  An algorithm for computing the restriction scaffold assignment problem in computational biology. 466-471
  

Volume 95, Number 5, 15 September 2005

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

Volume 95, Number 6, 30 September 2005

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

Last update Wed Feb 15 05:35:49 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page