Result 1 to 20 of 712 total
Complex series for $1/π$. (English)
Ramanujan J. 29, No. 1-3, 135-144 (2012).
1
What is your “birthday elliptic curve”? (English)
Finite Fields Appl. 18, No. 6, 1232-1241 (2012).
2
Online flow time scheduling in the presence of preemption overhead. (English)
Gupta, Anupam (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 15th international workshop, APPROX 2012, and 16th international workshop, RANDOM 2012, Cambridge, MA, USA, August 15‒17, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-32511-3/pbk). Lecture Notes in Computer Science 7408, 85-97 (2012).
3
Boundary-twisted normal form and the number of elementary moves to unknot. (English)
New York J. Math. 18, 389-408 (2012).
4
A Riemann hypothesis analogue for near-MDS codes. (English)
Discrete Appl. Math. 160, No. 16-17, 2440-2444 (2012).
5
Improved bounds for speed scaling in devices obeying the cube-root rule. (English)
Theory Comput. 8, Paper No. 9, 209-229, electronic only (2012).
6
Simple proofs for duality of generalized minimum poset weights and weight distributions of (near-)MDS poset codes. (English)
Adv. Stud. Contemp. Math., Kyungshang 22, No. 1, 145-152 (2012).
7
Stanton graph decompositions. (English)
Bull. Inst. Comb. Appl. 64, 21-29 (2012).
8
Non-clairvoyant weighted flow time scheduling on different multi-processor models. (English)
Solis-Oba, Roberto (ed.) et al., Approximation and online algorithms. 9th international workshop, WAOA 2011, Saarbrücken, Germany, September 8‒9, 2011. Revised selected papers. Berlin: Springer (ISBN 978-3-642-29115-9/pbk). Lecture Notes in Computer Science 7164, 137-149 (2012).
9
A note on sorting buffers offline. (English)
Theor. Comput. Sci. 423, 11-18 (2012).
10
Continuous monitoring of distributed data streams over a time-based sliding window. (English)
Algorithmica 62, No. 3-4, 1088-1111 (2012).
11
Decision-making for supply chain integration. (English)
Decision Engineering. New York, NY: Springer (ISBN 978-1-4471-4032-0/hbk; 978-1-4471-4033-7/ebook). xii, 254~p. EUR~139.05/hbk (2012).
12
Dynamic RAT selection for multiple calls in heterogeneous wireless networks using group decision-making technique. (English)
Comput. Netw. 56, No. 4, 1390-1401 (2012).
13
Speed scaling of processes with arbitrary speedup curves on a multiprocessor. (English)
Theory Comput. Syst. 49, No. 4, 817-833 (2011).
14
A sequential Monte Carlo approach to computing tail probabilities in stochastic models. (English)
Ann. Appl. Probab. 21, No. 6, 2315-2342 (2011).
15
A linear size index for approximate pattern matching. (English)
J. Discrete Algorithms 9, No. 4, 358-364 (2011).
16
Edit distance to monotonicity in sliding windows. (English)
Asano, Takao (ed.) et al., Algorithms and computation. 22nd international symposium, ISAAC 2011, Yokohama, Japan, December 5‒8, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-25590-8/pbk). Lecture Notes in Computer Science 7074, 564-573 (2011).
17
The various adjoint algebras. (English)
J. Fuzzy Math. 19, No. 3, 675-684 (2011).
18
Framework for link reliability in inter-working multi-hop wireless networks. (English)
Math. Comput. Modelling 53, No. 11-12, 2219-2228 (2011).
19
Nonclairvoyant speed scaling for flow and energy. (English)
Algorithmica 61, No. 3, 507-517 (2011).
20
Result 1 to 20 of 712 total
Start
Contact
Print
General Help
