Indeks Artikel Jurnal| Indeks Artikel Jurnal |
| | All | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z | |
| Indeks Artikel Jurnal contains 84 collection(s) |
| Generating Curves and Swept Surfaces by Blended Circles, page 197-206 |
| Author: | Publisher: North-Holland: Elsevier Science Publishers B. V. | Call Number: | Edition: |
| Find Similar | Add To Favorites | Detail in New Window |
| Getting to Best: Efficiency Versus Optimality in Negotiation, page 169-204 |
| Author: | Publisher: Norwood, New Jersey: Ablex Publishing Corporations | Call Number: | Edition: |
| Find Similar | Add To Favorites | Detail in New Window |
| Graph Indexing Based on Discriminative Frequent Structure Analysis, page 960-993 |
| Author: | Publisher: New York: The Association for Computing Machinery | Call Number: | Edition: |
| Find Similar | Add To Favorites | Detail in New Window |
| Generalized Multidimensional Data Mapping and Query Processing, page 661-697 |
| Author: | Publisher: New York: The Association for Computing Machinery | Call Number: | Edition: |
| Find Similar | Add To Favorites | Detail in New Window |
| Guest Editor's Introduction, page 157 |
| Author: | Publisher: New York: Springer-Verlag | Call Number: | Edition: |
| Find Similar | Add To Favorites | Detail in New Window |
| Gossip-Based Aggregation in Large Dynamic Networks |
| Author: | Publisher: New York: The Association for Computing Machinery | Call Number: | Edition: |
| Find Similar | Add To Favorites | Detail in New Window |
| Graph Algorithms: Edge-Disjoint Routing in Plane Switch Graphs in Linear Time |
| Author: | Publisher: New York: The Assoction for Computing Machinery | Call Number: | Edition: |
| Find Similar | Add To Favorites | Detail in New Window |
| Graph Theory and Combinatorial Structures: The Heighg of a Random Binary Search Tree, An Analytic Approach to the Height of Binary Search Trees II |
| Author: | Publisher: New York: The Assoction for Computing Machinery | Call Number: | Edition: |
| Find Similar | Add To Favorites | Detail in New Window |
| Graph Theory and Combinatorial Structures: An O(log(n)4/3) Space Algorithm for (s,t) Connectivity in Undirected Graphs |
| Author: | Publisher: New York: The Assoction for Computing Machinery | Call Number: | Edition: |
| Find Similar | Add To Favorites | Detail in New Window |
| Getting Started with AspectJ |
| Author: | Publisher: New York, NY : The Association for Computing Machinery | Call Number: | Edition: |
| Find Similar | Add To Favorites | Detail in New Window |
| Prev 3 4 5 6 7 8 9 Next |