Fred Annexstein

Fred S. Annexstein

Assoc Professor

Old Chemistry Building

811B

CEAS - Computer Science - 0030

Education

Ph.D, University of Massachusetts Amherst, 1990

Research and Practice Interests

Communication networks, interconnection networks, Internet technologies, algorithms for parallel and distributed processing, discrete algorithms, applied graph theory.

Research Support

Grant: #PO 402800A213 Investigators:Annexstein, Fred 02-02-2000 -12-31-2000 Ohio Department of Higher Education Case Study Course in Computational Science Role:PI $5,000.00 Closed Level:State of Ohio

Publications

Peer Reviewed Publications

Annexstein F.; Carraher L.; Wilsey P. (01-01-2013. )A GPGPU algorithm for c-Approximate r-nearest neighbor search in high dimensions.Proceedings - IEEE 27th International Parallel and Distributed Processing Symposium Workshops and PhD Forum, IPDPSW 2013, ,2079-2088

Annexstein F.; Berman K. (01-01-2012. )Synthesis ranking with critic resonance.Proceedings of the 4th Annual ACM Web Science Conference, WebSci'12, ,volume ,15-23

Annexstein F.; Strunjaš S. (12-01-2008. )Collaborative partitioning with maximum user satisfaction.International Conference on Information and Knowledge Management, Proceedings, ,1445-1446

Annexstein F.; Helmick M. (09-25-2007. )Depth-latency tradeoffs in multicast tree algorithms.Proceedings - International Conference on Advanced Information Networking and Applications, AINA, ,555-564

Annexstein F.; Berman K.; Strunjaš S.; Yoshikawa C. (08-22-2007. )Maximizing throughput in minimum rounds in an application-level relay service .Proceedings of the 9th Workshop on Algorithm Engineering and Experiments and the 4th Workshop on Analytic Algorithms and Combinatorics, ,109-119

Annexstein F.; Berman K.; Ranganathan A. (10-31-2006. )Dominating connectivity and reliability of heterogeneous sensor networks.Proceedings - Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops, PerCom Workshops 2006, ,2006 ,91-95

Annexstein F.; Berman K.; Strunjaš-Yoshikawa S. (07-05-2006. )Compact encodings for all local path information in web taxonomies with application to WordNet .Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), ,3831 LNCS ,511-520

Annexstein F.; Berman K.; Jovanovi? M. (04-06-2006. )Broadcasting in unstructured peer-to-peer overlay networks.Theoretical Computer Science, ,355 (1 ),25-36

Annexstein F.; Berman K.; Chun B.; Vahdat A.; Yoshikawa C. (12-01-2004. )The lonely NATed node.Proceedings of the 11th Workshop on ACM SIGOPS European Workshop, EW 11, ,

Annexstein F.; Berman K.; Henkener K.; Strunjaš S. (01-01-2004. )A space-efficient model for sharing personal knowledge objects in peer communities .CEUR Workshop Proceedings, ,108 ,

Annexstein F.; Berman K.; Jovanovic M.; Ponnavaikko K. (01-01-2002. )Indexing techniques for file sharing in scalable peer-to-peer networks.Proceedings - International Conference on Computer Communications and Networks, ICCCN, ,2002-January ,10-15

Annexstein F.; Berman K.; Jovanovi? M. (01-01-2001. )Latency effects on reachability in large-scale peer-to-peer networks .Annual ACM Symposium on Parallel Algorithms and Architectures, ,84-91

Annexstein F.; Berman K.; Hsu T.; Swaminathan R. (06-17-2000. )A multi-tree routing scheme using acyclic orientations.Theoretical Computer Science, ,240 (2 ),487-494

Annexstein F.; Berman K. (01-01-2000. )Directional routing via generalized st-numberings.SIAM Journal on Discrete Mathematics, ,13 (2 ),268-279

Annexstein F.; Berman K. (01-01-2000. )Distributed models and algorithms for survivability in network routing .Proceedings of the International Parallel Processing Symposium, IPPS, ,359-364

Annexstein F.; Swaminathan R. (11-09-1998. )On testing consecutive-ones property in parallel.Discrete Applied Mathematics, ,88 (1-3 ),7-28

Annexstein F. (12-01-1997. )Generating De Bruijn sequences: An efficient implementation.IEEE Transactions on Computers, ,46 (2 ),198-200

Annexstein F.; Berman K.; Swaminathan R. (01-01-1997. )A multi-tree generating routing scheme using acyclic orientations .Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), ,1276 ,18-22

Annexstein F.; Franco J. (06-23-1995. )Work-preserving emulations of shuffle-exchange networks: An analysis of the complex plane diagram.Discrete Applied Mathematics, ,60 (1-3 ),13-23

Annexstein F.; Franco J.; Schlipf J.; Swaminathan R. (05-12-1995. )On finding solutions for extended Horn formulas.Information Processing Letters, ,54 (3 ),133-137

Annexstein F.; Kuchko E. (01-01-1995. )A ranking algorithm for hamilton paths in shuffle-exchange graphs.Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), ,955 ,263-269

Annexstein F.; Swaminathan R. (01-01-1995. )On testing consecutive-ones property in parallel .Annual ACM Symposium on Parallel Algorithms and Architectures, ,234-243

Annexstein F. (01-01-1994. )Embedding Hypercubes and Related Networks into Mesh-Connected Processor Arrays.Journal of Parallel and Distributed Computing, ,23 (1 ),72-79

Annexstein F.; Baumslag M. (09-01-1993. )On the diameter and bisector size of Cayley graphs.Mathematical Systems Theory, ,26 (3 ),271-291

Annexstein F. (01-01-1993. )Parallel implementations of graph embeddings .Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), ,678 LNCS ,207-217

Annexstein F.; Baumslag M. (12-01-1991. )A unified framework for off-line permutation routing in parallel networks.Mathematical Systems Theory, ,24 (1 ),233-251

Annexstein F. (01-01-1991. )SIMD-emulations of hypercubes and related networks.Proceedings of the 3rd IEEE Symposium on Parallel and Distributed Processing 1991, ,656-659

Annexstein F.; Baumslag M. (12-01-1990. )Unified approach to off-line permutation routing on parallel networks .Algorithms and Architectures, ,398-406

Annexstein F.; Baumslag M.; Herbordt M.; Obrenic B.; Rosenberg A.; Weems C. (12-01-1990. )Achieving multigauge behavior in bit-serial SIMD architectures via emulation .186-195

Annexstein F.; Baumslag M.; Rosenberg A. (01-01-1990. )Group action graphs and parallel architectures.SIAM Journal on Computing, ,19 (3 ),544-569

Annexstein F. (03-01-1989. )Fault tolerance in hypercube-derivative networks.Proceedings of the 1st Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1989, ,179-188