default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation Processing Letters, Volume 113
Volume 113, Numbers 1-2, January 2013
- Andreas Björklund, Petteri Kaski:
Counting closed trails. 1-3 - Vincenzo Bonifaci
:
Physarum can compute shortest paths: A short proof. 4-7 - Yiguang Liu, Stan Z. Li, Wei Wu, Ronggang Huang:
Dynamics of a mean-shift-like algorithm and its applications on clustering. 8-16 - Jean-Luc Baril:
Statistics-preserving bijections between classical and cyclic permutations. 17-22 - Adam Kasperski, Adam Kurpisz, Pawel Zielinski:
Approximating the min-max (regret) selecting items problem. 23-29 - Xiangqian Zhou, Bing Yao, Xiangen Chen:
Every lobster is odd-elegant. 30-33 - Michal Zawidzki, Renate A. Schmidt, Dmitry Tishkovsky:
Satisfiability problem for modal logic with global counting operators coded in binary is NExpTime-complete. 34-38 - Stavros G. Kolliopoulos, Yannis Moysoglou:
The 2-valued case of makespan minimization with assignment constraints. 39-43 - Yang Gao, Ming Xu, Naijun Zhan, Lijun Zhang:
Model checking conditional CSL for continuous-time Markov chains. 44-50
Volume 113, Number 3, February 2013
- Hervé Fournier, Antoine Vigneron:
A deterministic algorithm for fitting a step function to a weighted point-set. 51-54 - Panagiotis D. Alevizos:
An optimal algorithm for computing the non-trivial circuits of a union of iso-oriented rectangles. 55-59 - Mario Lamberger, Elmar Teufl:
Memoryless near-collisions, revisited. 60-66 - Paul Dütting, Monika Henzinger, Ingmar Weber:
Sponsored search, market equilibria, and the Hungarian Method. 67-73 - Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Jakub Pachocki, Jakub Radoszewski, Wojciech Rytter, Wojciech Tyczynski, Tomasz Walen:
A note on efficient computation of all Abelian periods in a string. 74-77 - Kalpesh Kapoor, Himadri Nayak:
On multiset of factors of a word. 78-80 - Tess Avitabile, Claire Mathieu, Laura H. Parkinson:
Online constrained optimization with recourse. 81-86 - Yunjian Wu:
An improvement on Vizing's conjecture. 87-88 - Raffaele Mosca:
Maximum weight independent sets in (P6, co-banner)-free graphs. 89-93 - Lech Duraj:
A linear algorithm for 3-letter longest common weakly increasing subsequence. 94-99
Volume 113, Number 4, February 2013
- Stefan Kiefer:
BPA bisimilarity is EXPTIME-hard. 101-106 - Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Daniël Paulusma:
Choosability on H-free graphs. 107-110 - Sun-Mi Park, Ku-Young Chang, Dowon Hong:
Parallel GF(3m) multiplier for trinomials. 111-115 - Tomoyuki Yamakami, Yuichi Kato:
The dissecting power of regular languages. 116-122 - Gregory Z. Gutin, Gabriele Muciaccia, Anders Yeo:
(Non-)existence of polynomial kernels for the Test Cover problem. 123-126 - Xin Chen, Zhenzhen Xu, György Dósa, Xin Han, He Jiang:
Semi-online hierarchical scheduling problems with buffer or rearrangements. 127-131 - Yong-Jin Liu, Kai Tang:
The complexity of geodesic Voronoi diagrams on triangulated 2-manifold surfaces. 132-136 - Xi Peng, Zhang Yi, Xiao-Yong Wei, Dezhong Peng, Yongsheng Sang:
Free-gram phrase identification for modeling Chinese text. 137-144 - Kamal Al-Bawani, Alexander Souza:
Buffer overflow management with class segregation. 145-150
Volume 113, Numbers 5-6, March 2013
- Giuseppe Ateniese, Alfredo De Santis, Anna Lisa Ferrara, Barbara Masucci:
A note on time-bound hierarchical key assignment schemes. 151-155 - Luigi Acerbi, Alberto Dennunzio, Enrico Formenti:
Surjective multidimensional cellular automata are non-wandering: A combinatorial proof. 156-159 - Sung-Il Pae:
Exact output rate of Peres's algorithm for random number generation. 160-164 - Sudipta Das, Lawrence Jenkins, Debasis Sengupta:
Loss ratio of the EDF scheduling policy with early discarding technique. 165-170 - George Barmpalias, Rupert Hölzl, Andrew E. M. Lewis, Wolfgang Merkle:
Analogues of Chaitin's Omega in the computably enumerable sets. 171-178 - Marek Cygan, Marcin Pilipczuk:
Split Vertex Deletion meets Vertex Cover: New fixed-parameter and exact exponential-time algorithms. 179-182 - Romeo Rizzi, Alexandru I. Tomescu:
Ranking, unranking and random generation of extensional acyclic digraphs. 183-187 - Haiyan Yu, Yinfeng Xu, Tengyu Wu:
Online inventory replenishment scheduling of temporary orders. 188-192 - Jaroslaw Grytczuk, Piotr Szafruga, Michal Zmarz:
Online version of the theorem of Thue. 193-195 - Jelena Govorcin, Martin Knor, Riste Skrekovski:
Line graph operation and small worlds. 196-200
Volume 113, Number 7, April 2013
- Fabrizio Luccio, Linda Pagli:
Chain rotations: A new look at tree distance. 201-204 - Zahra Ahmadian, Mahmoud Salmasizadeh, Mohammad Reza Aref:
Desynchronization attack on RAPP ultralightweight authentication protocol. 205-209 - Taolue Chen, Tingting Han, Marta Z. Kwiatkowska:
On the complexity of model checking interval-valued discrete time Markov chains. 210-216 - Lucy Small, Oliver Mason:
Nash Equilibria for competitive information diffusion on trees. 217-219 - Yong Chen, An Zhang, Guangting Chen, Jianming Dong:
Approximation algorithms for parallel open shop scheduling. 220-224 - Michael Viderman:
LP decoding of codes with expansion parameter above 2/3. 225-228 - Osman Karaahmetoglu, Muharrem Tolga Sakalli, Ercan Bulus, Ion Tutanescu:
A new method to determine algebraic expression of power mapping based S-boxes. 229-235 - Walter Didimo:
Density of straight-line 1-planar graph drawings. 236-240 - Jens M. Schmidt:
A simple test on 2-vertex- and 2-edge-connectivity. 241-244 - Alessandro Barenghi, Stefano Crespi-Reghizzi, Dino Mandrioli, Matteo Pradella:
Parallel parsing of operator precedence grammars. 245-249
Volume 113, Number 8, April 2013
- Li Guan, Jianping Li:
Coordination mechanism for selfish scheduling under a grade of service provision. 251-254 - Sizhong Zhou, Zhiren Sun, Hui Ye:
A toughness condition for fractional (k, m)-deleted graphs. 255-259 - Hao Liang, Jun-Ming Xu:
Minimum feedback arc set of m-free digraphs. 260-264 - Amit Kumar Dutta, Masud Hasan, M. Sohel Rahman:
Prefix transpositions on binary and ternary strings. 265-270 - Qi Cheng, Jincheng Zhuang:
On certain computations of Pisot numbers. 271-275 - Marcin Krzywkowski:
Trees having many minimal dominating sets. 276-279 - Lan Lin, Yixun Lin:
Machine scheduling with contiguous processing constraints. 280-284 - Arnaud Carayol, Zoltán Ésik:
The FC-rank of a context-free language. 285-287 - Ching-Lueh Chang:
Deterministic sublinear-time approximations for metric 1-median selection. 288-292 - Marcos Lordello Chaim, Roberto Paulo Andrioli de Araujo:
An efficient bitwise algorithm for intra-procedural data-flow testing coverage. 293-300 - Gaoli Wang, Yanzhao Shen:
Preimage and pseudo-collision attacks on step-reduced SM3 hash function. 301-306
Volume 113, Number 9, May 2013
- Shailesh Vaya:
Round complexity of leader election and gossiping in bidirectional radio networks. 307-312 - Vadim V. Lozin, Christopher Purcell:
Boundary properties of the satisfiability problems. 313-317 - Leo van Iersel, Simone Linz:
A quadratic kernel for computing the hybridization number of multiple trees. 318-323 - Aleksandr Cariow, Galina Cariowa:
An algorithm for fast multiplication of sedenions. 324-331 - Nina Brandstätter, Wilfried Meidl, Arne Winterhof:
Addendum to Sidel'nikov sequences over nonprime fields. 332-336 - Manuel Schmitt, Rolf Wanka:
Exploiting independent subformulas: A faster approximation scheme for #k-SAT. 337-344 - Brian C. Dean, Raghuveer Mohan:
Building Cartesian trees from free trees with k leaves. 345-349 - Ben C. Moszkowski:
Interconnections between classes of sequentially compositional temporal formulas. 350-353 - Haihui Zhang:
Corrigendum to "On 3-choosability of planar graphs with neither adjacent triangles nor 5-, 6- and 9-cycles" [Information Processing Letters 110 (24) (2010) 1084-1087]. 354-356
Volume 113, Numbers 10-11, May - June 2013
- Yoo-Jin Baek:
Scalar recoding and regular 2w-ary right-to-left EC scalar multiplication algorithm. 357-360 - Tiziana Calamoneri:
Optimal L(δ1, δ2, 1)-labeling of eight-regular grids. 361-364 - Saïd Yahiaoui, Yacine Belhoul, Mohammed Haddad, Hamamache Kheddouci:
Self-stabilizing algorithms for minimal global powerful alliance sets in graphs. 365-370 - Amihood Amir, Haim Paryenty, Liam Roditty:
On the hardness of the Consensus String problem. 371-374 - Chandrashekhar Meshram, Suchitra A. Meshram:
An identity-based cryptographic model for discrete logarithm and integer factoring based cryptosystem. 375-380 - Javier Esparza, Andreas Gaiser, Stefan Kiefer:
A strongly polynomial algorithm for criticality of branching processes and consistency of stochastic context-free grammars. 381-385 - Qingxuan Yang, John A. Ellis, Khalegh Mamakani, Frank Ruskey:
In-place permuting and perfect shuffling using involutions. 386-391 - Pawel Morawiecki, Marian Srebrny:
A SAT-based preimage analysis of reduced Keccak hash functions. 392-397 - Aleksandar Ilic:
Efficient algorithm for the vertex connectivity of trapezoid graphs. 398-404
Volume 113, Number 12, June 2013
- Jun Feng, Xueming Wang, Hong Sun:
Efficiently computable endomorphism for genus 3 hyperelliptic curve cryptosystems. 405-408 - Alexander Kantor, Kobbi Nissim:
Attacks on statistical databases: The highly noisy case. 409-413 - Igor E. Shparlinski:
Correcting noisy exponentiation black-boxes modulo a prime. 414-417 - Arpita Maitra, Goutam Paul:
Eavesdropping in semiquantum key distribution protocol. 418-422 - Ferhat Karakoç, Hüseyin Demirci, A. Emre Harmanci:
Biclique cryptanalysis of LBlock and TWINE. 423-429 - Marcin Kubica, Tomasz Kulczynski, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
A linear time algorithm for consecutive permutation pattern matching. 430-433 - Hongyang Sun, Rui Fan:
Improved semi-online makespan scheduling with a reordering buffer. 434-439 - Dekel Tsur:
Top-k document retrieval in optimal space. 440-443 - Debashis Ghosh, Lakshmi Kanta Dey:
A new upper bound on the parameters of quasi-symmetric designs. 444-446 - Marek Karpinski, Andrzej Lingas, Dzmitry Sledneu:
Optimal cuts and partitions in tree metrics in polynomial time. 447-451 - Eddie Cheng, László Lipták, Daniel E. Steffy:
Strong local diagnosability of (n, k)(n, k)-star graphs and Cayley graphs generated by 2-trees with missing edges. 452-456
Volume 113, Number 13, July 2013
- Yuval Filmus:
Inequalities on submodular functions via term rewriting. 457-464 - Long Wan, Xiaofang Deng, Zhiyi Tan:
Inefficiency of Nash equilibria with parallel processing policy. 465-469 - Muhammad Rashed Alam, M. Sohel Rahman:
A divide and conquer approach and a work-optimal parallel algorithm for the LIS problem. 470-476 - Edith Elkind, James B. Orlin:
On the hardness of finding subsets with equal average. 477-480 - Jianhua Tu, Fengmei Yang:
The vertex cover P3P3 problem in cubic graphs. 481-485 - Yuan Feng, Lijun Zhang:
A tighter bound for the self-stabilization time in Herman's algorithm. 486-488 - Riadh Khennoufa, Hamida Seba, Hamamache Kheddouci:
Edge coloring total k-labeling of generalized Petersen graphs. 489-494 - Laurent Alonso, Edward M. Reingold:
Analysis of Boyer and Moore's MJRTY algorithm. 495-497 - Daniel Rotter, Jens Vygen:
d-dimensional arrangement revisited. 498-505
Volume 113, Numbers 14-16, July - August 2013
- Leandro Soares de Sousa, Julius Cesar Barreto Leite, Orlando Loques:
Green data centers: Using hierarchies for scalable energy efficiency in large web clusters. 507-515 - Július Czap:
A note on total colorings of 1-planar graphs. 516-517 - Danny Z. Chen, Haitao Wang:
A note on searching line arrangements and applications. 518-521 - Abishek Gopalan, Srinivasan Ramasubramanian:
A counterexample for the proof of implication conjecture on independent spanning trees. 522-526 - Jung-Heum Park, Insung Ihm:
Single-source three-disjoint path covers in cubes of connected graphs. 527-532 - Xiang-Jun Li, Jun-Ming Xu:
Generalized measures of fault tolerance in exchanged hypercubes. 533-537 - Emanuele Giaquinta, Szymon Grabowski:
New algorithms for binary jumbled pattern matching. 538-542 - Ali Çivril:
A note on the hardness of sparse approximation. 543-545 - John M. Hitchcock, Elvira Mayordomo:
Base invariance of feasible dimension. 546-551 - J. Mark Keil, Dinabandhu Pradhan:
Computing a minimum outer-connected dominating set for the class of chordal graphs. 552-561 - Vasin Suttichaya, Pattarasinee Bhattarakosol:
Solving the learning parity with noise's open question. 562-566 - Qichun Wang, Chik How Tan:
A new method to construct Boolean functions with good cryptographic properties. 567-571 - Javier Herranz, Alexandre Ruiz, Germán Sáez:
Sharing many secrets with computational provable security. 572-579 - Ji-Jian Chin, Syh-Yuan Tan, Swee-Huay Heng, Raphael C.-W. Phan:
On the security of a modified Beth identity-based identification scheme. 580-583 - Beate Bollig, Michael Capelle:
Priority functions for the approximation of the metric TSP. 584-591
Volume 113, Number 17, August 2013
- Ran Ma, Jinjiang Yuan:
Online scheduling on a single machine with rejection under an agreeable condition to minimize the total completion time plus the total rejection cost. 593-598 - Parvathi Rangasamy, Muhammad Akram, S. Thilagavathi:
Intuitionistic fuzzy shortest hyperpath in a network. 599-603 - Golnaz Badkobeh, Gabriele Fici, Steve Kroon, Zsuzsanna Lipták:
Binary jumbled string matching for highly run-length compressible texts. 604-608 - Jianfeng Ren, Donglei Du, Dachuan Xu:
The complexity of two supply chain scheduling problems. 609-612 - Toufik Mansour, Vincent Vajnovszki:
Efficient generation of restricted growth words. 613-616 - Shmuel T. Klein:
On the connection between Hamming codes, Heapsort and other methods. 617-620 - Qi Chen, Dingyi Pei, Chunming Tang, Gansen Zhao:
Efficient integer span program for hierarchical threshold access structure. 621-627 - D. R. Simões, Jaime Portugheis, Valdemar Cardoso da Rocha Jr.:
Universal homophonic coding scheme using differential encoding and interleaving. 628-633 - Linzhen Lu, Shaozhen Chen:
A compress slide attack on the full GOST block cipher. 634-639 - Jinsoo Oh, Jin Kim, Byung Ro Moon:
On the inequivalence of bilinear algorithms for 3×33×3 matrix multiplication. 640-645 - Shinya Fujita, Linda M. Lesniak:
Revisit of Erdős-Gallai's theorem on the circumference of a graph. 646-648