Special Issue "Sensor Algorithms"
QuicklinksA special issue of Algorithms (ISSN 1999-4893).
Deadline for manuscript submissions: closed (30 June 2009)
Special Issue Editor
Guest Editor
Dr. Costas Busch
Department of Computer Science, Louisiana State University, 296 Coates Hall, Baton Rouge, LA 70803, USA
Website: http://www.csc.lsu.edu/~busch
E-Mail: busch@csc.lsu.edu
Phone: +1 225 578 7510
Fax: +1 225 578 1465
Interests: distributed algorithms and data structures; communication algorithms; wireless and sensor networks; algorithmic game theory
Special Issue Information
Related Special Issue: The Special Issue Sensor Algorithms in the Journal Sensors
Submission
All papers should be submitted to algorithms@mdpi.com. To be published continuously until the deadline and papers will be listed together at the special issue website.
Submitted papers should not have been published nor be under consideration for publication elsewhere. All papers are refereed through a peer-review process. A guide for authors is available on the Instructions for Authors page. Algorithms is an international peer-reviewed quarterly journal published by MDPI.
Article Processing Charges (APC) will be waived for well prepared manuscripts of invited papers. For the first three volumes of this new journal the APC are of 300 CHF (or 550 CHF per paper for those papers that require extensive additional formatting and/or English corrections) for papers submitted before 31 December 2010.
Keywords
n/a
Published Papers (17 papers)
|
Algorithms 2008, 1(2), 52-68; doi:10.3390/a1020052
Received: 19 September 2008 / Accepted: 23 October 2008 / Published: 30 October 2008
Show/Hide Abstract
| Download PDF Full-text (863 KB) |
|
Algorithms 2008, 1(2), 69-99; doi:10.3390/a1020069
Received: 29 September 2008 / Accepted: 29 October 2008 / Published: 3 November 2008
Show/Hide Abstract
| Download PDF Full-text (636 KB) |
|
Algorithms 2008, 1(2), 130-152; doi:10.3390/a1020130
Received: 31 October 2008; in revised form: 21 November 2008 / Accepted: 29 November 2008 / Published: 3 December 2008
Show/Hide Abstract
| Download PDF Full-text (354 KB) |
|
Algorithms 2008, 1(2), 153-182; doi:10.3390/a1020153
Received: 31 August 2008; in revised form: 22 November 2008 / Accepted: 28 November 2008 / Published: 15 December 2008
Show/Hide Abstract
| Download PDF Full-text (1113 KB) |
|
Algorithms 2009, 2(1), 93-107; doi:10.3390/a2010093
Received: 30 October 2008; in revised form: 13 January 2009 / Accepted: 16 January 2009 / Published: 29 January 2009
Show/Hide Abstract
| Download PDF Full-text (370 KB) |
|
Algorithms 2009, 2(1), 121-157; doi:10.3390/a2010121
Received: 24 October 2008; in revised form: 30 December 2008 / Accepted: 20 January 2009 / Published: 3 February 2009
Show/Hide Abstract
| Download PDF Full-text (413 KB) |
|
Algorithms 2009, 2(1), 158-182; doi:10.3390/a2010158
Received: 29 October 2008; in revised form: 17 December 2008 / Accepted: 29 January 2009 / Published: 9 February 2009
Show/Hide Abstract
| Download PDF Full-text (568 KB) |
|
Algorithms 2009, 2(1), 259-281; doi:10.3390/a2010259
Received: 3 November 2008; in revised form: 8 January 2009 / Accepted: 17 February 2009 / Published: 20 February 2009
Show/Hide Abstract
| Download PDF Full-text (244 KB) |
|
Algorithms 2009, 2(1), 282-300; doi:10.3390/a2010282
Received: 28 November 2008; in revised form: 2 February 2009 / Accepted: 16 February 2009 / Published: 21 February 2009
Show/Hide Abstract
| Download PDF Full-text (422 KB) |
|
Algorithms 2009, 2(1), 361-397; doi:10.3390/a2010361
Received: 27 October 2008; in revised form: 8 January 2009 / Accepted: 8 January 2009 / Published: 4 March 2009
Show/Hide Abstract
| Download PDF Full-text (903 KB) |
|
Algorithms 2009, 2(1), 470-497; doi:10.3390/a2010470
Received: 27 October 2008; in revised form: 11 January 2009 / Accepted: 25 February 2009 / Published: 10 March 2009
Show/Hide Abstract
| Download PDF Full-text (809 KB) |
|
Algorithms 2009, 2(1), 518-532; doi:10.3390/a2010518
Received: 30 October 2008; in revised form: 23 January 2009 / Accepted: 25 February 2009 / Published: 12 March 2009
Show/Hide Abstract
| Download PDF Full-text (204 KB) |
|
Algorithms 2009, 2(1), 565-581; doi:10.3390/a2010565
Received: 31 October 2008; in revised form: 2 March 2009 / Accepted: 2 March 2009 / Published: 17 March 2009
Show/Hide Abstract
| Download PDF Full-text (365 KB) |
|
Algorithms 2009, 2(3), 1087-1104; doi:10.3390/a2031087
Received: 11 June 2009; in revised form: 31 August 2009 / Accepted: 3 September 2009 / Published: 8 September 2009
Show/Hide Abstract
| Download PDF Full-text (709 KB) |
|
Algorithms 2009, 2(3), 1248-1262; doi:10.3390/a2031248
Received: 2 August 2009; in revised form: 2 September 2009 / Accepted: 16 September 2009 / Published: 23 September 2009
Show/Hide Abstract
| Download PDF Full-text (381 KB) |
|
Algorithms 2009, 2(4), 1303-1326; doi:10.3390/a2041303
Received: 31 August 2009; in revised form: 16 September 2009 / Accepted: 29 September 2009 / Published: 14 October 2009
Show/Hide Abstract
| Download PDF Full-text (619 KB) |
|
Algorithms 2009, 2(4), 1368-1409; doi:10.3390/a2041368
Received: 25 August 2009; in revised form: 10 October 2009 / Accepted: 12 November 2009 / Published: 18 November 2009
Show/Hide Abstract
| Download PDF Full-text (2034 KB) |
Planned Papers
Last update: 19 January 2010
