3,636 Result(s)
within
**mo Wang
Algorithm Analysis and Problem Complexity
Computer Communication Networks
-
Chapter and Conference Paper
Linear Complexity Profiles and Continued Fractions
The linear complexity, \( \mathcal{L} \) (sn), of a sequence sn is defined as the length of the shortest linear feedba...
-
Chapter and Conference Paper
Choice coordination with multiple alternatives (preliminary version)
The Choice Coordination Problem with k alternatives (k-CCP) was introduced by Rabin in 1982 [Rab82]. The goal is to design a wait-free protocol for n asynchronous processes which causes all correct processes to a...
-
Chapter and Conference Paper
A new subgraph of minimum weight triangulations
In this paper, two sufficient conditions for identifying a subgraph of minimum weight triangulation of a planar point set are presented. These conditions are based on local geometric properties of an identifyi...
-
Chapter and Conference Paper
Optimal algorithms for circle partitioning
Given a set of n points F on a circle and an integer k, we would like to find a size k subset of F such that these points are “evenly distributed” on the circle. We define two different criteria to capture the in...
-
Chapter and Conference Paper
Fixed topology steiner trees and spanning forests with applications in network communications
We present pseudo-polynomial time algorithms for fixed topology Steiner tree problems with various time-delay constraints. We study the spanning forest problem with bandwidth constraint. A polynomial-time algo...
-
Chapter and Conference Paper
A matrix representation of phylogenetic trees
In this paper we begin by describing two currently used methods for evaluating phylogenetic trees, one proposed by Fitch and Margoliash [5] and the other proposed by Saitou and Nei [7]. Both methods are heuris...
-
Chapter and Conference Paper
Lower Bounds for Wide-Sense Non-blocking Clos Network
The 3-stage Clos network is generally considered the most basic multistage interconnecting network(MIN). The nonblocking property of such network has been extensively studied in the past. However there are only a...
-
Chapter and Conference Paper
A New Family of Optimal 1-Hamiltonian Graphs with Small Diameter
In this paper, we construct a family of graphs denoted by Eye(s) that are 3-regualr, 3-connected, planar, hamiltonian, edge hamiltonian, and also optimal 1-hamiltonian. Furthermore, the diameter of Eye(s) is O(lo...
-
Chapter and Conference Paper
A Graph Optimization Problem in Virtual Colonoscopy
This paper studies a graph optimization problem occurring in virtual colonoscopy, which concerns finding the central path of a colon model created from helical computed tomography (CT) image data. The central ...
-
Chapter and Conference Paper
Maximum Weight Triangulation and Its Application on Graph Drawing
In this paper, we investigate the maximum weight triangulation of a polygon inscribed in a circle (simply inscribed polygon). A complete characterization of maximum weight triangulation of such polygons has be...
-
Chapter and Conference Paper
Arbitrated unconditionally secure authentication scheme with multi-senders
Previously, Desmedt and Seberry developed a practical proven secure authentication scheme with arbitration. Their scheme, however, only provides an environment for a single sender. Nevertheless, in real applic...
-
Chapter and Conference Paper
Maximum Stabbing Line in 2D Plane
Two line estimator problems using the perpendicular and vertical distance measure are considered in this paper. (1) Given a set of n points in a plane, the line estimator problem is to determine a straight line w...
-
Chapter and Conference Paper
Approximation Hardness and Secure Communication in Broadcast Channels
Problems of secure communication and computation have been studied extensively in network models. Goldreich, Goldwasser, and Linial, Franklin and Yung, and Franklin and Wright have initiated the study of secur...
-
Chapter and Conference Paper
Secure Communication in Broadcast Channels: The Answer to Franklin and Wright’s Question
Problems of secure communication and computation have been studied extensively in network models. Goldreich, Goldwasser, and Linial, Franklin and Yung, and Franklin and Wright have initiated the study of secur...
-
Chapter and Conference Paper
Characterization of Optimal Authentication Codes with Arbitration
In this paper we study authentication codes with arbitration (A 2-codes). An A 2-code is called optimal if its cheating probabilities achieve their information-theo...
-
Chapter and Conference Paper
A distributed object-oriented method for particle simulations on clusters
This paper describes a distributed object-oriented method for solving N-body problem of particle simulations. The method allows dynamic construction of a collaborative system based on the computational requiremen...
-
Chapter and Conference Paper
Linear Complexity versus Pseudorandomness: On Beth and Dai’s Result
Beth and Dai studied in their Eurocrypt paper [1] the relationship between linear complexity (that is, the length of the shortest Linear Feedback Shift Register that generates the given strings) of strings and...
-
Chapter and Conference Paper
A 3-Codes under Collusion Attacks
An A 3-code is an extension of A-code in which none of the three participants, transmitter, receiver and arbiter, is assumed trusted. In this paper we extend the previous model of A ...
-
Chapter and Conference Paper
Circuit-switched broadcast in multi-port 2D tori
This paper studies the one-to-all broadcast in a circuit-switched 2D torus of any size with α-port capability. This is a generalization of the one-port and all-port models. Existing results, as compared to ours, ...
-
Chapter and Conference Paper
Broadcast Authentication in Group Communication
Traditional point-to-point message authentication systems have been extensively studied in the literature. In this paper we consider authentication for group communication. The basic primitive is a multireceiv...
