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

International Symposium on Algorithms and Computation

ISAAC, the International Symposium on Algorithms and Computation, is an academic conference in the field of theoretical computer science. ISAAC has… Expand
Wikipedia

Related topics

Related topics

4 relations
Lecture Notes in Computer ScienceList of computer science conferencesTakao NishizekiTheoretical computer science

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Structural sparseness and complex networks
The field of complex networks has seen a steady growth in the last decade, fuelled by an ever-growing collection of relational… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
2009
2009
Bounds on Contention Management Algorithms
We present two new algorithms for contention management in transactional memory, the deterministic algorithm CommitRounds and the… Expand
  • figure 1
2009
2009
Strong Robustness of Randomized Rumor Spreading Protocols
Randomized rumor spreading is a classic protocol to disseminate information in a network. At SODA 2008, a quasirandom version of… Expand
2007
2007
Branching strategies to improve regularity of crew schedules in ex-urban public transit
We discuss timetables in ex-urban bus traffic that consist of many trips serviced every day together with some exceptions that do… Expand
  • figure 1
  • table 1
  • table 2
  • table 3
Highly Cited
2005
Highly Cited
2005
On the Wake-Up Problem in Radio Networks
Radio networks model wireless communication when processing units communicate using one wave frequency. This is captured by the… Expand
2005
2005
Speeding-Up Hierarchical Agglomerative Clustering in Presence of Expensive Metrics
In several contexts and domains, hierarchical agglomerative clustering (HAC) offers best-quality results, but at the price of a… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
2005
2005
Coloring unstructured radio networks
During and immediately after their deployment, ad hoc and sensor networks lack an efficient communication scheme rendering even… Expand
  • figure 1
  • figure 2
Highly Cited
2002
Highly Cited
2002
Visibility Queries and Maintenance in Simple Polygons
AbstractIn this paper we explore some novel aspects of visibility for stationary and moving points inside a simple polygon P . We… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
1996
1996
Parallel construction of multidimensional binary search trees
Multidimensional binary search tree (abbreviated k-d tree) is a popular data structure for the organization and manipulation of… Expand
  • figure 1
1995
1995
Proceedings of the 12th International Symposium on Algorithms and Computation
 
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