Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Algorithmic Number Theory Symposium

Known as: ANTS (conference), Selfridge prize, ANTS 
Algorithmic Number Theory Symposium (ANTS) is a biennial academic conference, first held in Cornell in 1994, constituting an international forum for… Expand
Wikipedia

Related topics

Related topics

4 relations
Computational number theoryCryptographyLecture Notes in Computer ScienceList of computer science conferences

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2008
Highly Cited
2008
Ant Colony Optimization and Swarm Intelligence, 6th International Conference, ANTS 2008, Brussels, Belgium, September 22-24, 2008. Proceedings
A Combined Ant Colony and Differential Evolution Feature Selection Algorithm.- A Combined Ant Colony and Differential Evolution… Expand
Is this relevant?
Highly Cited
2006
Highly Cited
2006
Identity-based key agreement protocols from pairings
In recent years, a large number of identity- based key agreement protocols from pairings have been proposed. Some of them are… Expand
  • table 1
  • table 2
  • table 3
  • table 4
  • table 5
Is this relevant?
Highly Cited
2006
Highly Cited
2006
Counting Pedestrians in Video Sequences Using Trajectory Clustering
In this paper, we propose the use of lustering methods for automatic counting of pedestrians in video sequences. As input, we… Expand
  • figure 2
  • figure 1
  • figure 3
  • table I
  • figure 6
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Secure Conjunctive Keyword Search over Encrypted Data
We study the setting in which a user stores encrypted documents (e.g. e-mails) on an untrusted server. In order to retrieve… Expand
Is this relevant?
2004
2004
ANTS VI: algorithmic number theory symposium poster abstracts
The Algorithmic Number Theory Symposium (ANTS) meetings are held bianually since 1994, and have become the premier international… Expand
Is this relevant?
2004
2004
An Extension of Kedlaya's Algorithm to Hyperelliptic Curves in Characteristic 2
Abstract We present an algorithm to compute the zeta function of an arbitrary hyperelliptic curve over a finite field Fq of… Expand
  • table 1
Is this relevant?
Highly Cited
2002
Highly Cited
2002
Toward Hierarchical Identity-Based Encryption
We introduce the concept of hierarchical identity-based encryption (HIBE) schemes, give precise definitions of their security and… Expand
Is this relevant?
Highly Cited
2000
Highly Cited
2000
An ANTS heuristic for the frequency assignment problem
Abstract The problem considered in this paper consists in assigning frequencies to radio links between base stations and mobile… Expand
  • figure 1
  • figure 5
  • table 1
Is this relevant?
Highly Cited
1999
Highly Cited
1999
Cancer incidence and survival among children and adolescents: United States SEER Program 1975-1995.
 
Is this relevant?
Highly Cited
1974
Highly Cited
1974
Lecons sur les familles normales de fonctions analytiques et leurs applications
Chapitre I: Ensembles de points. Familles de fonctions: Ensembles. Domaines Familles de fonctions Chapitre II: Fonctions… Expand
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE