Result 1 to 20 of 1170 total
The cosparse analysis model and algorithms. (English)
Appl. Comput. Harmon. Anal. 34, No. 1, 30-56 (2013).
1
The P versus NP-complete dichotomy of some challenging problems in graph theory. (English)
Discrete Appl. Math. 160, No. 18, 2681-2693 (2012).
2
Parameterized measure \& conquer for problems with no small kernels. (English)
Algorithmica 64, No. 1, 189-212 (2012).
3
An improved analysis of SRPT scheduling algorithm on the basis of functional optimization. (English)
Inf. Process. Lett. 112, No. 23, 911-915 (2012).
4
Counterexamples to the long-standing conjecture on the complexity of BDD binary operations. (English)
Inf. Process. Lett. 112, No. 16, 636-640 (2012).
5
A related key impossible differential attack against 22 rounds of the lightweight block cipher LBlock. (English)
Inf. Process. Lett. 112, No. 16, 624-629 (2012).
6
Dynamic programming for $H$-minor-free graphs. (English)
Gudmundsson, Joachim (ed.) et al., Computing and combinatorics. 18th annual international conference, COCOON 2012, Sydney, Australia, August 20‒22, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-32240-2/pbk). Lecture Notes in Computer Science 7434, 86-97 (2012).
7
Pattern matching with swaps in practice. (English)
Int. J. Found. Comput. Sci. 23, No. 2, 323-342 (2012).
8
Surface split decompositions and subgraph isomorphism in graphs on surfaces. (English)
Dürr, Christoph (ed.) et al., STACS 2012. 29th international symposium on theoretical aspects of computer science, Paris, France, February 29th ‒ March 3rd, 2012. Wadern: Schloss Dagstuhl ‒ Leibniz Zentrum für Informatik (ISBN 978-3-939897-35-4). LIPICS ‒ Leibniz International Proceedings in Informatics 14, 531-542, electronic only (2012).
9
A multiple sliding windows approach to speed up string matching algorithms. (English)
Klasing, Ralf (ed.), Experimental algorithms. 11th international symposium, SEA 2012, Bordeaux, France, June 7‒9, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-30849-9/pbk). Lecture Notes in Computer Science 7276, 172-183 (2012).
10
Implementation and comparison of heuristics for the vertex cover problem on huge graphs. (English)
Klasing, Ralf (ed.), Experimental algorithms. 11th international symposium, SEA 2012, Bordeaux, France, June 7‒9, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-30849-9/pbk). Lecture Notes in Computer Science 7276, 39-50 (2012).
11
List update with probabilistic locality of reference. (English)
Inf. Process. Lett. 112, No. 13, 540-543 (2012).
12
An exact exponential time algorithm for counting bipartite cliques. (English)
Inf. Process. Lett. 112, No. 13, 535-539 (2012).
13
Deterministic network exploration by a single agent with Byzantine tokens. (English)
Inf. Process. Lett. 112, No. 12, 467-470 (2012).
14
Average complexity of backward $q$-gram string matching algorithms. (English)
Inf. Process. Lett. 112, No. 11, 433-437 (2012).
15
Cores of random $r$-partite hypergraphs. (English)
Inf. Process. Lett. 112, No. 8-9, 314-319 (2012).
16
Accuracy of approximations of solutions to Fredholm equations by kernel methods. (English)
Appl. Math. Comput. 218, No. 14, 7481-7497 (2012).
17
An efficient label setting/correcting shortest path algorithm. (English)
Comput. Optim. Appl. 51, No. 1, 437-455 (2012).
18
On tail bounds for random recursive trees. (English)
J. Appl. Probab. 49, No. 2, 566-581 (2012).
19
The number of bit comparisons used by quicksort: an average-case analysis. (English)
Electron. J. Probab. 17, Paper No. 43, 22 p., electronic only (2012).
20
Result 1 to 20 of 1170 total
Start
Contact
Print
General Help
