Alain Mayer | Columbia University

Alain Mayer

Columbia University, Computer Science, Alumnus

Columbia University, Computer Science, Alumnus |

Quality of Service

7 Followers | 6 Following | 6 Co-authors | —Total Views

Papers

Word Problems-This Time with Interleaving

Information and Computation/information and Control, 1994

Download

Views

The Complexity of Word Problems -- This Time with Interleaving

Informs Journal on Computing, 1994

. We consider regular expressions extended with the interleaving operator, andinvestigate the com... more . We consider regular expressions extended with the interleaving operator, andinvestigate the complexity of membership and inequivalence problems for these expressions.For expressions using the operators union, concatenation, Kleene star, and interleaving,we show that the inequivalence problem (deciding whether two given expressions do notdescribe the same set of words) is complete for exponential space. Without Kleene star, weshow that the inequivalence

Views

Secure protocol transformation via “expansion”

Proceedings of the 6th ACM conference on Computer and communications security - CCS '99, 1999

The design of simple cryptographic protocols for elementary two-party (session oriented) tasks (s... more The design of simple cryptographic protocols for elementary two-party (session oriented) tasks (such as entity authentication and key transport) has had a history (starting with [NS78]) where security has been quite evasive. Only recently we have seen protocol designs which are both provably secure and efficientCurrently, much attention of the designers of network systems and services is directed towards group

Views

Approximating max-min fair rates via distributed local scheduling with partial information

Proceedings of IEEE INFOCOM '96. Conference on Computer Communications, 1996

Max-Min fairness has been recognized as an optimal throughput-fairness definition. However, its r... more Max-Min fairness has been recognized as an optimal throughput-fairness definition. However, its realization in packet switching networks and its comput ational requirements have not yet been understood. In this work we attempt to take a step in this dire ction. The Max-Min definition is given in terms of transmission rates of sources sending to their destinations (sessions). In order to

Views

Local fairness in general-topology networks with convergence routing

Proceedings of INFOCOM'95, 1995

Convergence routing is a unique variant of deflection routing which ensures that packets(or cells... more Convergence routing is a unique variant of deflection routing which ensures that packets(or cells) will converge to their destinations along a global sense of direction. In this workwe show how global sense of direction can be used for the design of a control algorithmwhich (a) ensures fair access in switch-based local area networks (LANs), (b) is efficientwith respect to performance

Views

Local computations on static and dynamic graphs

Israel Symposium on Theory of Computing Systems, 1995

The purpose of this paper is a study of computation that can be done locally in a distributed net... more The purpose of this paper is a study of computation that can be done locally in a distributed network. By locally we mean within time (or distance) independent of the size of the network. In particular we are interested in algorithms that ore robust, i.e., perform well even if the underlying graph is not stable and links continuously fail and

Views