default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation Processing Letters, Volume 110
Volume 110, Number 1, December 2009
- Pavel Hrubes, Amir Yehudayoff:
Monotone separations for constant degree polynomials. 1-3 - Jorge Almeida
, Ondrej Klíma:
A counterexample to a conjecture concerning concatenation hierarchies. 4-7 - Periklis A. Papakonstantinou:
A note on width-parameterized SAT: An exact machine-model characterization. 8-12 - Jialin Zhang, Wei Chen:
Implementing uniform reliable broadcast with binary consensus in systems with fair-lossy links. 13-19 - Lei Chen, Changhong Lu, Zhenbing Zeng:
A linear-time algorithm for paired-domination problem in strongly chordal graphs. 20-23 - Kangbok Lee, Joseph Y.-T. Leung, Michael L. Pinedo:
A note on graph balancing problems with restrictions. 24-29 - Roman Cada, Tomás Kaiser, Moshe Rosenfeld, Zdenek Ryjácek:
Disjoint Hamilton cycles in the star graph. 30-35 - Fumiya Okubo:
A note on the descriptional complexity of semi-conditional grammars. 36-40
Volume 110, Number 2, December 2009
- Sun-Yuan Hsieh, Che-Nan Kuo, Hsin-Hung Chou:
A further result on fault-free cycles in faulty folded hypercubes. 41-43 - Lech Adamus, Beata Orchel, Artur Szymanski, A. Pawel Wojda, Malgorzata Zwonek:
A note on t-complementing permutations for graphs. 44-45 - Jyh-haw Yeh:
Enforcing non-hierarchical access policies by hierarchical key assignment schemes. 46-49 - Kung-Jui Pai, Jou-Ming Chang, Yue-Li Wang:
Upper bounds on the queuenumber of k-ary n-cubes. 50-56 - Ton van Deursen, Sasa Radomirovic:
On a new formal proof model for RFID location privacy. 57-61 - Mohamed Medhat Gaber, Uwe Röhm, Karel Herink:
An analytical study of central and in-network data processing for wireless sensor networks. 62-70 - Meijie Ma, Baodong Liu:
Cycles embedding in exchanged hypercubes. 71-76 - Xie-Bin Chen:
Hamiltonian paths and cycles passing through a prescribed path in hypercubes. 77-82
Volume 110, Number 3, January 2010
- Cristian Martín, Mikel Larrea:
A simple and communication-efficient Omega algorithm in the crash-recovery model. 83-87 - James Bailey, Elsa Loekito:
Efficient incremental mining of contrast patterns in changing data. 88-92 - Yuichi Asahiro, Eiji Miyano, Shuichi Miyazaki, Takuro Yoshimuta:
Weighted nearest neighbor algorithms for the graph exploration problem on cycles. 93-98 - Nicoletta De Francesco, Giuseppe Lettieri, Luca Martini, Gigliola Vaglini:
Partial model checking via abstract interpretation. 99-103 - Santhanakrishnan Anand, Rajarathnam Chandramouli:
A network flow based approach for network selection in dynamic spectrum access networks. 104-107 - Narad Rampersad, Jeffrey O. Shallit:
Detecting patterns in finite regular and context-free languages. 108-112 - Peter Brass, Hyeon-Suk Na:
Finding the maximum bounded intersection of k out of n halfplanes. 113-115 - Yannick Chevalier, Michaël Rusinowitch:
Compiling and securing cryptographic protocols. 116-122 - Enno Ohlebusch, Simon Gog:
Efficient algorithms for the all-pairs suffix-prefix problem and the all-pairs substring-prefix problem. 123-128
Volume 110, Number 4, January 2010
- Nathan Keller, Stephen D. Miller:
Distinguishing attacks on stream ciphers based on arrays of pseudo-random words. 129-132 - Marc Bezem, Robert Nieuwenhuis, Enric Rodríguez-Carbonell:
Hard problems in max-algebra, control theory, hypergraphs and other areas. 133-138 - Michael B. Baer:
Alphabetic coding with exponential costs. 139-142 - Leonid Libkin, Cristina Sirangelo:
Disjoint pattern matching and implication in strings. 143-147 - Branislav Durian, Jan Holub, Hannu Peltola, Jorma Tarhio:
Improving practical exact string matching. 148-152 - François Bonnet, Michel Raynal:
A simple proof of the necessity of the failure detector Sigma to implement an atomic register in asynchronous message-passing systems. 153-157 - Guo-Qiang Zhang, Licong Cui:
A set coverage problem. 158-159 - Hui Li, Chuankun Wu, Jun Sun:
A general compiler for password-authenticated group key exchange protocol. 160-167 - Sanjeev Saxena:
On finding fundamental cut sets. 168-170
Volume 110, Number 5, February 2010
- Juan Liu, Xindong Zhang, Xing Chen, Jixiang Meng:
On domination number of Cartesian product of directed cycles. 171-173 - Dhruv Mubayi, György Turán:
Finding bipartite subgraphs efficiently. 174-177 - Santanu Sarkar, Subhamoy Maitra:
Cryptanalysis of RSA with two decryption exponents. 178-181 - Yi-Wei Ci, Zhan Zhang, De-Cheng Zuo, Zhibo Wu, Xiao-Zong Yang:
Dependency mining-based causal message logging. 182-187 - Jianxin Wang, Dan Ning, Qilong Feng, Jianer Chen:
An improved kernelization for P2-packing. 188-192 - Elad Cohen, Martin Charles Golumbic, Marina Lipshteyn, Michal Stern:
On the bi-enhancement of chordal-bipartite probe graphs. 193-197 - Jonathan P. Sorenson:
A randomized sublinear time parallel GCD algorithm for the EREW PRAM. 198-201
Volume 110, Number 6, February 2010
- Xie-Bin Chen:
Unpaired many-to-many vertex-disjoint path covers of a class of bipartite graphs. 203-205 - Huifang Miao, Guoping Lin:
Strong orientations of complete k-partite graphs achieving the strong diameter. 206-210 - Wenjun Xiao, Behrooz Parhami, Weidong Chen, Mingxin He, Wenhong Wei:
Fully symmetric swapped networks based on bipartite cluster connectivity. 211-215 - Meng Zhang, Yi Zhang, Liang Hu:
A faster algorithm for matching a set of patterns with variable length don't cares. 216-220 - Noga Alon, Michal Feldman, Ariel D. Procaccia, Moshe Tennenholtz:
A note on competitive diffusion through social networks. 221-225 - Qiwen Xu, Naijun Zhan:
Rate monotonic scheduling re-analysed. 226-231 - Manfred Schmidt-Schauß, David Sabel:
Closures of may-, should- and must-convergences for contextual equivalence. 232-235 - Ales Zivkovic, Uros Goljat, Marjan Hericko:
Improving the usability of the source code quality index with interchangeable metrics sets. 236-240
Volume 110, Number 7, March 2010
- Feng Liu, Chuan Kun Wu, Xi Jun Lin:
A new definition of the contrast of visual cryptography scheme. 241-246 - Pawel Szalachowski, Bogdan Ksiezopolski, Zbigniew Kotulski:
CMAC, CCM and GCM/GMAC: Advanced modes of operation of symmetric block ciphers in wireless sensor networks. 247-251 - Roman Kolpakov, Gregory Kucherov, Pascal Ochem:
On maximal repetitions of arbitrary exponent. 252-256 - Regant Y. S. Hung, Lap-Kei Lee, Hing-Fung Ting:
Finding frequent items over sliding windows with constant update time. 257-260 - Michael D. Barrus:
Antimagic labeling and canonical decomposition of graphs. 261-263 - Evgeny Demenkov, Arist Kojevnikov, Alexander S. Kulikov, Grigory Yaroslavtsev:
New upper bounds on the Boolean circuit complexity of symmetric functions. 264-267 - Cui Yu, James Bailey, Julian Montefusco, Rui Zhang, Jiling Zhong:
Enhancing the B+-tree by dynamic node popularity caching. 268-273 - Sarmad Abbasi, Patrick Healy, Aimal Rextin:
Improving the running time of embedded upward planarity testing. 274-278
Volume 110, Numbers 8-9, April 2010
- Stefan Hougardy:
The Floyd-Warshall algorithm on graphs with negative cycles. 279-281 - Sreyash Kenkre, Sundar Vishwanathan:
Approximation algorithms for the Bipartite Multicut problem. 282-287 - Lingfei Yu, Kun She, Haigang Gong, Changyuan Yu:
Price of anarchy in parallel processing. 288-293 - Byoung-Hoon Lee, Sung-Hwa Lim, Jai-Hoon Kim:
Scalable real-time monitoring system for ubiquitous smart space. 294-299 - Yin Li, Gongliang Chen, Yi-yang Chen, Jianhua Li:
An extension of TYT inversion algorithm in polynomial basis. 300-303 - Orr Dunkelman, Nathan Keller:
The effects of the omission of last round's MixColumns on AES. 304-308 - Jittat Fakcharoenphol, Boonserm Kijsirikul:
Short proofs for online multiclass prediction on graphs. 309-311 - Pinar Heggernes, Daniel Meister:
Hardness and approximation of minimum distortion embeddings. 312-316 - Johannes Fischer:
Wee LCP. 317-320 - Nicolas Roussel, Xuding Zhu:
Total coloring of planar graphs of maximum degree eight. 321-324 - Jiping Tao, Zhijun Chao, Yugeng Xi, Ye Tao:
An optimal semi-online algorithm for a single machine scheduling problem with bounded processing time. 325-330 - Johannes Fischer, Daniel H. Huson:
New common ancestor problems in trees and directed acyclic graphs. 331-335 - Santanu Sarkar, Subhamoy Maitra:
Cryptanalysis of RSA with more than one decryption exponent. 336-340 - Hans Ulrich Simon, Balázs Szörényi:
One-inclusion hypergraph density revisited. 341-344 - Yen-Lin Huang, Cheng-Chen Huang, Chuan Yi Tang, Chin Lung Lu:
An improved algorithm for sorting by block-interchanges based on permutation groups. 345-350
Volume 110, Number 10, April 2010
- Peter Jonsson, Johan Thapper:
Approximating integer programs with positive right-hand sides. 351-355 - Gady Kozma, Zvi Lotker, Gideon Stupp:
On the connectivity threshold for general uniform metric spaces. 356-359 - Foto N. Afrati, Matthew Damigos, Manolis Gergatsoulis:
Query containment under bag and bag-set semantics. 360-369 - Magnús M. Halldórsson:
Online coloring of hypergraphs. 370-372 - Dur-e-Shahwar Kundi, Arshad Aziz, Nassar Ikram:
Resource efficient implementation of T-Boxes in AES on Virtex-5 FPGA. 373-377 - Shuli Liu:
On toughness and fractional (g, f, n)-critical graphs. 378-382 - Hong Liu, Daming Zhu:
Parameterized complexity of control problems in Maximin election. 383-388 - Andrzej Pelc:
Fault-tolerant strategies in the Iterated Prisoner's Dilemma. 389-395 - Marcin Balcerzak, Damian Niwinski:
Two-way deterministic automata with two reversals are exponentially more succinct than with one reversal. 396-398 - Liliana Cucu-Grosjean, Joël Goossens:
Predictability of Fixed-Job Priority schedulers on heterogeneous multiprocessor real-time systems. 399-402 - Shuming Zhou, Wenjun Xiao:
Conditional diagnosability of alternating group networks. 403-409 - Rusins Freivalds, Abuzer Yakaryilmaz, A. C. Cem Say:
A new family of nonstochastic languages. 410-413 - Jia-Cian Lin, Jinn-Shyong Yang, Chiun-Chieh Hsu, Jou-Ming Chang:
Independent spanning trees vs. edge-disjoint spanning trees in locally twisted cubes. 414-419 - Dashiell Kolbe, Qiang Zhu, Sakti Pramanik:
Reducing non-determinism of k-NN searching in non-ordered discrete data spaces. 420-423
Volume 110, Number 11, May 2010
- Wolfgang Dvorák, Stefan Woltran:
Complexity of semi-stable and stage semantics in argumentation frameworks. 425-430 - Julien Clément, Xavier Défago, Maria Gradinariu Potop-Butucaru, Taisuke Izumi, Stéphane Messika:
The cost of probabilistic agreement in oblivious robot networks. 431-438 - Jung-Sheng Fu:
Edge-fault-tolerant vertex-pancyclicity of augmented cubes. 439-443 - Ruyan Fu, T. C. Edwin Cheng, C. T. Ng, Jinjiang Yuan:
Online scheduling on two parallel-batching machines with limited restarts to minimize the makespan. 444-450 - Robert Crowston, Gregory Z. Gutin, Mark Jones:
Note on Max Lin-2 above Average. 451-454 - Peng-Jen Lai, Wen-Chiung Lee:
Single-machine scheduling with a nonlinear deterioration function. 455-459 - Min Ji, T. C. Edwin Cheng:
Scheduling with job-dependent learning effects and multiple rate-modifying activities. 460-463 - Qiang Dong, Xiaofan Yang:
Embedding a long fault-free cycle in a crossed cube with more faulty nodes. 464-468 - Lan Lin, Yixun Lin:
Two models of two-dimensional bandwidth problems. 469-473 - Jean-Luc Baril, Rémi Vernay:
Whole mirror duplication-random loss model and pattern avoiding permutations. 474-480
Volume 110, Numbers 12-13, June 2010
- Joan M. Lucas:
An improved kernel size for rotation distance in binary trees. 481-484 - Liqun Chen, Jiangtao Li:
A note on the Chen-Morrissey-Smart DAA scheme. 485-488 - Jonghun Park, Byung-Cheon Choi, Kwanho Kim:
A vector space approach to tag cloud similarity ranking. 489-496 - Christophe Crespelle, Philippe Gambette:
Unrestricted and complete Breadth-First Search of trapezoid graphs in O(n) time. 497-502 - Leah Epstein, Asaf Levin:
Randomized algorithms for online bounded bidding. 503-506 - Fabrizio Frati:
A note on isosceles planar graph drawing. 507-509 - Xiandong Zhang, Steef L. van de Velde:
On-line two-machine job shop scheduling with time lags. 510-513 - Akira Ichimura, Maiko Shigeno:
A new parameter for a broadcast algorithm with locally bounded Byzantine faults. 514-517 - Aleksandar Radonjic, Vladimir Vujicic:
Integer SEC-DED codes for low power communications. 518-520 - Alireza Bagheri, Mohammadreza Razzazi:
Planar straight-line point-set embedding of trees with partial embeddings. 521-523
Volume 110, Numbers 14-15, July 2010
- Ermeson C. Andrade, Paulo Romero Martins Maciel, Bruno Costa e Silva Nogueira, Carlos Araújo, Gustavo Rau de Almeida Callou:
A COTS-based approach for estimating performance and energy consumption of embedded real-time systems. 525-534 - Tatsuya Iwasaki, Keiichi Kaneko:
Fault-tolerant routing in burnt pancake graphs. 535-538 - Stefan Gruner, Theunis J. Steyn:
Deadlock-freeness of hexagonal systolic arrays. 539-543 - Shaojing Fu, Chao Li, Kanta Matsuura, Longjiang Qu:
Enumeration of balanced symmetric functions over GF(p). 544-548 - Shay Gueron, Michael E. Kounavis:
Efficient implementation of the Galois Counter Mode using a carry-less multiplier and a fast reduction algorithm. 549-553 - Mingyu Xiao:
Finding minimum 3-way cuts in hypergraphs. 554-558 - Xiaofan Yang, Qiang Dong, Yuan Yan Tang:
Embedding meshes/tori in faulty crossed cubes. 559-564 - Avraham A. Melkman, Takeyuki Tamura, Tatsuya Akutsu:
Determining a singleton attractor of an AND/OR Boolean network in O(1.587n) time. 565-569 - Nili Guttmann-Beck, Refael Hassin:
On two restricted ancestors tree problems. 570-575 - Jae Moon Lee:
An efficient algorithm to find k-nearest neighbors in flocking behavior. 576-579 - Di Liu, Jing Li:
Many-to-many n-disjoint path covers in n-dimensional hypercubes. 580-584 - Janos Vidali, Peter Nose, Enes Pasalic:
Collisions for variants of the BLAKE hash function. 585-590 - Tero Harju, Dirk Nowotka:
Cyclically repetition-free words on small alphabets. 591-595 - Zong-Da Wu, Tao Jiang, Wu-Jie Su:
Efficient computation of shortest absent words in a genomic sequence. 596-601 - Jooyoung Lee, Je Hong Park:
Preimage resistance of LPmkr with r=m-1. 602-608 - Valerio Freschi, Alessandro Bogliolo:
A faster algorithm for the computation of string convolutions using LZ78 parsing. 609-613 - Hyun-Gul Roh, Myeongjae Jeon, Euiseong Seo, Jinsoo Kim, Joonwon Lee:
Log' version vector: Logging version vectors concisely in dynamic replication. 614-620
Volume 110, Number 16, July 2010
- Faisal N. Abu-Khzam:
An improved kernelization algorithm for r-Set Packing. 621-624 - Xie-Bin Chen:
Cycles passing through a prescribed path in a hypercube with faulty edges. 625-629 - Nicholas Nash, David Gregg:
An output sensitive algorithm for computing a maximum independent set of a circle graph. 630-634 - Jonathan Backer, J. Mark Keil:
Constant factor approximation algorithms for the densest k-subgraph problem on proper interval graphs and bipartite permutation graphs. 635-638 - Wouter Gelade, Frank Neven:
Optimizing the Region Algebra is PSPACE-complete. 639-643 - Alessandro Colantonio, Roberto Di Pietro:
Concise: Compressed 'n' Composable Integer Set. 644-650 - Ruijuan Li:
A Fan-type result on k-ordered graphs. 651-654 - Amr Elmasry:
The longest almost-increasing subsequence. 655-658 - Litao Guo, Chengfu Qin, Xiaofeng Guo:
Super connectivity of Kronecker products of graphs. 659-661 - Dejan Delic, Changping Wang:
Upper signed k-domination in a general graph. 662-665 - Bhargav S. Gulavani, Supratik Chakraborty, Aditya V. Nori, Sriram K. Rajamani:
Refining abstract interpretations. 666-671 - Sang Won Bae, Chunseok Lee, Sunghee Choi:
On exact solutions to the Euclidean bottleneck Steiner tree problem. 672-678 - Pietro di Lena, Luciano Margara:
Optimal global alignment of signals by maximization of Pearson correlation. 679-686 - Walter Didimo, Peter Eades, Giuseppe Liotta:
A characterization of complete bipartite RAC graphs. 687-691 - Guiguang Ding, Jianmin Wang, Kai Qin:
A visual word weighting scheme based on emerging itemsets for video annotation. 692-696 - Thierry Vallée:
Normal eulerian clique-covering and hamiltonicity. 697-701 - Fedor V. Fomin, Serge Gaspers, Petr A. Golovach, Dieter Kratsch, Saket Saurabh:
Parameterized algorithm for eternal vertex cover. 702-706 - Ariel Kulik, Hadas Shachnai:
There is no EPTAS for two-dimensional knapsack. 707-710 - Chan-Wei Chang, David Kuo, Hsing-Ching Lin:
Ranking numbers of graphs. 711-716 - Henning Köhler, Sebastian Link:
Armstrong axioms and Boyce-Codd-Heath Normal Form under bag semantics. 717-724 - Marek Libura:
A note on robustness tolerances for combinatorial optimization problems. 725-729 - Yung-Hsing Peng, Chang-Biau Yang, Kuo-Si Huang, Hsing-Yen Ann:
Efficient indexing algorithms for one-dimensional discretely-scaled strings. 730-734
Volume 110, Number 17, August 2010
- Tom Rackham:
The complexity of changing colourings with bounded maximum degree. 735-739 - Ranko Lazic:
The reachability problem for branching vector addition systems requires doubly-exponential space. 740-745 - Subhas C. Nandy, Krishnendu Mukhopadhyaya, Bhargab B. Bhattacharya:
Recognition of largest empty orthoconvex polygon in a point set. 746-752 - Shun'ichi Amano:
On the coNP hardness of computing certain answers over locally specified incomplete DOM-trees. 753-756 - Konstanty Junosza-Szaniawski, Lukasz Rozej:
Game chromatic number of graphs with locally bounded number of cycles. 757-760 - Armin Eftekhari, Mohamad Forouzanfar, Hamid Abrishami Moghaddam, Javad Alirezaie:
Block-wise 2D kernel PCA/LDA for face recognition. 761-766 - Luciano Bertini, Julius C. B. Leite, Daniel Mossé:
Power and performance control of soft real-time web server clusters. 767-773 - Christopher C. Cipriano, Teofilo F. Gonzalez:
Multicasting in the hypercube, chord and binomial graphs. 774-777 - Ing-Ray Chen, Yating Wang, Ding-Chau Wang:
Reliability of wireless sensors with code attestation for intrusion detection. 778-786 - Robert Glück:
Self-generating program specializers. 787-793
Volume 110, Numbers 18-19, September 2010
- Tanaeem M. Moosa, M. Sohel Rahman:
Indexing permutations for binary strings. 795-798 - Dongyoung Roh, Sang Geun Hahn:
On the bit security of the weak Diffie-Hellman problem. 799-802 - Katsuhisa Yamanaka, Shin-Ichi Nakano:
A compact encoding of plane triangulations with efficient query supports. 803-809 - Masahiko Sakai, Mizuhito Ogawa:
Weakly-non-overlapping non-collapsing shallow term rewriting systems are confluent. 810-814 - Tatsuya Akutsu:
A bisection algorithm for grammar-based compression of ordered trees. 815-820 - Deke Guo, Hanhua Chen, Yuan He, Hai Jin, Chao Chen, Honghui Chen, Zhen Shu, Guangqi Huang:
KCube: A novel architecture for interconnection networks. 821-825 - Iftah Gamzu, Danny Segev:
A polylogarithmic approximation for computing non-metric terminal Steiner trees. 826-829 - Jingwen Zhang, Yingqian Wang:
(Delta+1)-total-colorability of plane graphs with maximum degree Delta at least 6 and without adjacent short cycles. 830-834 - Esther Ezra:
A note about weak epsilon-nets for axis-parallel boxes in d-space. 835-840 - Tibor Jordán:
Generically globally rigid zeolites in the plane. 841-844
Volume 110, Number 20, September 2010
- Maw-Shang Chang, Hsiao-Han Chung, Chuang-Chieh Lin:
An improved algorithm for the red-blue hitting set problem with the consecutive ones property. 845-848 - Gerard Jennhwa Chang, Jianfeng Hou, Nicolas Roussel:
On the total choosability of planar graphs and of sparse graphs. 849-853 - Paulin Melatagia Yonta, Maurice Tchuenté, René Ndoundam:
Routing automorphisms of the hypercube. 854-860 - Andrey Bogdanov:
On the differential and linear efficiency of balanced Feistel networks. 861-866 - Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto:
Evaluation of permanents in rings and semirings. 867-870 - Shuaiqiang Wang, Jun Ma, Jiming Liu, Xiaofei Niu:
Evolving choice structures for genetic programming. 871-876 - Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi, Yuri Pirola:
Variants of constrained longest common subsequence. 877-881 - Chong Hee Kim:
New fault attacks using Jacobi symbol and application to regular right-to-left algorithms. 882-886 - Wei Dong, Baogang Xu:
Some results on acyclic edge coloring of plane graphs. 887-892 - Rahul Jain, Hartmut Klauck, Miklos Santha:
Optimal direct sum results for deterministic and randomized decision tree complexity. 893-897 - Elena Grigorescu, Kyomin Jung, Ronitt Rubinfeld:
A local decision test for sparse polynomials. 898-901 - Erzsébet Csuhaj-Varjú, György Vaszil:
Scattered context grammars generate any recursively enumerable language with two nonterminals. 902-907 - Richard Groult, Élise Prieur, Gwénaël Richomme:
Counting distinct palindromes in a word in linear time. 908-912 - Mickaël Montassier, André Raspaud, Xuding Zhu:
Decomposition of sparse graphs into two forests, one having bounded maximum degree. 913-916
Volume 110, Number 21, October 2010
- Travis C. Service:
A No Free Lunch theorem for multi-objective optimization. 917-923 - Beate Bollig:
Exponential space complexity for OBDD-based reachability analysis. 924-927 - Bernadette Charron-Bost, Martin Hutle, Josef Widder:
In search of lost time. 928-933 - Fabrizio Luccio, Antonio Mesa Enriques, Linda Pagli:
Lower bounds on the rotation distance of binary trees. 934-938 - Torben Amtoft, Kelly Androutsopoulos, David Clark, Mark Harman, Zheng Li:
An alternative characterization of weak order dependence. 939-943 - Kenneth J. Christensen, Allen Roginsky, Miguel Jimeno:
A new analysis of the false positive rate of a Bloom filter. 944-949 - Jef Wijsen:
A remark on the complexity of consistent conjunctive query answering under primary key violations. 950-955 - Bartosz Walczak:
A simple representation of subwords of the Fibonacci word. 956-960 - Bassel Mannaa:
Cluster editing problem for points on the real line: A polynomial time algorithm. 961-965 - Gregory Z. Gutin, Anders Yeo:
Note on maximal bisection above tight lower bound. 966-969 - Tsung-Hao Liu, Hsueh-I Lu:
Minimum cycle bases of weighted outerplanar graphs. 970-974
Volume 110, Number 22, October 2010
- Sebastian Dörn, Thomas Thierauf:
A note on the search for k elements via quantum walk. 975-978 - Andrew Zemke, Sandra James, Darren A. Narayan:
Greedy algorithms for generalized k-rankings of paths. 979-985 - Xiuying Li, Zhao Zhang:
Two algorithms for minimum 2-connected r-hop dominating set. 986-991 - Xiaorong Wang, Hongbo Shi:
A modified Guruswami-Sudan algorithm for decoding Reed-Solomon codes. 992-997 - Zhao Zhang, Wei Xiong, Weihua Yang:
A kind of conditional fault tolerance of alternating group graphs. 998-1002 - Zhenghua Zhou, Zhi Hu, Maozhi Xu, Wangan Song:
Efficient 3-dimensional GLV method for faster point multiplication on some GLS elliptic curves. 1003-1006 - Weihua Yang, Hengzhe Li, Xiaofeng Guo:
A kind of conditional fault tolerance of (n, k)-star graphs. 1007-1011 - Raphaël Clifford, Benjamin Sach:
Permuted function matching. 1012-1015 - Kazuo Iwama, Guochuan Zhang:
Online knapsack with resource augmentation. 1016-1020 - Raphaël Clifford, Ely Porat:
A filtering algorithm for k-mismatch with don't cares. 1021-1025
Volume 110, Number 23, November 2010
- Weihua Yang, Hengzhe Li, Jixiang Meng:
Conditional connectivity of Cayley graphs generated by transposition trees. 1027-1030 - Giorgio Gnecco, Marcello Sanguineti:
On spectral windows in supervised learning from data. 1031-1036 - Leo van Iersel, Charles Semple, Mike A. Steel:
Locating a tree in a phylogenetic network. 1037-1043 - Anita Das, Mathew C. Francis, Rogers Mathew, N. Sadagopan:
Non-contractible non-edges in 2-connected graphs. 1044-1048 - Xin Han, Chao Peng, Deshi Ye, Dahai Zhang, Yan Lan:
Dynamic bin packing with unit fraction items revisited. 1049-1054 - Alex A. Aravind:
Highly-fair bakery algorithm using symmetric tokens. 1055-1060 - Jyrki Katajainen, S. Srinivasa Rao:
A compact data structure for representing a dynamic multiset. 1061-1066 - B. S. Panda, Dinabandhu Pradhan:
Locally connected spanning trees in cographs, complements of bipartite graphs and doubly chordal graphs. 1067-1073 - Olaf Beyersdorff, Nicola Galesi, Massimo Lauria:
A lower bound for the pigeonhole principle in tree-like Resolution by asymmetric Prover-Delayer games. 1074-1077
Volume 110, Number 24, November 2010
- Christoph Bartoschek, Stephan Held, Jens Maßberg, Dieter Rautenbach, Jens Vygen:
The repeater tree construction problem. 1079-1083 - (Withdrawn) On 3-choosability of planar graphs with neither adjacent triangles nor 5-, 6- and 9-cycles. 1084-1087
- Xie-Bin Chen:
Edge-fault-tolerant diameter and bipanconnectivity of hypercubes. 1088-1092 - Kimmo Fredriksson:
On building minimal automaton for subset matching queries. 1093-1098 - Meng Zhang, Yi Zhang, Liang Hu:
Pattern matching with wildcards using words of shorter length. 1099-1102 - Yunong Zhang, Zhende Ke, Peng Xu, Chenfu Yi:
Time-varying square roots finding via Zhang dynamics versus gradient dynamics and the former's link and new explanation to Newton-Raphson iteration. 1103-1109 - Ashley Montanaro:
Nonadaptive quantum query complexity. 1110-1113 - Sanjay Jain, Yuh Shin Ong, Frank Stephan:
Regular patterns, regular languages and context-free languages. 1114-1119 - Yuval Emek, Pierre Fraigniaud, Amos Korman, Adi Rosén:
On the additive constant of the k-server Work Function Algorithm. 1120-1123 - Yang Shen, Lizhuang Ma, Hai Liu, Yanxia Bao, Zhihua Chen:
Detecting and extracting natural snow from videos. 1124-1130
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.
last updated on 2024-12-03 20:28 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
