Randomized Non-sequential Processes
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Counting in Mobile Networks: Theory and Experimentation
WAE '99 Proceedings of the 3rd International Workshop on Algorithm Engineering
Multi-Path Routing combined with Resource Reservation
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
A three pronged approach to teaching undergraduate operating systems
ACM SIGOPS Operating Systems Review
Evolving distributed algorithms with genetic programming: election
Proceedings of the first ACM/SIGEVO Summit on Genetic and Evolutionary Computation
Proceedings of the 28th ACM symposium on Principles of distributed computing
Simplifying Itai-Rodeh Leader Election for Anonymous Rings
Electronic Notes in Theoretical Computer Science (ENTCS)
Improving static variable orders via invariants
ICATPN'07 Proceedings of the 28th international conference on Applications and theory of Petri nets and other models of concurrency
A fine-grained fullness-guided chaining heuristic for symbolic reachability analysis
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
Ten years of saturation: a petri net perspective
Transactions on Petri Nets and Other Models of Concurrency V
Model checking with probabilistic tabled logic programming
Theory and Practice of Logic Programming
Byzantine renaming in synchronous systems with t
Proceedings of the 2013 ACM symposium on Principles of distributed computing
| Hi-index | 0.00 |
In this paper, we use crossing number and wire area arguments to find lower bounds on the layout area and maximum edge length of a variety of computationally useful networks. In particular, we describe 1) an N-node planar graph which has layout area ...